# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163953 | luciocf | Street Lamps (APIO19_street_lamps) | C++14 | 5085 ms | 10368 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;
const int maxn = 3e5+10;
struct Event
{
int op, a, b;
} event[maxn];
int n, q;
bool mark[maxn], aux[maxn];
void sub_1(void)
{
for (int i = 1; i <= q; i++)
{
if (event[i].op == 0) continue;
int ans = 0;
for (int j = 1; j <= n; j++)
aux[j] = mark[j];
for (int j = 1; j <= i; j++)
{
bool ok = 1;
for (int l = event[i].a; l < event[i].b; l++)
if (!aux[l])
ok = 0;
if (ok) ans++;
if (event[j].op == 0)
aux[event[j].a] = !aux[event[j].a];
}
printf("%d\n", ans);
}
}
int main(void)
{
scanf("%d %d", &n, &q);
for (int i = 1; i <= n; i++)
{
char x;
scanf(" %c", &x);
if (x == '1') mark[i] = 1;
else mark[i] = 0;
}
for (int i = 1; i <= q; i++)
{
string op;
cin >> op;
if (op[0] == 't')
{
int a;
scanf("%d", &a);
event[i] = {0, a, -1};
}
else
{
int a, b;
scanf("%d %d", &a, &b);
event[i] = {1, a, b};
}
}
sub_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... |