# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120573 | IOrtroiii | Street Lamps (APIO19_street_lamps) | C++14 | 2997 ms | 105108 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 N = 300300;
int n, q;
char s[N];
int t[N << 2];
#define md ((l + r) >> 1)
void modify(int v, int l, int r, int p) {
if (l == r) {
t[v] ^= 1;
return;
}
if (p <= md) modify(v << 1, l, md, p);
else modify(v << 1 | 1, md + 1, r, p);
t[v] = t[v << 1] + t[v << 1 | 1];
}
int lg[N], rg[N];
int findL(int v, int l, int r, int p) {
if (l > p || t[v] == r - l + 1) {
return -1;
}
if (l == r) return l;
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... |