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