# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94653 | andy627 | Race (IOI11_race) | C++17 | 1273 ms | 38760 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 <stdio.h>
#include <vector>
#include <set>
#include <algorithm>
#define pii pair<int,int>
#define ff first
#define ss second
#define INF 1e9
using namespace std;
int n,k;
vector<pii> edge[222222];
int siz[222222];
set<int> st;
vector<pii> vc;
int cnt[1111111];
bool is_cent[222222];
int ans=INF;
int dfs_siz(int v,int p){
siz[v]=1;
for(pii u:edge[v]){
if(u.ff==p || is_cent[u.ff]) continue;
siz[v]+=dfs_siz(u.ff,v);
}
return siz[v];
}
# | 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... |