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 "friend.h"
#define max(a,b) a>b?a:b
int a,i;
int findSample(int n,int c[],int h[],int p[]){
for(i=n-1;i>0;i--){
if(!p[i]) a+=c[i],c[h[i]]=max(0,c[h[i]]-c[i]);
else if(p[i]-2)c[h[i]]+=c[i];
else c[h[i]]=max(c[h[i]],c[i]);
}
return a+c[0];
}
# | 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... |