# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927683 | 12345678 | Spring cleaning (CEOI20_cleaning) | C++17 | 171 ms | 21400 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 nx=1e5+5;
int n, q, dp[nx], sz[nx], id[nx], pa[nx], hd[nx], t, u, v, rt, vs[nx], k[nx];
vector<int> d[nx];
struct segtree
{
int a[4*nx], b[4*nx], lz[4*nx];
void pushlz(int l, int r, int i)
{
if (!lz[i]) return;
lz[i]=0;
swap(a[i], b[i]);
if (l!=r) lz[2*i]=!lz[2*i], lz[2*i+1]=!lz[2*i+1];
}
void build(int l, int r, int i)
{
if (l==r)
{
if (k[l]==1) a[i]++;
else b[i]++;
return;
}
int md=(l+r)/2;
build(l, md, 2*i);
build(md+1, r, 2*i+1);
a[i]=a[2*i]+a[2*i+1];
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |