# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77243 | farukkastamonuda | Untitled (POI11_dyn) | C++14 | 1786 ms | 27096 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>
#define li 300005
#define mid (bas+son)/2
using namespace std;
int n,m,ans,A[li],x,y,say;
vector<int> vv[li];
int solve(int node,int ata,int sayi){
int t=0,v=0;
for(int i=0;i<(int)vv[node].size();i++){
int go=vv[node][i];
if(ata==go) continue;
int u=solve(go,node,sayi);
if(u==0) continue;
if(u>0) v=max(v,u);
else t=min(t,u);
}
if(abs(t)>=sayi){
ans++;
return sayi;
}
if(t==0 && v==0) return A[node];
if(v>abs(t)) return v-1;
return t-1;
}
int can(int k){
ans=0;
if(solve(1,0,k)<0) ans++;
if(ans<=k) return 1;
return 0;
}
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |