# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337315 | Giselus | Railway (BOI17_railway) | C++14 | 177 ms | 24556 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<cstdio>
#include<algorithm>
#include<vector>
#define S 100007
using namespace std;
vector < vector < int > > L;
pair < int, int > E[S];
int num[S];
int R[S][20];
pair < int, int > t[S];
int dp[S];
bool ta[S];
int poz[S];
int pom = 0;
void DFS(int x, int p){
poz[x] = poz[p]+1;
pom++;
num[x] = pom;
for(int i = 1; i <= 19; i++){
R[x][i] = R[R[x][i-1]][i-1];
}
for(int i = 0; i < L[x].size(); i++){
if(L[x][i] != p){
R[L[x][i]][0] = x;
DFS(L[x][i],x);
}
}
}
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... |