# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529014 | blue | Synchronization (JOI13_synchronization) | C++17 | 247 ms | 26240 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 <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
const int mx = 100'000;
const int lg = 18;
using pii = pair<int, int>;
using vi = vector<int>;
using vpii = vector<pii>;
int N, M, Q;
vpii edge[1 + mx];
vi edge_node(1 + mx);
vi node_edge(1 + mx);
vi par(1 + mx, 0);
vi subtree(1 + mx, 1);
vi ord_ind(1 + mx, 0);
int ord_ct = 0;
int anc[1 + mx][1 + lg];
void dfs(int u)
# | 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... |