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