Submission #362316

#TimeUsernameProblemLanguageResultExecution timeMemory
362316arborStreet Lamps (APIO19_street_lamps)C++17
20 / 100
5045 ms195764 KiB
#pragma GCC optimize "O3" #pragma GCC target "sse4" #pragma GCC optimize "Ofast" #include <bits/stdc++.h> #define all(x) begin(x), end(x) #define sz(x) int((x).size()) #define eb emplace_back #define pb push_back #define gc getchar_unlocked() #define pc(x) putchar_unlocked(x) template<typename T> void scan(T &x){x = 0;register bool _=0;register T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;} template<typename T> void printn(T n){register bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=n%10+48;n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);} template<typename First, typename ... Ints> void scan(First &arg, Ints&... rest){scan(arg);scan(rest...);} template<typename T> void print(T n){printn(n);pc(10);} template<typename First, typename ... Ints> void print(First arg, Ints... rest){printn(arg);pc(32);print(rest...);} using namespace std; using ll = long long; using pii = pair<int, int>; using vi = vector<int>; const int MN = 3e5 + 5, MM = 2.2e7; int N, Q, a[MN], rt[MN], ndc; int ls[MM], rs[MM]; int sum[MM]; short open[MM]; pii merge(pii p, pii q) { return {p.first + q.first, p.second + q.second}; } void upd(int &i, int l, int r, int x, int u, int v) { if (!i) i = ++ndc; if (l == r) { sum[i] += u; open[i] += v; return; } int m = (l + r) / 2; if (x <= m) upd(ls[i], l, m, x, u, v); else upd(rs[i], m + 1, r, x, u, v); sum[i] = sum[ls[i]] + sum[rs[i]]; open[i] = open[ls[i]] + open[rs[i]]; } pii get(int &i, int l, int r, int ql, int qr) { if (!i || l > qr || r < ql) return {0, 0}; if (l >= ql && r <= qr) return {sum[i], open[i]}; int m = (l + r) / 2; if (qr <= m) return get(ls[i], l, m, ql, qr); else if (ql > m) return get(rs[i], m + 1, r, ql, qr); return merge(get(ls[i], l, m, ql, qr), get(rs[i], m + 1, r, ql, qr)); } void modify(int x, int y, int u, int v) { for (; x <= N + 1; x += x & -x) upd(rt[x], 1, N + 1, y, u, v); } pii qry(int x, int y) { pii ret = {0, 0}; for (; x; x -= x & -x) { if (!rt[x]) continue; ret = merge(ret, get(rt[x], 1, N + 1, 1, y)); } return ret; } set<int> dat; inline void add(int x, int t) { // [pre + 1, x] * [x, nxt - 1] auto it = dat.find(x), pre = it, nxt = it; pre--, nxt++; int u = *pre, v = *nxt; modify(u + 1, x, 1, -t); modify(u + 1, v, -1, t); modify(x + 1, x, -1, t); modify(x + 1, v, 1, -t); // cout << "[" << *pre + 1 << ", " << x << "] * [" << x << ", " << *nxt - 1 << "]" << '\n'; dat.erase(x); } inline void rmv(int x, int t) { auto nxt = dat.upper_bound(x), pre = nxt; pre--; int u = *pre, v = *nxt; modify(u + 1, x, -1, t); modify(u + 1, v, 1, -t); modify(x + 1, x, 1, -t); modify(x + 1, v, -1, t); dat.insert(x); } int main() { //ios_base::sync_with_stdio(0), cin.tie(0); scan(N, Q); dat.insert(0), dat.insert(N + 1); for (int i = 1; i <= N; i++) { a[i] = gc - '0'; dat.insert(i); } gc; for (int i = 1; i <= N; i++) { if (a[i]) { add(i, 0); } } for (int i = 1; i <= Q; i++) { if (gc == 'q') { int l, r; scan(l, r); r--; pii p = qry(l, r); print(i * p.first + p.second); } else { int x; scan(x); if (a[x]) rmv(x, i), a[x] = 0; else add(x, i), a[x] = 1; } } return 0; }

Compilation message (stderr)

street_lamps.cpp: In function 'void scan(T&)':
street_lamps.cpp:11:58: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   11 | template<typename T> void scan(T &x){x = 0;register bool _=0;register T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
      |                                                          ^
street_lamps.cpp:11:73: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   11 | template<typename T> void scan(T &x){x = 0;register bool _=0;register T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
      |                                                                         ^
street_lamps.cpp: In function 'void printn(T)':
street_lamps.cpp:12:53: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   12 | template<typename T> void printn(T n){register bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=n%10+48;n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
      |                                                     ^
street_lamps.cpp: In instantiation of 'void scan(T&) [with T = int]':
street_lamps.cpp:111:26:   required from here
street_lamps.cpp:11:58: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   11 | template<typename T> void scan(T &x){x = 0;register bool _=0;register T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
      |                                                          ^
street_lamps.cpp:11:73: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   11 | template<typename T> void scan(T &x){x = 0;register bool _=0;register T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
      |                                                                         ^
street_lamps.cpp: In instantiation of 'void printn(T) [with T = int]':
street_lamps.cpp:14:44:   required from 'void print(T) [with T = int]'
street_lamps.cpp:109:41:   required from here
street_lamps.cpp:12:53: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   12 | template<typename T> void printn(T n){register bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=n%10+48;n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
      |                                                     ^
#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...