# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135708 | khsoo01 | Railway (BOI17_railway) | C++11 | 194 ms | 24172 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;
int n, m, x, sum[100005], a[200005];
int ord[100005], pord[100005], co;
int dep[100005], spt[20][100005];
vector<int> adj[100005], ans;
vector<pair<int,int> > road;
bool comp (int A, int B) {
return ord[A] < ord[B];
}
void calc (int cur, int prv) {
ord[cur] = ++co;
dep[cur] = dep[prv] + 1;
spt[0][cur] = prv;
for(auto &nxt : adj[cur]) {
if(nxt == prv) continue;
calc(nxt, cur);
}
pord[cur] = co;
}
void wrap (int cur, int prv) {
for(auto &nxt : adj[cur]) {
if(nxt == prv) continue;
wrap(nxt, cur);
sum[cur] += sum[nxt];
}
}
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... |