# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
948244 | Lib | Race (IOI11_race) | C++14 | 1 ms | 4444 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>
#include "race.h";
using namespace std;
vector <vector <pair <int,int> > > adj;
vector <pair <int,int> > TVector;
int SubtreeSize[300003];
long long ans=999999;
void Solve(){
}
int best_path(int N, int K, int H[][2], int L[]){
for(int i=0;i<=N+1;i++){
adj.push_back(TVector);
}
for(int i=1;i<=N-1;i++){
adj[H[i-1][0]].push_back({H[i-1][1],L[i-1]});
adj[H[i-1][1]].push_back({H[i-1][0],L[i-1]});
}
Solve;
if(ans==999999){
return -1;
}else{
return ans;
}
}
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... |