Submission #320893

#TimeUsernameProblemLanguageResultExecution timeMemory
320893daniel920712Friend (IOI14_friend)C++14
16 / 100
1 ms512 KiB
#include "friend.h" #include <iostream> // Find out best sample using namespace std; int what[100005]; int findSample(int n,int confidence[],int host[],int protocol[]) { int ans=0,i,x=0,y=0; what[0]=0; x+=confidence[0]; if(protocol[1]==1) ans+=confidence[0]; if(protocol[1]==3) ans+=confidence[0]; for(i=1;i<n;i++) { if(protocol[i]==1) ans+=confidence[i]; else if(protocol[i]==0) { //printf("%d %d\n",i,host[i]); //if(i<=host[i]) printf("aa\n"); what[i]=1-what[host[i]]; if(what[i]==0) x+=confidence[i]; else y+=confidence[i]; //ans=max(ans,max(x,y)); } else { ans=max(ans,confidence[i]); } } //printf("%d %d\n",x,y); return max(max(x,y),ans); }
#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...