| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 140303 | ggoh | Friend (IOI14_friend) | C++14 | 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<bits/stdc++.h>
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
int ans=0;
int i;
for(i=n-1;i>0;i--)
{
if(protocol[i]==0)
{
confidence[host[i]]-=confidence[i];
ans+=confidence[i];
}
else if(protocol[i]==1)
{
confidence[host[i]]=confidence[host[i]]+confidence[i];
}
else(protocol[i]==2)
{
confidence[host[i]]=std::max(confidence[host[i]],confidence[i]);
}
}
return ans+(confidence[0]>0?confidence[0]:0);
}