# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77031 | 2018-09-20T07:40:21 Z | farukkastamonuda | Bosses (BOI16_bosses) | C++14 | 2 ms | 1020 KB |
#include <bits/stdc++.h> #define li 10005 #define lo long long using namespace std ; lo int n,x,y,vis[li],sub[li]; vector<lo int> v[li]; void dfs(lo int node,lo int ata){ vis[node]=1; sub[node]=1; for(int i=0;i<(int)v[node].size();i++){ lo int go=v[node][i]; if(vis[go]==0 && go!=ata){ dfs(go,node); sub[node]+=sub[go]; } } sub[node]+=1; } int main(){ scanf("%lld",&n); for(int i=1;i<=n;i++){ scanf("%lld",&x); for(int j=1;j<=x;j++){ scanf("%lld",&y); v[y].push_back(i); } } lo int cev=0; for(int i=1;i<=n;i++){ dfs(i,i); cev=max(cev,sub[i]); memset(vis,0,sizeof(vis)); memset(sub,0,sizeof(sub)); } printf("%lld\n",cev); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 760 KB | Output is correct |
2 | Correct | 2 ms | 860 KB | Output is correct |
3 | Incorrect | 2 ms | 1020 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 760 KB | Output is correct |
2 | Correct | 2 ms | 860 KB | Output is correct |
3 | Incorrect | 2 ms | 1020 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 760 KB | Output is correct |
2 | Correct | 2 ms | 860 KB | Output is correct |
3 | Incorrect | 2 ms | 1020 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |