Submission #1024502

#TimeUsernameProblemLanguageResultExecution timeMemory
1024502vjudge1Friend (IOI14_friend)C++17
69 / 100
15 ms1628 KiB
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
long long p[1010],q[1010];
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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...