# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140532 | luciocf | Street Lamps (APIO19_street_lamps) | C++14 | 3 ms | 376 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 Op
{
int type;
int ind;
} query[maxn];
int n, q;
bool on[maxn];
bool mark[maxn];
void solve_small(void)
{
for (int i = 1; i <= q; i++)
{
string op;
cin >> op;
if (op == "toggle")
{
int ind;
scanf("%d", &ind);
query[i] = {0, ind};
}
else
{
int l, r;
scanf("%d %d", &l, &r);
query[i] = {1, -1};
int ans = 0;
for (int j = 1; j <= n; j++)
mark[j] = on[j];
for (int j = 1; j <= i; j++)
{
if (query[j].type == 1)
{
bool ok = 1;
for (int k = l; k < r; k++)
if (!mark[k])
ok = 0;
if (ok) ans++;
}
else
{
bool ok = 1;
for (int k = l; k < r; k++)
if (!mark[k])
ok = 0;
if (ok) ans++;
mark[query[j].ind] = !mark[query[j].ind];
}
}
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') on[i] = true;
}
if (n <= 100 && q <= 100)
{
solve_small();
return 0;
}
}
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... |