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;
long long p[100100],q[100100];
int findSample(int n,int confidence[],int host[],int protocol[]){
for(int i=0;i<n;i++)p[i]=confidence[i];
for(int i=n;--i;){
int H=host[i];
if(!protocol[i])p[H]+=q[i],
q[H]+=max(q[i],p[i]);
else if(protocol[i]==1)
p[H]=max({p[H]+p[i],p[H]+q[i],q[H]+p[i]}),
q[H]+=q[i];
else p[H]=max(p[H]+q[i],p[i]+q[H]),q[H]+=q[i];
p[i]=q[i]=0;
}
return max(p[0],q[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... |