# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313638 | tengiz05 | 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.
#include "friend.h"
#include <algorithm>
int ans,i;
int findSample(int n,int c[],int h[],int p[]){
for(i=n;--i;){
if(p[i]==0)ans+=c[i],c[h[i]]=max(0,c[h[i]]-c[i]);
if(p[i]==1)c[h[i]]+=c[i];
if(p[i]==2)c[h[i]]=max(c[h[i]],c[i]);
}return ans+c[0];
}