| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 499745 | sidon | Friend (IOI14_friend) | C++17 | 0 ms | 0 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.
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]),c[h[i]]<0?c[h[i]]=0:0;return c[0]+p[0];}
