# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24185 | Bruteforceman | Race (IOI11_race) | C++11 | 603 ms | 70180 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 "bits/stdc++.h"
using namespace std;
vector < pair <int, int> > g[200010];
int ans;
int len;
void dfs(int x, int par, map <long long, int> &f, long long &add, int &extra) {
add = 0;
extra = 0;
f[0] = 0;
for(auto i : g[x]) {
if(i.first == par) continue;
map <long long, int> t;
long long plus;
int rem;
dfs(i.first, x, t, plus, rem);
plus += i.second;
rem += 1;
if(t.size() > f.size()) {
f.swap(t);
swap(add, plus);
swap(extra, rem);
}
for(auto i : t) {
# | 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... |