# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156451 | Saboon | Synchronization (JOI13_synchronization) | C++14 | 3 ms | 632 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;
const int mod = 1e9 + 7;
const int maxn = 5;
int n;
int parent[maxn], h[maxn], sz[maxn], pos[maxn], st[maxn], ft[maxn], up[maxn];
vector<int> t[maxn];
bitset<maxn> bs[maxn];
int Time = 0;
int seg[4 * maxn];
pair<int,int> edge[2 * maxn];
bool black[maxn];
int get(int id, int L, int R, int l, int r){
if (r <= L or R <= l or seg[id] == 1)
return -1;
if (L + 1 == R)
return L;
int mid = (L + R) >> 1;
return max(get(2 * id + 0, L, mid, l, r), get(2 * id + 1, mid, R, l, r));
}
void add(int id, int L, int R, int idx, bool val){
if (idx < L or R <= idx)
return;
# | 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... |