# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982981 | 2024-05-15T06:24:33 Z | vjudge1 | Street Lamps (APIO19_street_lamps) | C++17 | 30 ms | 2132 KB |
#include<bits/stdc++.h> #define sz size() #define ll long long using namespace std; ll cnt[205][205]; void solve() { ll n, q, i, j, k; cin >> n >> q; string s; cin >> s; ll a[n + 1], sum[n + 1], lst[n + 1] = {}; for(i = 1; i <= n; ++i) a[i] = s[i - 1] - '0', sum[i] = a[i]; if(n <= 200 && q <= 200) { for(i = 1; i <= n; ++i) for(j = i; j <= n; ++j) { if(!a[j]) break; ++cnt[i][j]; } while(q--) { cin >> s; ll l, r; if(s == "toggle") cin >> l, a[l] ^= 1; else cin >> l >> r, cout << cnt[l][r - 1] << '\n'; for(i = 1; i <= n; ++i) for(j = i; j <= n; ++j) { if(!a[j]) break; ++cnt[i][j]; } } } for(i = 1; i <= q; ++i) { cin >> s; ll l, r; if(s == "toggle") { cin >> l; sum[l] += (i - lst[l]) * a[l]; a[l] ^= 1; lst[l] = i; } cin >> l >> r; cout << sum[l] + (i - lst[l]) * a[l] << '\n'; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 604 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 30 ms | 2132 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 604 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
8 | Incorrect | 30 ms | 2132 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |