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"
int findSample(int i, int c[], int h[], int p[]) {
while(--i){
p[i]?p[i]-1?c[i]>c[h[i]]?c[h[i]]=c[i]:0:c[h[i]]+=c[i]:(c[h[i]]-=c[i],p[0]+=c[i]);
if(c[h[i]] < 0) c[h[i]] = 0;
}
return c[0] + p[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... |