# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105239 | alexander707070 | Highway Tolls (IOI18_highway) | C++14 | 223 ms | 24760 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 MAXN 200007
#include "highway.h"
using namespace std;
int n,m,dep[MAXN],from,to,st,et,parent[MAXN];
bool ok,li[MAXN];
vector< pair<int,int> > v[MAXN],g[MAXN];
vector<int> euler,euler2;
vector<int> w;
void dfs(int x,int p){
dep[x]=dep[p]+1;
parent[x]=p;
for(int i=0;i<v[x].size();i++){
if(v[x][i].first==p)continue;
euler.push_back(v[x][i].second);
dfs(v[x][i].first,x);
}
}
void dfss(int x,int p){
for(int i=0;i<v[x].size();i++){
if(v[x][i].first==p)continue;
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... |