Submission #431087

#TimeUsernameProblemLanguageResultExecution timeMemory
431087Return_0Street Lamps (APIO19_street_lamps)C++17
100 / 100
4639 ms275976 KiB
#pragma GCC optimize("Ofast,unroll-loops") // #pragma comment(linker, "/stack:200000000") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef int ll; typedef long double ld; typedef pair <ll, ll> pll; #ifdef SINA #define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); } #define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush(); #else #define dbg(...) 0 #define dbg2(x, j, n) 0 #endif #define SZ(x) ((ll)((x).size())) #define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout); #define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i]; #define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n'); #define kill(x) return cout<< (x) << endl, 0 #define cl const ll #define fr first #define sc second #define lc (v << 1) #define rc (lc | 1) #define mid ((l + r) >> 1) #define All(x) (x).begin(), (x).end() cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353; template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';} template <class A> ostream& operator << (ostream& out, const vector<A> &a) { out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; } template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>; cl N = 3e5 + 7; ll n, q; set <ll> off; gp_hash_table <ll, ll> fen [N]; string s; inline void add (ll l, cl &r, cl &x) { for (; l; l -= l & -l) for (ll i = r; i; i -= i & -i) fen[l][i] += x; } inline void add_to_rect (cl &a, cl &b, cl &c, cl &d, cl &x) { add(b, d, x); add(a - 1, d, -x); add(b, c - 1, -x); add(a - 1, c - 1, x); } inline ll ask_sum (ll l, cl &r) { ll ret = 0; for (; l < N; l += l & -l) for (ll i = r; i < N; i += i & -i) if (fen[l].find(i) != fen[l].end()) ret += fen[l][i]; return ret; } int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>> n >> q >> s; off.insert(0); off.insert(n + 1); for (ll i = 0; i < n; i++) if (s[i] == '0') off.insert(i + 1); for (ll i = 1; i <= q; i++) { string tp; cin>> tp; if (tp == "toggle") { ll x; cin>> x; ll l = *(--off.lower_bound(x)) + 1, r = *off.upper_bound(x); if (off.count(x)) { off.erase(x); add_to_rect(l, x, x + 1, r, -i); } else { off.insert(x); add_to_rect(l, x, x + 1, r, i); } } else { ll l, r; cin>> l >> r; cout<< ask_sum(l, r) + (off.lower_bound(l) == off.upper_bound(r - 1) ? i : 0) << '\n'; } } cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; return 0; } /* 5 7 11011 query 1 2 query 1 2 query 1 6 query 3 4 toggle 3 query 3 4 query 1 6 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...