Submission #1024492

#TimeUsernameProblemLanguageResultExecution timeMemory
1024492vjudge1Friend (IOI14_friend)C++17
35 / 100
17 ms3680 KiB
#include "friend.h" #include<bits/stdc++.h> using namespace std; int p[1001000],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) q[H]+=q[i], p[H]=max({p[H]+p[i],p[H]+q[i],q[H]+p[i]}); else q[H]+=q[i], p[H]=max(p[H]+q[i],p[i]+q[H]); } 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...