# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18622 | ggoh | Race (IOI11_race) | C++98 | 603 ms | 29820 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<cstdio>
#include<algorithm>
#include<cstring>
#include<deque>
#include<vector>
int a,i,j,x,y,sz2,st2[200005],sz,len[1000005],st[200005],z,maxtree[200005],tot[200005],v[200005],t;
int ans,b;
struct A{
int to,cost;
};
struct B{
int ho,di;
}data[200005];
std::vector<A>G[200005];
void dfs(int p)
{
tot[p]=1;
v[p]=1;
maxtree[p]=0;
for(int k=0;k<G[p].size();k++)
{
if(v[G[p][k].to]==0)
{
dfs(G[p][k].to);
tot[p]+=tot[G[p][k].to];
maxtree[p]=std::max(maxtree[p],tot[G[p][k].to]);
}
}
st[t++]=p;
}
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... |