# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117381 | ntdaccode | Synchronization (JOI13_synchronization) | C++17 | 508 ms | 34120 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>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define pb push_back
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M=2e5+10;
const int N=1e3+10;
const int mod=1e9+7;
int n, q, m, c[M];
vector<ii> ke[M];
int sz[M], par[M], d[M];
int con[M], cha[M], g[M];
int f[M];
void dfs(int u,int p)
{
sz[u] = 1;
for(ii node : ke[u]) {
int v = node.first, idx = node.second;
if(v == p) continue;
cha[idx] = u;
con[idx] = v;
par[v] = u;
d[v] = d[u] + 1;
dfs(v,u);
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... |