# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
510692 | amukkalir | Street Lamps (APIO19_street_lamps) | C++17 | 5011 ms | 1868 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const int nax = 100;
int n, q;
int ans[nax+5][nax+5];
int bit[nax+5];
int s[nax+5];
void upd(int idx, int val) {
for (int i = idx; i<=n; i += i & (-i)) {
bit[i] += val;
}
}
int sum(int idx) {
int ret = 0;
for(int i = idx; i>0; i -= (i & (-i))) {
ret += bit[i];
}
return ret;
}
int get(int l, int r) {
return sum(r) - sum(l-1);
}
signed main () {
scanf("%d %d", &n,&q);
for(int i=1; i<=n; i++) {
int x;
scanf("%1d", &x);
if(x) upd(i,x);
s[i] = x;
}
while(q--) {
for(int i=1; i<=n+1; i++) {
for(int j=i+1; j<=n+1; j++) {
ans[i][j] += get(i,j-1) == (j-i);
}
}
string ts; cin >> ts;
if(ts == "query") {
int a, b; scanf("%d %d", &a, &b);
printf("%d\n", ans[a][b]);
} else {
int x; scanf("%d", &x);
upd(x, s[x] == 1 ? -1 : 1);
s[x] ^= 1;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |