제출 #153912

#제출 시각아이디문제언어결과실행 시간메모리
153912gs18115친구 (IOI14_friend)C++14
100 / 100
37 ms2680 KiB
#include"friend.h" #include<algorithm> using namespace std; int findSample(int n,int confidence[],int host[],int protocol[]) { int ans=0; for(int i=n;--i>0;) { if(protocol[i]==0) ans+=confidence[i],confidence[host[i]]=max(0,confidence[host[i]]-confidence[i]); else if(protocol[i]==1) confidence[host[i]]+=confidence[i]; else confidence[host[i]]=max(confidence[host[i]],confidence[i]); } return ans+confidence[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...