oj.uz

Submission #407271

# Submission time Handle Problem Language Result Execution time Memory
407271 2021-05-18T16:55:58 Z anime Street Lamps (APIO19_street_lamps) C++14
100 / 100
 3309 ms 53572 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T> using ordered_set = tree<T,null_type,less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define int long long
#define pb push_back
#define pii pair<int,int>
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define endi puts("");
#define ret return
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
const int N = 3e5+5,INF = 1e18+7;
int q[N],z[N],xo;
char s[N];
vector <pair<pii,int>> der[4*N];

void update(int v,int l,int r,int ql,int qr,int lol,int ror,int cost){
	
	if (l > qr || r < ql)ret ;
	if (ql <= l && r <= qr){
		der[v].pb({{lol,ror},cost});
		ret ;
	}
	int m = l+r>>1;
	update(v<<1,l,m,ql,qr,lol,ror,cost);
	update(v<<1|1,m+1,r,ql,qr,lol,ror,cost);
}

int get_ans(int v,int l,int r,int pos,int x){
	
	int ans=0;
	for (pair<pii,int> z: der[v])
		if (z.fr.fr <= x && x <= z.fr.sc)
			ans += z.sc,xo^=1;
	
	if (l == r)ret ans;
	int m = l+r>>1;
	if (pos > m)
		ret get_ans(v<<1|1,m+1,r,pos,x)+ans;
	ret get_ans(v<<1,l,m,pos,x)+ans;
	
}




main(){
	int n,t,i;
	scanf("%lld%lld",&n,&t);
	scanf("%s",s+1);
	s[0] = s[n+1] = '0';
	set <int> as;
	for (i=0;i<=n+1;++i)
		if (s[i] == '0')as.insert(i);
	for (i=0;i<=n+1;++i){
		if(s[i] == '0') continue;
		int j=i;
		while(j <= n+1 && s[j] == s[i]) j++;
		update(1, 1, n, i, j-1, i, j-1, 0);
		i = j - 1;
	}
	for (i=1;i<=t;++i){
		string ss;
		cin>>ss;
		if (ss == "query"){
			int l,r;
			scanf("%lld%lld",&l,&r);
			
			r--;
			xo = 0;
			int ans = get_ans(1,1,n,l,r);
			if (xo)ans += i;
			printf("%lld\n",ans);
		}
		else {
			int pos;
			scanf("%lld",&pos);
			if (s[pos] == '0'){
				as.erase(pos);
				int l = *--as.upper_bound(pos);
				int r = *as.lower_bound(pos);
				update(1,1,n,l+1,pos,pos,r-1,-i);
				s[pos] = '1';
			} 
			else {
				int l = *--as.upper_bound(pos);
				int r = *as.lower_bound(pos);
				update(1,1,n,l+1,pos,pos,r-1,i);
				s[pos] = '0';
				as.insert(pos);
				
			}
			
		}
	}
	
	
}

Compilation message

street_lamps.cpp: In function 'void update(long long int, long long int, long long int, long long int, long long int, long long int, long long int, long long int)':
street_lamps.cpp:33:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |  int m = l+r>>1;
      |          ~^~
street_lamps.cpp: In function 'long long int get_ans(long long int, long long int, long long int, long long int, long long int)':
street_lamps.cpp:46:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |  int m = l+r>>1;
      |          ~^~
street_lamps.cpp: At global scope:
street_lamps.cpp:56:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   56 | main(){
      | ^~~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |  scanf("%lld%lld",&n,&t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
street_lamps.cpp:59:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |  scanf("%s",s+1);
      |  ~~~~~^~~~~~~~~~
street_lamps.cpp:76:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |    scanf("%lld%lld",&l,&r);
      |    ~~~~~^~~~~~~~~~~~~~~~~~
street_lamps.cpp:86:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |    scanf("%lld",&pos);
      |    ~~~~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28480 KB Output is correct
2 Correct 16 ms 28492 KB Output is correct
3 Correct 15 ms 28364 KB Output is correct
4 Correct 16 ms 28364 KB Output is correct
5 Correct 16 ms 28408 KB Output is correct
6 Correct 17 ms 28492 KB Output is correct
7 Correct 17 ms 28448 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1213 ms 36556 KB Output is correct
2 Correct 789 ms 36660 KB Output is correct
3 Correct 599 ms 38332 KB Output is correct
4 Correct 846 ms 47036 KB Output is correct
5 Correct 852 ms 44728 KB Output is correct
6 Correct 772 ms 48476 KB Output is correct
7 Correct 856 ms 43560 KB Output is correct
8 Correct 791 ms 30716 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28492 KB Output is correct
2 Correct 18 ms 28500 KB Output is correct
3 Correct 18 ms 28492 KB Output is correct
4 Correct 21 ms 28364 KB Output is correct
5 Correct 807 ms 49920 KB Output is correct
6 Correct 854 ms 48040 KB Output is correct
7 Correct 852 ms 43944 KB Output is correct
8 Correct 786 ms 30724 KB Output is correct
9 Correct 569 ms 29376 KB Output is correct
10 Correct 627 ms 29252 KB Output is correct
11 Correct 615 ms 29388 KB Output is correct
12 Correct 847 ms 43396 KB Output is correct
13 Correct 777 ms 30660 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 28492 KB Output is correct
2 Correct 17 ms 28492 KB Output is correct
3 Correct 17 ms 28508 KB Output is correct
4 Correct 18 ms 28536 KB Output is correct
5 Correct 843 ms 40032 KB Output is correct
6 Correct 821 ms 44144 KB Output is correct
7 Correct 759 ms 48504 KB Output is correct
8 Correct 691 ms 53572 KB Output is correct
9 Correct 544 ms 40692 KB Output is correct
10 Correct 291 ms 42948 KB Output is correct
11 Correct 531 ms 40612 KB Output is correct
12 Correct 302 ms 42564 KB Output is correct
13 Correct 529 ms 40596 KB Output is correct
14 Correct 291 ms 42700 KB Output is correct
15 Correct 849 ms 43416 KB Output is correct
16 Correct 782 ms 30756 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28480 KB Output is correct
2 Correct 16 ms 28492 KB Output is correct
3 Correct 15 ms 28364 KB Output is correct
4 Correct 16 ms 28364 KB Output is correct
5 Correct 16 ms 28408 KB Output is correct
6 Correct 17 ms 28492 KB Output is correct
7 Correct 17 ms 28448 KB Output is correct
8 Correct 1213 ms 36556 KB Output is correct
9 Correct 789 ms 36660 KB Output is correct
10 Correct 599 ms 38332 KB Output is correct
11 Correct 846 ms 47036 KB Output is correct
12 Correct 852 ms 44728 KB Output is correct
13 Correct 772 ms 48476 KB Output is correct
14 Correct 856 ms 43560 KB Output is correct
15 Correct 791 ms 30716 KB Output is correct
16 Correct 17 ms 28492 KB Output is correct
17 Correct 18 ms 28500 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 21 ms 28364 KB Output is correct
20 Correct 807 ms 49920 KB Output is correct
21 Correct 854 ms 48040 KB Output is correct
22 Correct 852 ms 43944 KB Output is correct
23 Correct 786 ms 30724 KB Output is correct
24 Correct 569 ms 29376 KB Output is correct
25 Correct 627 ms 29252 KB Output is correct
26 Correct 615 ms 29388 KB Output is correct
27 Correct 847 ms 43396 KB Output is correct
28 Correct 777 ms 30660 KB Output is correct
29 Correct 20 ms 28492 KB Output is correct
30 Correct 17 ms 28492 KB Output is correct
31 Correct 17 ms 28508 KB Output is correct
32 Correct 18 ms 28536 KB Output is correct
33 Correct 843 ms 40032 KB Output is correct
34 Correct 821 ms 44144 KB Output is correct
35 Correct 759 ms 48504 KB Output is correct
36 Correct 691 ms 53572 KB Output is correct
37 Correct 544 ms 40692 KB Output is correct
38 Correct 291 ms 42948 KB Output is correct
39 Correct 531 ms 40612 KB Output is correct
40 Correct 302 ms 42564 KB Output is correct
41 Correct 529 ms 40596 KB Output is correct
42 Correct 291 ms 42700 KB Output is correct
43 Correct 849 ms 43416 KB Output is correct
44 Correct 782 ms 30756 KB Output is correct
45 Correct 3309 ms 33012 KB Output is correct
46 Correct 493 ms 33264 KB Output is correct
47 Correct 474 ms 37216 KB Output is correct
48 Correct 836 ms 46640 KB Output is correct
49 Correct 695 ms 29224 KB Output is correct
50 Correct 679 ms 29056 KB Output is correct
51 Correct 681 ms 29116 KB Output is correct
52 Correct 699 ms 29216 KB Output is correct
53 Correct 691 ms 29252 KB Output is correct
54 Correct 703 ms 29112 KB Output is correct