# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94951 | bogdan10bos | Synchronization (JOI13_synchronization) | C++14 | 864 ms | 24028 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;
//#define FILE_IO
const int NMAX = 1e5;
const int LG = 16;
typedef pair<int, int> pii;
int N, M, Q, I;
int f[LG + 2][NMAX + 5], h[NMAX + 5], itv[NMAX + 5][2], state[NMAX + 5];
int info[NMAX + 5], lst[NMAX + 5];
pii edge[NMAX + 5];
vector<int> edg[NMAX + 5];
void DFS(int nod, int fth)
{
h[nod] = h[fth] + 1;
f[0][nod] = fth;
for(int i = 1; i <= LG; i++)
f[i][nod] = f[i - 1][ f[i - 1][nod] ];
itv[nod][0] = ++I;
for(auto nxt: edg[nod])
if(nxt != fth)
DFS(nxt, nod);
itv[nod][1] = I;
}
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... |