代码

#include <stdint.h>
#include <sys/auxv.h>
#include <unistd.h>

struct DuckInfo {
  uint64_t abi_version;
  const char *stdin_ptr; uint64_t stdin_size;
  char *stdout_ptr; uint64_t stdout_limit; uint64_t stdout_size;
  char *stderr_ptr; uint64_t stderr_limit; uint64_t stderr_size;
  const char *IB_ptr; uint64_t IB_limit;
  char *OB_ptr; uint64_t OB_limit;
  uint64_t tsc_frequency;
} __attribute__((packed));

typedef unsigned __int128 u128;
#define FULL ((u128)-1)
#define NB 234496
#define N1 3664
#define N2 58

static u128 blk[NB];
static uint64_t fm1[N1], nm1[N1];
static uint64_t fm2[N2], nm2[N2];
static uint64_t fm3, nm3;

static const char *P;
static uint64_t O;

static inline int ctz(uint64_t x){ return __builtin_ctzll(x); }

/* ---- SWAR decimal parser ---- */
static inline uint64_t parse_num(const char **pp) {
    const char *p = *pp;
    uint64_t x;
    __builtin_memcpy(&x, p, 8);
    uint64_t t = (x - 0x2121212121212121ull) & ~x & 0x8080808080808080ull;
    int L = t ? (__builtin_ctzll(t) >> 3) : 8;
    static const uint64_t m8[9] = {0,0xFF,0xFFFF,0xFFFFFF,0xFFFFFFFF,0xFFFFFFFFFFull,0xFFFFFFFFFFFFull,0xFFFFFFFFFFFFFFull,0xFFFFFFFFFFFFFFFFull};
    x &= m8[L];
    x &= 0x0F0F0F0F0F0F0F0FULL;
    x = __builtin_bswap64(x);
    x >>= (8 - L) * 8;
    uint64_t y = x + 10 * (x >> 8);
    y &= 0x00FF00FF00FF00FFULL;
    uint32_t e0 = (uint32_t)(y & 0xFF);
    uint32_t e1 = (uint32_t)((y >> 16) & 0xFF);
    uint32_t e2 = (uint32_t)((y >> 32) & 0xFF);
    uint32_t e3 = (uint32_t)((y >> 48) & 0xFF);
    uint64_t v = e0 + 100ULL*e1 + 10000ULL*e2 + 1000000ULL*e3;
    p += L;
    while (*p > ' ') { v = v*10 + (uint64_t)(*p - '0'); p++; }
    *pp = p;
    return v;
}


/* ---- point add / sub (single-block, materialize + bubble) ---- */

static inline int point_add(int pos, u128 v){
    int l2 = pos >> 12;
    int l1 = pos >> 6;
    uint64_t b2 = 1ull << (l1 & 63);
    uint64_t b1 = 1ull << (pos & 63);
    uint64_t b3 = 1ull << l2;
    uint64_t f3 = fm3, n3 = nm3;
    uint64_t f2 = fm2[l2], n2 = nm2[l2];
    if (f3 & b3) f2 = n2 = ~0ull;
    else if (!(n3 & b3)) f2 = n2 = 0;
    uint64_t f1 = fm1[l1], n1 = nm1[l1];
    if (f2 & b2) f1 = n1 = ~0ull;
    else if (!(n2 & b2)) f1 = n1 = 0;
    u128 old;
    if (f1 & b1) old = FULL;
    else if (!(n1 & b1)) old = 0;
    else old = blk[pos];
    u128 nv = old + v;
    blk[pos] = nv;
    int ovf = nv < old;
    if (nv == FULL) f1 |= b1; else f1 &= ~b1;
    if (nv != 0) n1 |= b1; else n1 &= ~b1;
    if (f1 == ~0ull) f2 |= b2; else f2 &= ~b2;
    if (n1 != 0) n2 |= b2; else n2 &= ~b2;
    if (f2 == ~0ull) f3 |= b3; else f3 &= ~b3;
    if (n2 != 0) n3 |= b3; else n3 &= ~b3;
    fm1[l1] = f1; nm1[l1] = n1;
    fm2[l2] = f2; nm2[l2] = n2;
    fm3 = f3; nm3 = n3;
    return ovf;
}

static inline int point_sub(int pos, u128 v){
    int l2 = pos >> 12;
    int l1 = pos >> 6;
    uint64_t b2 = 1ull << (l1 & 63);
    uint64_t b1 = 1ull << (pos & 63);
    uint64_t b3 = 1ull << l2;
    uint64_t f3 = fm3, n3 = nm3;
    uint64_t f2 = fm2[l2], n2 = nm2[l2];
    if (f3 & b3) f2 = n2 = ~0ull;
    else if (!(n3 & b3)) f2 = n2 = 0;
    uint64_t f1 = fm1[l1], n1 = nm1[l1];
    if (f2 & b2) f1 = n1 = ~0ull;
    else if (!(n2 & b2)) f1 = n1 = 0;
    u128 old;
    if (f1 & b1) old = FULL;
    else if (!(n1 & b1)) old = 0;
    else old = blk[pos];
    u128 nv = old - v;
    blk[pos] = nv;
    int ovf = nv > old;
    if (nv == FULL) f1 |= b1; else f1 &= ~b1;
    if (nv != 0) n1 |= b1; else n1 &= ~b1;
    if (f1 == ~0ull) f2 |= b2; else f2 &= ~b2;
    if (n1 != 0) n2 |= b2; else n2 &= ~b2;
    if (f2 == ~0ull) f3 |= b3; else f3 &= ~b3;
    if (n2 != 0) n3 |= b3; else n3 &= ~b3;
    fm1[l1] = f1; nm1[l1] = n1;
    fm2[l2] = f2; nm2[l2] = n2;
    fm3 = f3; nm3 = n3;
    return ovf;
}
/* ---- left-boundary suffix helpers (operate on a FULL/zero node) ---- */

/* zero blocks [pos, l2*4096+4095] of a FULL level-2 node l2; off2 = pos&4095 > 0 */
static inline void zero_full_l2(int l2, int off2){
    int pos = (l2 << 12) + off2;
    int l1 = pos >> 6, off = pos & 63;
    int l1in = l1 & 63;
    fm1[l1] = (off == 0) ? 0 : ((1ull << off) - 1);
    nm1[l1] = fm1[l1];
    fm2[l2] = (1ull << l1in) - 1;
    nm2[l2] = (off == 0) ? fm2[l2] : (fm2[l2] | (1ull << l1in));
    uint64_t b3 = 1ull << l2;
    fm3 &= ~b3;
    nm3 |= b3;
}

/* zero blocks [pos, l1*64+63] of a FULL level-1 node l1; off = pos&63 > 0 */
static inline void zero_full_l1(int l1, int off){
    fm1[l1] = (1ull << off) - 1;
    nm1[l1] = (1ull << off) - 1;
    int l2 = l1 >> 6;
    uint64_t b2 = 1ull << (l1 & 63);
    fm2[l2] &= ~b2;
    nm2[l2] |= b2;
}

/* set blocks [pos, l2*4096+4095] of a ZERO level-2 node l2 to full; off2 = pos&4095 > 0 */
static inline void set_full_l2(int l2, int off2){
    int pos = (l2 << 12) + off2;
    int l1 = pos >> 6, off = pos & 63;
    int l1in = l1 & 63;
    fm1[l1] = ~0ull << off;
    nm1[l1] = fm1[l1];
    fm2[l2] = ~0ull << l1in;
    nm2[l2] = fm2[l2];
    uint64_t b3 = 1ull << l2;
    if (fm2[l2] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
    nm3 |= b3;
}

/* set blocks [pos, l1*64+63] of a ZERO level-1 node l1 to full; off = pos&63 > 0 */
static inline void set_full_l1(int l1, int off){
    fm1[l1] = ~0ull << off;
    nm1[l1] = ~0ull << off;
    int l2 = l1 >> 6;
    uint64_t b2 = 1ull << (l1 & 63);
    if (fm1[l1] == ~0ull) fm2[l2] |= b2; else fm2[l2] &= ~b2;
    nm2[l2] |= b2;
}

/* ---- fused carry: find first non-full block j >= p, zero [p, j-1], increment j ---- */

static inline void carry_add(int p){
    int l2 = p >> 12, l1 = p >> 6, off = p & 63;
    int off2 = p & 4095;
    uint64_t m3 = ~fm3 >> l2;
    int l2pos = (off2 == 0) ? l2 : l2 + 1;
    if (off2 > 0 && (fm3 & (1ull << l2))){
        zero_full_l2(l2, off2);
    }
    while (m3){
        int l2n = l2 + ctz(m3);
        uint64_t b3 = 1ull << l2n;
        if (l2n > l2pos){
            uint64_t zm = ((1ull << (l2n - l2pos)) - 1) << l2pos;
            fm3 &= ~zm; nm3 &= ~zm;
        }
        l2pos = l2n + 1;
        if (!(nm3 & b3)){   /* level-2 node l2n all-zero */
            if (l2n > l2){
                int l1n = l2n << 6;
                blk[l2n << 12] = 1;
                fm1[l1n] = 0; nm1[l1n] = 1ull;
                fm2[l2n] = 0; nm2[l2n] = 1ull;
                fm3 &= ~b3; nm3 |= b3;
                return;
            } else {
                /* l2n == l2: node all-zero -> j = p */
                uint64_t b1 = 1ull << off;
                blk[p] = 1;
                fm1[l1] = 0; nm1[l1] = b1;
                uint64_t b2 = 1ull << (l1 & 63);
                fm2[l2] = 0; nm2[l2] = b2;
                fm3 &= ~b3; nm3 |= b3;
                return;
            }
        }
        int c2 = (l2n == l2) ? (l1 & 63) : 0;
        uint64_t m2 = ~fm2[l2n] >> c2;
        int c2pos = c2;
        if (l2n == l2 && off > 0 && (fm2[l2n] & (1ull << c2))){
            zero_full_l1(l1, off);
            c2pos = c2 + 1;
        }
        while (m2){
            int c2r = c2 + ctz(m2);
            uint64_t b2 = 1ull << c2r;
            int l1n = (l2n << 6) + c2r;
            if (c2r > c2pos){
                uint64_t zm = ((1ull << (c2r - c2pos)) - 1) << c2pos;
                fm2[l2n] &= ~zm; nm2[l2n] &= ~zm;
            }
            c2pos = c2r + 1;
            if (!(nm2[l2n] & b2)){   /* level-1 node l1n all-zero */
                if (l1n > l1){
                    blk[l1n << 6] = 1;
                    fm1[l1n] = 0; nm1[l1n] = 1ull;
                    fm2[l2n] &= ~b2; nm2[l2n] |= b2;
                } else {
                    /* l1n == l1: node all-zero -> j = p */
                    uint64_t b1 = 1ull << off;
                    blk[p] = 1;
                    fm1[l1] = 0; nm1[l1] = b1;
                    fm2[l2n] &= ~b2; nm2[l2n] |= b2;
                }
                if (fm2[l2n] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
                if (nm2[l2n] != 0) nm3 |= b3; else nm3 &= ~b3;
                return;
            }
            int c1 = (l1n == l1) ? off : 0;
            uint64_t m1 = ~fm1[l1n] >> c1;
            if (m1){
                int c1r = c1 + ctz(m1);
                int j = (l1n << 6) + c1r;
                uint64_t b1 = 1ull << c1r;
                if (c1r > c1){
                    uint64_t zm = ((1ull << (c1r - c1)) - 1) << c1;
                    fm1[l1n] &= ~zm; nm1[l1n] &= ~zm;
                }
                if (nm1[l1n] & b1){
                    u128 nv = blk[j] + 1;
                    blk[j] = nv;
                    if (nv == FULL) fm1[l1n] |= b1; else fm1[l1n] &= ~b1;
                    nm1[l1n] |= b1;
                } else {
                    blk[j] = 1;
                    fm1[l1n] &= ~b1; nm1[l1n] |= b1;
                }
                if (fm1[l1n] == ~0ull) fm2[l2n] |= b2; else fm2[l2n] &= ~b2;
                if (nm1[l1n] != 0) nm2[l2n] |= b2; else nm2[l2n] &= ~b2;
                if (fm2[l2n] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
                if (nm2[l2n] != 0) nm3 |= b3; else nm3 &= ~b3;
                return;
            }
            /* all blocks [c1,63] of l1n full: zero them, advance */
            {
                uint64_t zm = ~0ull << c1;
                fm1[l1n] &= ~zm; nm1[l1n] &= ~zm;
                if (fm1[l1n] == ~0ull) fm2[l2n] |= b2; else fm2[l2n] &= ~b2;
                if (nm1[l1n] != 0) nm2[l2n] |= b2; else nm2[l2n] &= ~b2;
            }
            m2 &= m2 - 1;
        }
        /* tail: full level-1 nodes [c2pos,63] -> zero */
        if (c2pos < 64){
            uint64_t zm = ~0ull << c2pos;
            fm2[l2n] &= ~zm; nm2[l2n] &= ~zm;
        }
        if (fm2[l2n] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
        if (nm2[l2n] != 0) nm3 |= b3; else nm3 &= ~b3;
        m3 &= m3 - 1;
    }
}

/* ---- fused borrow: find first non-zero block j >= p, set [p, j-1] full, decrement j ---- */

static inline void borrow_sub(int p){
    int l2 = p >> 12, l1 = p >> 6, off = p & 63;
    int off2 = p & 4095;
    uint64_t m3 = nm3 >> l2;
    int l2pos = (off2 == 0) ? l2 : l2 + 1;
    if (off2 > 0 && !(nm3 & (1ull << l2))){
        set_full_l2(l2, off2);
    }
    while (m3){
        int l2n = l2 + ctz(m3);
        uint64_t b3 = 1ull << l2n;
        if (l2n > l2pos){
            uint64_t zm = ((1ull << (l2n - l2pos)) - 1) << l2pos;
            fm3 |= zm; nm3 |= zm;
        }
        l2pos = l2n + 1;
        if (fm3 & b3){   /* level-2 node l2n all-full */
            if (l2n > l2){
                int l1n = l2n << 6;
                blk[l2n << 12] = FULL - 1;
                fm1[l1n] = ~0ull ^ 1ull; nm1[l1n] = ~0ull;
                fm2[l2n] = ~0ull ^ 1ull; nm2[l2n] = ~0ull;
                fm3 &= ~b3; nm3 |= b3;
                return;
            } else {
                /* l2n == l2: node all-full -> j = p */
                uint64_t b1 = 1ull << off;
                blk[p] = FULL - 1;
                fm1[l1] = ~0ull ^ b1; nm1[l1] = ~0ull;
                uint64_t b2 = 1ull << (l1 & 63);
                fm2[l2] = ~0ull ^ b2; nm2[l2] = ~0ull;
                fm3 &= ~b3; nm3 |= b3;
                return;
            }
        }
        int c2 = (l2n == l2) ? (l1 & 63) : 0;
        uint64_t m2 = nm2[l2n] >> c2;
        int c2pos = c2;
        if (l2n == l2 && off > 0 && !(nm2[l2n] & (1ull << c2))){
            set_full_l1(l1, off);
            c2pos = c2 + 1;
        }
        while (m2){
            int c2r = c2 + ctz(m2);
            uint64_t b2 = 1ull << c2r;
            int l1n = (l2n << 6) + c2r;
            if (c2r > c2pos){
                uint64_t zm = ((1ull << (c2r - c2pos)) - 1) << c2pos;
                fm2[l2n] |= zm; nm2[l2n] |= zm;
            }
            c2pos = c2r + 1;
            if (fm2[l2n] & b2){   /* level-1 node l1n all-full */
                if (l1n > l1){
                    blk[l1n << 6] = FULL - 1;
                    fm1[l1n] = ~0ull ^ 1ull; nm1[l1n] = ~0ull;
                    fm2[l2n] &= ~b2; nm2[l2n] |= b2;
                } else {
                    /* l1n == l1: node all-full -> j = p */
                    uint64_t b1 = 1ull << off;
                    blk[p] = FULL - 1;
                    fm1[l1] = ~0ull ^ b1; nm1[l1] = ~0ull;
                    fm2[l2n] &= ~b2; nm2[l2n] |= b2;
                }
                if (fm2[l2n] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
                if (nm2[l2n] != 0) nm3 |= b3; else nm3 &= ~b3;
                return;
            }
            int c1 = (l1n == l1) ? off : 0;
            uint64_t m1 = nm1[l1n] >> c1;
            if (m1){
                int c1r = c1 + ctz(m1);
                int j = (l1n << 6) + c1r;
                uint64_t b1 = 1ull << c1r;
                if (c1r > c1){
                    uint64_t zm = ((1ull << (c1r - c1)) - 1) << c1;
                    fm1[l1n] |= zm; nm1[l1n] |= zm;
                }
                if (fm1[l1n] & b1){
                    blk[j] = FULL - 1;
                    fm1[l1n] &= ~b1; nm1[l1n] |= b1;
                } else {
                    u128 nv = blk[j] - 1;
                    blk[j] = nv;
                    if (nv == 0) nm1[l1n] &= ~b1; else nm1[l1n] |= b1;
                }
                if (fm1[l1n] == ~0ull) fm2[l2n] |= b2; else fm2[l2n] &= ~b2;
                if (nm1[l1n] != 0) nm2[l2n] |= b2; else nm2[l2n] &= ~b2;
                if (fm2[l2n] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
                if (nm2[l2n] != 0) nm3 |= b3; else nm3 &= ~b3;
                return;
            }
            /* all blocks [c1,63] of l1n zero: set full, advance */
            {
                uint64_t zm = ~0ull << c1;
                fm1[l1n] |= zm; nm1[l1n] |= zm;
                if (fm1[l1n] == ~0ull) fm2[l2n] |= b2; else fm2[l2n] &= ~b2;
                if (nm1[l1n] != 0) nm2[l2n] |= b2; else nm2[l2n] &= ~b2;
            }
            m2 &= m2 - 1;
        }
        /* tail: zero level-1 nodes [c2pos,63] -> set full */
        if (c2pos < 64){
            uint64_t zm = ~0ull << c2pos;
            fm2[l2n] |= zm; nm2[l2n] |= zm;
        }
        if (fm2[l2n] == ~0ull) fm3 |= b3; else fm3 &= ~b3;
        if (nm2[l2n] != 0) nm3 |= b3; else nm3 &= ~b3;
        m3 &= m3 - 1;
    }
}

/* ---- add / sub a*2^r ---- */

static inline void add_val(int q, int r, uint64_t av){
    u128 lo = (u128)av << r;
    uint64_t hi = 0;
    if (r >= 99) hi = av >> (128 - r);
    if (point_add(q, lo)) carry_add(q + 1);
    if (hi && point_add(q + 1, (u128)hi)) carry_add(q + 2);
}
static inline void sub_val(int q, int r, uint64_t av){
    u128 lo = (u128)av << r;
    uint64_t hi = 0;
    if (r >= 99) hi = av >> (128 - r);
    if (point_sub(q, lo)) borrow_sub(q + 1);
    if (hi && point_sub(q + 1, (u128)hi)) borrow_sub(q + 2);
}

/* ---- parse ---- */

static inline int rd(){
    while (*P <= ' ') P++;
    int v = 0;
    while (*P > ' ') v = v*10 + (*P - '0'), P++;
    return v;
}
static inline int rds(){
    while (*P <= ' ') P++;
    int neg = 0;
    if (*P == '-'){ neg = 1; P++; }
    int v = 0;
    while (*P > ' ') v = v*10 + (*P - '0'), P++;
    return neg ? -v : v;
}

__attribute__((noreturn)) static void done(uint64_t olen, struct DuckInfo *di, char *out, int use_di){
    if (use_di) di->stdout_size = olen;
    else (void)!write(1, out, olen);
    asm volatile("mov $60, %%eax; xor %%edi, %%edi; syscall" ::: "rax","rdi","memory");
    __builtin_unreachable();
}

int main(){
    struct DuckInfo *di = (struct DuckInfo*)getauxval(0x6b637564);
    static char lbuf[1<<24];
    static char obuf[1<<22];
    char *out;
    int use_di = 0;
    if (di && di->abi_version >= 1 && di->stdin_ptr && di->stdout_ptr){
        P = di->stdin_ptr;
        out = di->stdout_ptr;
        use_di = 1;
    } else {
        long n2 = 0, t;
        while (n2 < (long)sizeof(lbuf) && (t = read(0, lbuf + n2, sizeof(lbuf) - n2)) > 0) n2 += t;
        lbuf[n2] = 0;
        P = lbuf;
        out = obuf;
    }

    int n = (int)parse_num(&P); P++;
    parse_num(&P); P++;
    parse_num(&P); P++;
    parse_num(&P); P++;

    for (int i = 0; i < n; i++){
        int op = *P++ - '0';
        P++;  /* skip separator */
        if (op == 1){
            int neg = 0;
            if (*P == '-'){ neg = 1; P++; }
            uint64_t a = parse_num(&P);
            P++;
            uint64_t b = parse_num(&P);
            P++;
            int q = (int)(b >> 7);
            int r = (int)(b & 127);
            if (neg) sub_val(q, r, a);
            else if (a) add_val(q, r, a);
        } else {
            uint64_t k = parse_num(&P);
            P++;
            int q = (int)(k >> 7);
            int r = (int)(k & 127);
            uint64_t v;
            {
                int l2 = q >> 12, l1 = q >> 6;
                uint64_t b3 = 1ull << l2;
                if (fm3 & b3) v = 1;
                else if (!(nm3 & b3)) v = 0;
                else {
                    uint64_t b2 = 1ull << (l1 & 63);
                    if (fm2[l2] & b2) v = 1;
                    else if (!(nm2[l2] & b2)) v = 0;
                    else {
                        uint64_t b1 = 1ull << (q & 63);
                        if (fm1[l1] & b1) v = 1;
                        else if (!(nm1[l1] & b1)) v = 0;
                        else v = (uint64_t)((blk[q] >> r) & 1);
                    }
                }
            }
            out[O++] = (char)('0' + (v & 1));
            out[O++] = '\n';
        }
    }
    done(O, di, out, use_di);
}

评测结果