제출 #259156

#제출 시각아이디문제언어결과실행 시간메모리
259156b00n0rp친구 (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...