# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168209 | Leonardo_Paes | Railway (BOI17_railway) | C++11 | 504 ms | 30196 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 = 1e5+10;
int n, m, k;
int pai[maxn], nivel[maxn], siz[maxn], in[maxn], t;
int chain[maxn], head[maxn], pos[maxn], c, qtd;
int tree[4*maxn], lazy[4*maxn];
map<pair<int,int>,int> edges;
vector<int> grafo[maxn];
void dfs(int u, int p){
siz[u] = 1, in[u] = ++t;
for(int i=0; i<grafo[u].size(); i++){
int v = grafo[u][i];
if(v==p) continue;
pai[v] = u, nivel[v] = nivel[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |