# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166043 | errorgorn | Race (IOI11_race) | C++14 | 585 ms | 87600 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 "race.h"
#include <cstdio>
#include <set>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef pair<int,int> ii;
vector<ii> al[200005];
int offset[200005];
int offset2[200005];
set<ii> rope[200005];
int ans=1000000;
int k;
void dfs(int i,int p){
rope[i].insert(ii(offset[i],offset2[i]));
int target;
set<ii>::iterator sit;
for (auto it:al[i]){
if (it.first==p) continue;
offset[it.first]=offset[i]+it.second;
offset2[it.first]=offset2[i]+1;
dfs(it.first,i);
if (rope[it.first].size()>rope[i].size()) swap(rope[it.first],rope[i]);
# | 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... |