# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627590 | paulica | Tax Evasion (LMIO19_mokesciai) | C++14 | 2074 ms | 30796 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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> v[200005],v1,v2[200005];
int d1,b1,cnt1,fr[200005],cnt[200005],dep[200005];
void dfs(int x,int d) {
dep[x]=d;
for(int i=0;i<v[x].size();i++) {
dfs(v[x][i],d+1);
}
}
void dfs1(int x) {
if(dep[x]>=d1) fr[x]=1;
cnt1+=fr[x];
for(int i=0;i<v[x].size();i++) {
dfs1(v[x][i]);
}
}
void dfs2(int x) {
if(b1) return;
int mx=-1,idx;
for(int i=0;i<v[x].size();i++) {
dfs2(v[x][i]);
if(b1) return;
fr[x]+=fr[v[x][i]];
if((int)v2[v[x][i]].size()>mx) {
mx=v2[v[x][i]].size();
idx=i;
}
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... |