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