Submission #256542

#TimeUsernameProblemLanguageResultExecution timeMemory
256542b00n0rpFriend (IOI14_friend)C++17
100 / 100
34 ms1408 KiB
#include "friend.h" #define m(a,b) a>b?a:b int a;int findSample(int n,int c[],int h[],int p[]){while(--n)(!p[n])?a+=c[n],c[h[n]]=m(0,c[h[n]]-c[n]):(p[n]-2)?c[h[n]]+=c[n]:c[h[n]]=m(c[h[n]],c[n]);return a+c[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...