| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 254619 | b00n0rp | Friend (IOI14_friend) | C++17 | 36 ms | 1408 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 "friend.h"
#define m(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]]=m(0,c[h[i]]-c[i]);
else (p[i]-2)?c[h[i]]+=c[i]:c[h[i]]=m(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... | ||||
