oj.uz

Submission #1032819

# Submission time Handle Problem Language Result Execution time Memory
1032819 2024-07-24T09:13:15 Z Muhammet Street Lamps (APIO19_street_lamps) C++17
20 / 100
 48 ms 25276 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

const ll N = 300005;
const ll M = 1e9 + 7;

int T, n, q, ind1[N], a1[N], b1[N], x[N], y[N];

string s[N], s1[N];

int main(){
	ios::sync_with_stdio(false); cin.tie(0);

	cin >> n >> q >> s[0];

	if(n <= 100 and q <= 100){
		for(int i = 1; i <= q; i++){
			string s1;
			cin >> s1;
			s[i] = s[i-1];
			if(s1 == "toggle"){
				int ind;
				cin >> ind;
				ind--;
				if(s[i][ind] == '1') s[i][ind] = '0';
				else s[i][ind] = '1';
			}
			else {
				int a, b, ans = 0;
				cin >> a >> b;
				for(int j = 0; j <= i-1; j++){
					bool tr = 0;
					for(int k = a-1; k < b-1; k++){
						if(s[j][k] == '0'){
							tr = 1;
							break;
						}
					}
					ans += (tr == 0);
				}
				cout << ans << '\n';
			}
		}
	}
	else {
		for(int i = 0; i < sz(s[0]); i++){
			if(s[0][i] == 1) x[i] = 0;
			else x[i] = -1;
		}
		for(int i = 1; i <= q; i++){
			string s1;
			cin >> s1;
			if(s1 == "toggle"){
				int ind;
				cin >> ind;
				ind--;
				if(s[0][ind] == '0'){
					x[ind] = i;
					s[0][ind] = '1';
				}
				else {
					y[i] += abs(i-x[i]);
					x[i] = -1;
					s[0][ind] = '0';
				}
			}
			else {
				int a, b, ans;
				cin >> a >> b;
				ans = y[a];
				if(x[a] != -1) ans += (abs(i-x[a])+1);
				cout << ans << "\n";
			}
		}
	}

	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 21084 KB Output is correct
2 Correct 3 ms 21080 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 5 ms 21156 KB Output is correct
6 Correct 3 ms 21080 KB Output is correct
7 Correct 6 ms 21140 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 21084 KB Output is correct
2 Correct 3 ms 21080 KB Output is correct
3 Correct 3 ms 21084 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 5 ms 21156 KB Output is correct
6 Correct 3 ms 21080 KB Output is correct
7 Correct 6 ms 21140 KB Output is correct
8 Incorrect 48 ms 25276 KB Output isn't correct
9 Halted 0 ms 0 KB -