結果

問題 No.2265 Xor Range Substring Sum Query
ユーザー tokusakuraitokusakurai
提出日時 2023-06-03 13:51:12
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4,386 ms / 5,000 ms
コード長 8,621 bytes
コンパイル時間 3,076 ms
コンパイル使用メモリ 226,256 KB
実行使用メモリ 26,200 KB
最終ジャッジ日時 2024-06-09 03:32:13
合計ジャッジ時間 83,330 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 3,961 ms
26,076 KB
testcase_05 AC 4,059 ms
26,196 KB
testcase_06 AC 3,927 ms
26,076 KB
testcase_07 AC 4,107 ms
26,068 KB
testcase_08 AC 4,005 ms
26,200 KB
testcase_09 AC 4,346 ms
26,196 KB
testcase_10 AC 4,285 ms
26,072 KB
testcase_11 AC 4,337 ms
26,200 KB
testcase_12 AC 4,358 ms
26,072 KB
testcase_13 AC 4,213 ms
26,200 KB
testcase_14 AC 4,194 ms
26,072 KB
testcase_15 AC 4,334 ms
26,072 KB
testcase_16 AC 4,374 ms
26,200 KB
testcase_17 AC 4,386 ms
26,200 KB
testcase_18 AC 4,025 ms
26,072 KB
testcase_19 AC 3,593 ms
26,076 KB
testcase_20 AC 4,310 ms
26,072 KB
testcase_21 AC 4,219 ms
26,072 KB
testcase_22 AC 1,422 ms
14,208 KB
testcase_23 AC 1,393 ms
14,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <int mod>
struct Mod_Int {
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    static int get_mod() { return mod; }

    Mod_Int &operator+=(const Mod_Int &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator-=(const Mod_Int &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator*=(const Mod_Int &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator/=(const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator++() { return *this += Mod_Int(1); }

    Mod_Int operator++(int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator--() { return *this -= Mod_Int(1); }

    Mod_Int operator--(int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator-() const { return Mod_Int(-x); }

    Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; }

    Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; }

    Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; }

    Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; }

    bool operator==(const Mod_Int &p) const { return x == p.x; }

    bool operator!=(const Mod_Int &p) const { return x != p.x; }

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod - 2);
    }

    Mod_Int pow(long long k) const {
        Mod_Int now = *this, ret = 1;
        for (; k > 0; k >>= 1, now *= now) {
            if (k & 1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; }

    friend istream &operator>>(istream &is, Mod_Int &p) {
        long long a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

void solve() {
    int N;
    string S;

    cin >> N >> S;
    int K = N / 2;

    vector<mint> p2((1 << N) + 1, 1), p11((1 << N) + 1, 1);
    rep(i, 1 << N) p2[i + 1] = p2[i] * 2;
    rep(i, 1 << N) p11[i + 1] = p11[i] * 11;

    vector<vector<mint>> seg(N + 1, vector<mint>(1 << N, 0));

    auto f = [&](mint l, mint r, int dl, int dr) {
        return l * p11[dr] + r * p2[dl]; //
    };

    auto get = [&](auto &&get, int d, int i, int x) -> mint {
        if (d >= K) return seg[d][(i << (N - d)) + x];
        int l = 2 * i, r = 2 * i + 1;
        int y = flg(x, N - d - 1);
        int z = x & ~(1 << (N - d - 1));
        mint a = get(get, d + 1, l, z), b = get(get, d + 1, r, z);
        if (y) swap(a, b);
        return f(a, b, 1 << (N - d - 1), 1 << (N - d - 1));
    };

    // O(1) for d >= K
    auto recalc = [&](int d, int i, int x) {
        int l = 2 * i, r = 2 * i + 1;
        int y = flg(x, N - d - 1);
        int z = x & ~(1 << (N - d - 1));
        mint a = get(get, d + 1, l, z), b = get(get, d + 1, r, z);
        if (y) swap(a, b);
        seg[d][(i << (N - d)) + x] = f(a, b, 1 << (N - d - 1), 1 << (N - d - 1));
    };

    // O(sqrt(N))
    auto update = [&](int i, mint c) {
        seg[N][i] = c;
        per2(d, K, N) {
            i /= 2;
            rep(x, 1 << (N - d)) recalc(d, i, x);
        }
    };

    // O(sqrt(N))
    auto query = [&](auto &&query, int d, int i, int L, int R, int l, int r, int x) -> mint {
        chmax(l, L), chmin(r, R);
        if (l >= r) return 0;
        if (l == L && r == R) return get(get, d, i, x);
        int M = (L + R) / 2;
        int y = flg(x, N - d - 1);
        int z = x & ~(1 << (N - d - 1));
        mint vl, vr;
        int step = (1 << (N - d - 1));

        if (y == 0) {
            vl = query(query, d + 1, 2 * i, L, M, l, r, z);
            vr = query(query, d + 1, 2 * i + 1, M, R, l, r, z);
        } else {
            vl = query(query, d + 1, 2 * i + 1, M, R, l + step, r + step, z);
            vr = query(query, d + 1, 2 * i, L, M, l - step, r - step, z);
        }

        int dl = max(0, min(M, r) - l), dr = max(0, r - max(l, M));
        mint ret = f(vl, vr, dl, dr);
        return ret;
    };

    rep(i, 1 << N) {
        int c = S[i] - '0';
        seg[N][i] = c;
    }

    per(d, N) {
        rep(i, 1 << d) rep(x, 1 << (N - d)) {
            recalc(d, i, x); //
        }
    }

    int Q;
    cin >> Q;

    while (Q--) {
        int t;
        cin >> t;

        if (t == 1) {
            int x;
            mint y;
            cin >> x >> y;
            update(x, y);
        } else {
            int l, r, x;
            cin >> l >> r >> x;
            r++;
            cout << query(query, 0, 0, 0, 1 << N, l, r, x) << '\n';
        }
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0