# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163966 | 2019-11-16T12:37:31 Z | Leonardo_Paes | Street Lamps (APIO19_street_lamps) | C++17 | 569 ms | 9396 KB |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5+10; int n, q; string initial; vector<int> toggles; vector<int> events[maxn]; int main(){ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin >> n >> q; initial.resize(n+2); for(int i=1; i<=n; i++){ cin >> initial[i]; if(initial[i]=='0') events[i].push_back(0); } if(n<=100 and q<=100){ toggles.push_back(0); for(int t=1; t<=q; t++){ string op; cin >> op; if(op[0] == 'q'){ int a, b; cin >> a >> b; string now = initial; int ans = 0; for(int i=0; i<toggles.size(); i++){ if(now[toggles[i]]=='0') now[toggles[i]] = '1'; else now[toggles[i]] = '0'; bool ok = true; for(int j=a; j<b; j++) if(now[j] == '0') ok = false; if(ok) ans++; } cout << ans << endl; toggles.push_back(0); } else{ int i; cin >> i; toggles.push_back(i); } } } else{ for(int t=1; t<=q; t++){ string op; cin >> op; if(op[0] == 'q'){ int a, b; cin >> a >> b; int ans = 0; for(int i=0; i<events[a].size(); i++){ if(i%2){ ans += events[a][i] - events[a][i-1]; } else{ continue; } } if(events[a].size() == 0) ans = t; else if(events[a].size()%2 == 0) ans += t - events[a].back(); cout << ans << endl; } else{ int i; cin >> i; events[i].push_back(t); } } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7416 KB | Output is correct |
2 | Correct | 8 ms | 7420 KB | Output is correct |
3 | Correct | 9 ms | 7416 KB | Output is correct |
4 | Correct | 9 ms | 7416 KB | Output is correct |
5 | Correct | 9 ms | 7416 KB | Output is correct |
6 | Correct | 9 ms | 7416 KB | Output is correct |
7 | Correct | 10 ms | 7416 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 569 ms | 9396 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 7416 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 7416 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 7416 KB | Output is correct |
2 | Correct | 8 ms | 7420 KB | Output is correct |
3 | Correct | 9 ms | 7416 KB | Output is correct |
4 | Correct | 9 ms | 7416 KB | Output is correct |
5 | Correct | 9 ms | 7416 KB | Output is correct |
6 | Correct | 9 ms | 7416 KB | Output is correct |
7 | Correct | 10 ms | 7416 KB | Output is correct |
8 | Incorrect | 569 ms | 9396 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |