| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 576254 | itnes | 경주 (Race) (IOI11_race) | C++14 | 0 ms | 0 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;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
const ll INFLL=1e18+7;
const int INF=1e9+7;
#define pb push_back
const int MAXN=2e5+7;
vector<int> G[MAXN];
//~ int best_path(int N,int K,array<int,2> H[],array<int,1> L[]){
//~ return 0;
//~ }
int main()
{
ios_base::sync_with_stdio(0);
int n; cin>>n;
for(int i=1;i<n;++i){
int a,b; cin>>a>>b;
G[a].pb(b);
G[b].pb(a);
}
int x;
for(int i=1;i<n;++i) cin>>x;
cout<<"xd";
}