結果
問題 | No.2901 Logical Sum of Substring |
ユーザー | satashun |
提出日時 | 2024-09-20 23:10:51 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 11,843 bytes |
コンパイル時間 | 4,000 ms |
コンパイル使用メモリ | 264,344 KB |
実行使用メモリ | 99,580 KB |
最終ジャッジ日時 | 2024-09-20 23:11:27 |
合計ジャッジ時間 | 32,340 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
ソースコード
#pragma region satashun // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> V<T> make_vec(size_t a) { return V<T>(a); } template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) { return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); } template <typename T, typename V> void fill_vec(T& v, const V& val) { v = val; } template <typename T, typename V> void fill_vec(vector<T>& vec, const V& val) { for (auto& v : vec) fill_vec(v, val); } #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <typename T> int arglb(const V<T>& v, const T& x) { return distance(v.begin(), lower_bound(ALL(v), x)); } template <typename T> int argub(const V<T>& v, const T& x) { return distance(v.begin(), upper_bound(ALL(v), x)); } template <class T> void mkuni(vector<T>& v) { sort(ALL(v)); v.erase(unique(ALL(v)), end(v)); } template <class T> vector<int> sort_by(const vector<T>& v, bool increasing = true) { vector<int> res(v.size()); iota(res.begin(), res.end(), 0); if (increasing) { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] < v[j]; }); } else { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] > v[j]; }); } return res; } // prototype template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p); template <class T> ostream& operator<<(ostream& os, const vector<T>& v); template <class T> istream& operator>>(istream& is, vector<T>& v); template <class T, size_t sz> ostream& operator<<(ostream& os, const array<T, sz>& arr); template <class T> ostream& operator<<(ostream& os, const set<T>& ST); template <class T> ostream& operator<<(ostream& os, const multiset<T>& ST); template <class T, class U> ostream& operator<<(ostream& os, const map<T, U>& MP); ostream& operator<<(ostream& o, __int128_t x); // io functions template <class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) { is >> x; } return is; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } template <class T, size_t sz> ostream& operator<<(ostream& os, const array<T, sz>& arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template <class T> ostream& operator<<(ostream& os, const set<T>& ST) { os << "{"; for (auto it = ST.begin(); it != ST.end(); ++it) { if (it != ST.begin()) os << ","; os << *it; } os << "}"; return os; } template <class T> ostream& operator<<(ostream& os, const multiset<T>& ST) { os << "{"; for (auto it = ST.begin(); it != ST.end(); ++it) { if (it != ST.begin()) os << ","; os << *it; } os << "}"; return os; } template <class T, class U> ostream& operator<<(ostream& os, const map<T, U>& MP) { for (auto it = MP.begin(); it != MP.end(); ++it) { os << "(" << it->first << ": " << it->second << ")"; } return os; } string to_string(__int128_t x) { if (x == 0) return "0"; string result; if (x < 0) { result += "-"; x *= -1; } string t; while (x) { t.push_back('0' + x % 10); x /= 10; } reverse(t.begin(), t.end()); return result + t; } ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template <class T> V<T>& operator+=(V<T>& vec, const T& v) { for (auto& x : vec) x += v; return vec; } template <class T> V<T>& operator-=(V<T>& vec, const T& v) { for (auto& x : vec) x -= v; return vec; } // suc : 1 = newline, 2 = space template <class T> void print(T x, int suc = 1) { cout << x; if (suc == 1) cout << "\n"; else if (suc == 2) cout << " "; } template <class T> void print(const vector<T>& v, int suc = 1) { for (int i = 0; i < v.size(); ++i) print(v[i], i == int(v.size()) - 1 ? suc : 2); } template <class T> void show(T x) { print(x, 1); } template <typename Head, typename... Tail> void show(Head H, Tail... T) { print(H, 2); show(T...); } int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(int t) { return __builtin_popcount(t); } int popcount(ll t) { return __builtin_popcountll(t); } int bit_parity(int t) { return __builtin_parity(t); } int bit_parity(ll t) { return __builtin_parityll(t); } struct prepare_io { prepare_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } prep_io; #pragma endregion satashun // index of root = 1 template <class U> struct segtree { using T = typename U::T; int sz; V<T> dat; segtree() {} segtree(int n) : _n(n) { sz = 1; while (sz < n) sz <<= 1; dat.assign(sz * 2, U::id()); } segtree(const V<T>& a) { int n = a.size(); _n = n; sz = 1; while (sz < n) sz <<= 1; dat.assign(sz * 2, U::id()); for (int i = 0; i < n; ++i) { dat[sz + i] = a[i]; } for (int i = sz - 1; i >= 1; --i) { upd(i); } } void upd(int p) { dat[p] = U::op(dat[p << 1], dat[p << 1 | 1]); } void build() { for (int i = sz - 1; i > 0; --i) { dat[i] = U::op(dat[i << 1], dat[i << 1 | 1]); } } void set(int p, T v) { p += sz; dat[p] = v; while (p >>= 1) { dat[p] = U::op(dat[p << 1], dat[p << 1 | 1]); } } T get(int p) const { return dat[p + sz]; } //[l, r) T prod(int l, int r) const { T lval = U::id(), rval = U::id(); for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) { if (l & 1) lval = U::op(lval, dat[l++]); if (r & 1) rval = U::op(dat[--r], rval); } return U::op(lval, rval); } // ABC194E // https://atcoder.jp/contests/practice2/submissions/33977727 // https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp // find max r s.t. f([l, r)) = true template <class F> int max_right(int l, F f) const { // assert(0 <= l && l <= _n); // assert(f(U::id())); if (l == sz) return sz; l += sz; auto cur = U::id(); do { while (l % 2 == 0) l >>= 1; if (!f(U::op(cur, dat[l]))) { while (l < sz) { l = l * 2; if (f(U::op(cur, dat[l]))) { cur = U::op(cur, dat[l]); l++; } } return l - sz; } cur = U::op(cur, dat[l]); l++; } while ((l & -l) != l); return _n; } // needs verification // find min l s.t. f([l, r)) = true template <class F> int min_left(int r, F f) const { // assert(0 <= r && r <= _n); // assert(f(U::id())); if (r == 0) return 0; r += sz; auto cur = U::id(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!f(U::op(dat[r], cur))) { while (r < sz) { r = (2 * r + 1); if (f(U::op(dat[r], cur))) { cur = U::op(dat[r], cur); r--; } } return r + 1 - sz; } cur = U::op(dat[r], cur); } while ((r & -r) != r); return 0; } private: int _n; }; constexpr int INF = TEN(9); const int B = 16; int K; struct C { int mini, xo, l, r; V<pii> vl, vr; C() { mini = INF, xo = 0, l = -INF, r = INF; } C(int pos, int v) { l = pos; r = pos; xo = v; mini = INF; if (v != 0) { vl.eb(v, pos); vr.eb(v, pos); } if (v == (1 << K) - 1) mini = 1; } }; // modify only U struct U { using T = C; static T id() { return T(); } static T op(const T& a, const T& b) { T res; if (a.l == -INF) { return b; } else if (b.l == -INF) { return a; } res.mini = min(a.mini, b.mini); res.xo = a.xo ^ b.xo; res.l = a.l; res.r = b.r; res.vl = a.vl; if (a.xo != 0) { int pre = a.xo; for (auto [x, p] : b.vl) { if ((x | pre) != pre) { pre |= x; res.vl.eb(pre, p); if (pre == (1 << K) - 1) { chmin(res.mini, p - res.l + 1); } } } } res.vr = b.vr; if (b.xo != 0) { int pre = b.xo; for (auto [x, p] : a.vr) { if ((x | pre) != pre) { pre |= x; res.vr.eb(pre, p); if (pre == (1 << K) - 1) { chmin(res.mini, res.r - p + 1); } } } } rep(i, SZ(a.vr)) { rep(j, SZ(b.vl)) { if ((a.vr[i].fi | b.vl[j].fi) == (1 << K) - 1) { chmin(res.mini, b.vl[j].se - a.vr[i].se + 1); } } } return res; } }; void slv() { // input int N; cin >> N >> K; V<int> A(N); cin >> A; V<C> vec; // Let's solve! rep(i, N) vec.eb(i, A[i]); segtree<U> seg(vec); int Q; cin >> Q; rep(q, Q) { int tp, l, r; cin >> tp >> l >> r; --l; if (tp == 1) { seg.set(l, C(l, r)); } else { auto res = seg.prod(l, r); if (res.mini != INF) { show(res.mini); } else { show(-1); } } } } int main() { int cases = 1; // cin >> cases; rep(i, cases) slv(); return 0; }