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>
using namespace std;
int findSample(int n,int confidence[],int host[],int protocol[])
{
int ans=0;
for(int i=n;--i>0;)
{
if(protocol[i]==0)
ans+=confidence[i],confidence[host[i]]=max(0,confidence[host[i]]-confidence[i]);
else if(protocol[i]==1)
confidence[host[i]]+=confidence[i];
else
confidence[host[i]]=max(confidence[host[i]],confidence[i]);
}
return ans+confidence[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... |