oj.uz

Submission #756683

# Submission time Handle Problem Language Result Execution time Memory
756683 2023-06-12T04:59:33 Z boyliguanhan Street Lamps (APIO19_street_lamps) C++17
100 / 100
 2972 ms 177412 KB 
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
#define doi(x) cout << #x << " = " << x << '\n'
using namespace std;
#define N 15000100
#define mid ((rl+rr)>>1)
int root[300100], n, q, on[300100], sum[N], ch[N][2], cnt;
void upd1(int &rt,int rl,int rr,int x,int w){
	if (!rt) rt=++cnt;sum[rt]+=w;
	if (rl==rr) return;
	(mid>=x?upd1(ch[rt][0],rl,mid,x,w):upd1(ch[rt][1],mid+1,rr,x,w));
}
int query1(int rt,int rl,int rr,int l,int r){
	if (!rt||rl>r||rr<l) return 0;
	if (rl>=l&&rr<=r) return sum[rt];
	return query1(ch[rt][0],rl,mid,l,r)+query1(ch[rt][1],mid+1,rr,l,r);
}
inline void upd2(int x,int r,int w){
	while(x<=n+1)
        upd1(root[x],1,n+1,r,w),x+=x&-x;
}
inline int query2(int x,int y){
	int ans=0;
	while(x)
        ans+=query1(root[x],1,n+1,1,y),x-=x&-x;
	return ans;
}
inline void upd3(int x1, int y1, int x2, int y2, int W) {
    upd2(x1, y1, W);
    query2(5,6);
    upd2(x1, y2 + 1, -W);
    upd2(x2 + 1, y1, -W);
    upd2(x2 + 1, y2 + 1, W);
}
struct seg{
    int l, r;
};
inline bool operator < (seg a,seg b){
	return a.r<b.r;
} 
set<seg> st;
int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> q;
    n++;
    string str;
    cin >> str;
    for (int i=1;i<=n;i++){
		st.insert((seg){i,i});
	}
	for (int i=1;i<n;i++){
		on[i]=(str[i-1]-48);
		if (on[i]){
            auto it = --st.lower_bound((seg){0,i+1});
			int l = it->l;
			st.erase(it);st.erase((seg){i+1,i+1});
			st.insert((seg){l,i+1});
		}
	}
    for(auto i: st)
        if(on[i.l])
            upd3(i.l,i.l,i.r,i.r,q);
    for (int t=1;t<=q;t++){
		cin >> str;
		if (str=="query"){
			int x, y;
            cin >> x >> y;
			int ans=query2(x,y);
			x=(*(st.lower_bound((seg){0,x}))).l;
			y=(*(st.lower_bound((seg){0,y}))).l;
			cout << (ans-(q-t)*(x==y)) << '\n';
		} else {
			int x;
            cin >> x;
			auto it=st.lower_bound((seg){0,x});
			int lb1=it->l,rb1=x;
            if(!on[x]) it++;
			int lb2=x+1,rb2=it->r;
			upd3(lb1,lb2,rb1,rb2,(on[x]?t-q:q-t));
            if(on[x]) {
				st.erase((seg){lb1,rb2});
				st.insert((seg){lb1,rb1});
                st.insert((seg){lb2,rb2}); 
            } else {
				st.erase((seg){lb1,rb1});
                st.erase((seg){lb2,rb2});
				st.insert((seg){lb1,rb2}); 
            }
			on[x]^=1;
		}
	}
}

Compilation message

street_lamps.cpp: In function 'void upd1(int&, int, int, int, int)':
street_lamps.cpp:9:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    9 |  if (!rt) rt=++cnt;sum[rt]+=w;
      |  ^~
street_lamps.cpp:9:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    9 |  if (!rt) rt=++cnt;sum[rt]+=w;
      |                    ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 4532 KB Output is correct
2 Correct 330 ms 5032 KB Output is correct
3 Correct 587 ms 7972 KB Output is correct
4 Correct 2131 ms 141420 KB Output is correct
5 Correct 1937 ms 123740 KB Output is correct
6 Correct 2223 ms 145732 KB Output is correct
7 Correct 399 ms 21348 KB Output is correct
8 Correct 245 ms 22876 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2333 ms 177412 KB Output is correct
6 Correct 2279 ms 156316 KB Output is correct
7 Correct 1767 ms 123140 KB Output is correct
8 Correct 246 ms 22908 KB Output is correct
9 Correct 79 ms 4000 KB Output is correct
10 Correct 98 ms 4300 KB Output is correct
11 Correct 85 ms 4540 KB Output is correct
12 Correct 478 ms 21344 KB Output is correct
13 Correct 235 ms 22912 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 1057 ms 109288 KB Output is correct
6 Correct 1582 ms 131012 KB Output is correct
7 Correct 2094 ms 145160 KB Output is correct
8 Correct 2972 ms 156660 KB Output is correct
9 Correct 398 ms 4184 KB Output is correct
10 Correct 360 ms 3312 KB Output is correct
11 Correct 416 ms 4088 KB Output is correct
12 Correct 388 ms 3304 KB Output is correct
13 Correct 401 ms 4052 KB Output is correct
14 Correct 355 ms 3304 KB Output is correct
15 Correct 559 ms 21556 KB Output is correct
16 Correct 261 ms 22940 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 247 ms 4532 KB Output is correct
9 Correct 330 ms 5032 KB Output is correct
10 Correct 587 ms 7972 KB Output is correct
11 Correct 2131 ms 141420 KB Output is correct
12 Correct 1937 ms 123740 KB Output is correct
13 Correct 2223 ms 145732 KB Output is correct
14 Correct 399 ms 21348 KB Output is correct
15 Correct 245 ms 22876 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2333 ms 177412 KB Output is correct
21 Correct 2279 ms 156316 KB Output is correct
22 Correct 1767 ms 123140 KB Output is correct
23 Correct 246 ms 22908 KB Output is correct
24 Correct 79 ms 4000 KB Output is correct
25 Correct 98 ms 4300 KB Output is correct
26 Correct 85 ms 4540 KB Output is correct
27 Correct 478 ms 21344 KB Output is correct
28 Correct 235 ms 22912 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 3 ms 596 KB Output is correct
33 Correct 1057 ms 109288 KB Output is correct
34 Correct 1582 ms 131012 KB Output is correct
35 Correct 2094 ms 145160 KB Output is correct
36 Correct 2972 ms 156660 KB Output is correct
37 Correct 398 ms 4184 KB Output is correct
38 Correct 360 ms 3312 KB Output is correct
39 Correct 416 ms 4088 KB Output is correct
40 Correct 388 ms 3304 KB Output is correct
41 Correct 401 ms 4052 KB Output is correct
42 Correct 355 ms 3304 KB Output is correct
43 Correct 559 ms 21556 KB Output is correct
44 Correct 261 ms 22940 KB Output is correct
45 Correct 96 ms 2736 KB Output is correct
46 Correct 164 ms 2760 KB Output is correct
47 Correct 996 ms 50596 KB Output is correct
48 Correct 2247 ms 141352 KB Output is correct
49 Correct 107 ms 4436 KB Output is correct
50 Correct 99 ms 4436 KB Output is correct
51 Correct 98 ms 4612 KB Output is correct
52 Correct 103 ms 4940 KB Output is correct
53 Correct 114 ms 4908 KB Output is correct
54 Correct 103 ms 4940 KB Output is correct