# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402756 | two_sides | Synchronization (JOI13_synchronization) | C++17 | 308 ms | 26256 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 = 100005;
const int LOG = 17;
int tin[MAXN], tout[MAXN];
int BIT[MAXN]; bool stat[MAXN];
pair <int, int> edge[MAXN];
vector <pair <int, int>> adj[MAXN];
int anc[MAXN][LOG];
int last[MAXN], val[MAXN];
void add(int i, int v) {
for (i++; i < MAXN; i += i & -i)
BIT[i] += v;
}
int sum(int i) {
int sum = 0;
for (i++; i > 0; i -= i & -i)
sum += BIT[i];
return sum;
}
int root(int u) {
for (int i = LOG; --i >= 0; ) {
if (anc[u][i] && sum(tin[u])
== sum(tin[anc[u][i]]))
# | 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... |