oj.uz

Submission #902448

# Submission time Handle Problem Language Result Execution time Memory
902448 2024-01-10T12:21:38 Z Trisanu_Das Street Lamps (APIO19_street_lamps) C++17
40 / 100
 697 ms 10636 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,q; cin>>n>>q;
	string st; cin>>st;
	if (n<=100&&q<=100){
		vector <string> v;
		v.push_back(st);
		for (int z=1; z<=q; z++){
			string s;
			cin>>s;
			if (s=="toggle"){
				int u;
				cin>>u;
				u--;
				if (st[u]=='0') st[u]='1';
				else st[u]='0';
			} else {
				int t,u;
				cin>>t>>u;
				t--;
				u--;
				int cnt=0;
				for (auto&i:v){
					bool ok=1;
					for (int j=t; j<u; j++){
						if (i[j]!='1'){
							ok=0;
							break;
						}
					}
					if (ok) cnt++;
				}
				cout<<cnt<<endl;
			}
			v.push_back(st);
		}
	} else {
		int cnt[n]={},on[n]={};
		for (int i=0; i<n; i++) if (st[i]=='1') on[i]=0;
		for (int z=1; z<=q; z++){
			string s; cin>>s;
			if (s=="toggle"){
				int u;
				cin>>u;
				u--;
				if (st[u]=='0'){
					st[u]='1';
					on[u]=z;
				} else {
					st[u]='0';
					cnt[u]+=z-on[u];
				}
			} else {
				int u,dummy;
				cin>>u>>dummy;
				u--;
				if (st[u]=='0') cout<<cnt[u]<<endl;
				else cout<<cnt[u]+z-on[u]<<endl;
			}
		}	
	}
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 4412 KB Output is correct
2 Correct 381 ms 4656 KB Output is correct
3 Correct 355 ms 5216 KB Output is correct
4 Correct 404 ms 8720 KB Output is correct
5 Correct 423 ms 9324 KB Output is correct
6 Correct 389 ms 8792 KB Output is correct
7 Correct 669 ms 9232 KB Output is correct
8 Correct 697 ms 10636 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 350 ms 4412 KB Output is correct
9 Correct 381 ms 4656 KB Output is correct
10 Correct 355 ms 5216 KB Output is correct
11 Correct 404 ms 8720 KB Output is correct
12 Correct 423 ms 9324 KB Output is correct
13 Correct 389 ms 8792 KB Output is correct
14 Correct 669 ms 9232 KB Output is correct
15 Correct 697 ms 10636 KB Output is correct
16 Incorrect 1 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -