제출 #254621

#제출 시각아이디문제언어결과실행 시간메모리
254621b00n0rp친구 (IOI14_friend)C++17
100 / 100
37 ms1528 KiB
#include "friend.h" #define m(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--)(!p[i])?a+=c[i],c[h[i]]=m(0,c[h[i]]-c[i]):(p[i]-2)?c[h[i]]+=c[i]:c[h[i]]=m(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...