oj.uz

Submission #396592

# Submission time Handle Problem Language Result Execution time Memory
396592 2021-04-30T11:14:15 Z mosiashvililuka Street Lamps (APIO19_street_lamps) C++14
40 / 100
 604 ms 23892 KB 
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,f[300009],pas,sub2,fx[300009],fx2[300009],ans[300009];
pair <string, pair <int, int> > p[300009];
string S;
int els(int q){
	if(q==0) return 1; else return 0;
}
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>a>>tes;
	cin>>S;
	S.insert(0,"0");
	p[0].first="W";
	for(i=1; i<=a; i++){
		f[i]=S[i]-'0';
	}
	a++;
	for(t=1; t<=tes; t++){
		cin>>p[t].first;
		if(p[t].first[0]=='q'){
			cin>>p[t].second.first>>p[t].second.second;
		}else{
			cin>>p[t].second.first;
		}
	}
	
	sub2=0;
	for(t=1; t<=tes; t++){
		if(p[t].first[0]=='q'){
			if(p[t].second.second!=p[t].second.first+1){
				sub2=1;
				break;
			}
		}
	}
	if(sub2==0){
		for(i=1; i<=a; i++){
			if(f[i]==1){
				fx[i]=0;
				fx2[i]=1;
			}
		}
		for(t=1; t<=tes; t++){
			if(p[t].first[0]=='t'){
				c=p[t].second.first;
				if(fx2[c]==0){
					fx[c]=t;
					fx2[c]=1;
				}else{
					ans[c]+=t-fx[c];
					fx2[c]=0;
				}
			}else{
				c=p[t].second.first;
				if(fx2[c]==0){
					cout<<ans[p[t].second.first]<<endl;
				}else{
					cout<<ans[p[t].second.first]+t-fx[c]<<endl;
				}
			}
		}
		return 0;
	}
	
	if(a<=102&&tes<=102){
		for(i=1; i<=tes; i++){
			if(p[i].first[0]=='t'){
				f[p[i].second.first]=els(f[p[i].second.first]);
				continue;
			}
			pas=0;
			for(ii=i-1; ii>=0; ii--){
				for(j=p[i].second.first; j<p[i].second.second; j++){
					if(f[j]==0) break;
				}
				if(j==p[i].second.second){
					pas++;
				}
				if(p[ii].first[0]=='t'){
					f[p[ii].second.first]=els(f[p[ii].second.first]);
				}
			}
			for(ii=1; ii<=i-1; ii++){
				if(p[ii].first[0]=='t'){
					f[p[ii].second.first]=els(f[p[ii].second.first]);
				}
			}
			cout<<pas<<endl;
		}
		exit(0);
	}

	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11980 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 12000 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 7 ms 11980 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 299 ms 12932 KB Output is correct
2 Correct 312 ms 16516 KB Output is correct
3 Correct 321 ms 17004 KB Output is correct
4 Correct 338 ms 23184 KB Output is correct
5 Correct 375 ms 22220 KB Output is correct
6 Correct 282 ms 22716 KB Output is correct
7 Correct 564 ms 20108 KB Output is correct
8 Correct 604 ms 23892 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 11980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 11980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11980 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 12000 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 7 ms 11980 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct
8 Correct 299 ms 12932 KB Output is correct
9 Correct 312 ms 16516 KB Output is correct
10 Correct 321 ms 17004 KB Output is correct
11 Correct 338 ms 23184 KB Output is correct
12 Correct 375 ms 22220 KB Output is correct
13 Correct 282 ms 22716 KB Output is correct
14 Correct 564 ms 20108 KB Output is correct
15 Correct 604 ms 23892 KB Output is correct
16 Incorrect 7 ms 11980 KB Output isn't correct
17 Halted 0 ms 0 KB -