# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
649676 | milisav | Race (IOI11_race) | C++14 | 388 ms | 87536 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"
#define maxn 200005
//#define MAX_N 500000
using namespace std;
int n,k;
vector<pair<int,int> > a[maxn]; //u a[u] su grane susedne sa u
set<pair<int,int> > s[maxn];
int o1[maxn];
int o2[maxn];
int pok[maxn];
int sol;
void dfs(int u,int pr) {
pok[u] = u;
s[u].insert({0,0});
o1[u] = 0;
o2[u] = 0;
int ch = 0;
for(auto edge:a[u]) {
int v=edge.first;
int w=edge.second;
if(v!=pr) {
ch++;
dfs(v,u);
if(s[pok[u]].size()<=s[pok[v]].size()) pok[u]=pok[v];
}
}
if(ch==0) {
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... |