Submission #254617

#TimeUsernameProblemLanguageResultExecution timeMemory
254617b00n0rp친구 (IOI14_friend)C++17
100 / 100
37 ms1500 KiB
#include "friend.h" #define max(a,b) a>b?a:b int a,i; int findSample(int n,int c[],int h[],int p[]){ for(i=n-1;i>0;i--){ if(!p[i]) a+=c[i],c[h[i]]=max(0,c[h[i]]-c[i]); else if(p[i]-2)c[h[i]]+=c[i]; else c[h[i]]=max(c[h[i]],c[i]); } 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...