# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249067 | 2020-07-14T09:36:28 Z | crossing0ver | Street Lamps (APIO19_street_lamps) | C++17 | 1 ms | 512 KB |
#include<bits/stdc++.h> #define pb push_back #define ll long long using namespace std; const int N = 3e5+5; int n,q; string S; bool s[N]; void Small() { string type; vector<int> Q; Q.pb(-1); for (int rep = 0,a,b,x; rep < q; rep++) { cin >> type; if (type[0] == 't') { cin >> x; x--; Q.pb(x); } else { cin >> a >> b; a--; b-=2; int ans = 0; for (int i : Q) { if (i != -1 ) s[i] = (!s[i]); bool flag = 1; for (int i = a; i <= b; i++) if (s[i] == 0) flag = 0; if (flag) ans++; } for (int i : Q) if (i != -1) s[i] = (!s[i]); cout << ans <<'\n'; Q.pb(-1); } } } main() { ios::sync_with_stdio(0); cin >> n >> q >> S; for (int i = 0; i < S.size(); i++) s[i] = (S[i] == '1'); if (n <= 100 && q <= 100) Small(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Incorrect | 0 ms | 384 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |