# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653026 | beaconmc | Race (IOI11_race) | C++14 | 1049 ms | 64912 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 ll long long
#define FOR(i,x,y) for(ll i=x; i<y; i++)
using namespace std;
bool r[300000];
vector<vector<ll>> edges[300000];
ll sub[300000];
ll n,m,root,k;
vector<vector<ll>> twosum;
ll ans = 1000000000;
ll dfs(ll a, ll p){
sub[a] = 1;
for (auto& i : edges[a]){
if (i[0]!=p && !r[i[0]]) sub[a] += dfs(i[0], a);
}
return sub[a];
}
void dfs2(ll a, ll p, ll v, ll num, ll col){
for (auto& i : edges[a]){
if (i[0]!=p && !r[i[0]]) dfs2(i[0], a, v+i[1], num+1, col);
}
twosum.push_back({v, num, col});
# | 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... |