Submission #499708

#TimeUsernameProblemLanguageResultExecution timeMemory
499708sidon친구 (IOI14_friend)C++17
16 / 100
1 ms300 KiB
#include "friend.h" int findSample(int n, int c[], int h[], int p[]) { for(int i = n; --i; ) { if(p[i] == 0) c[h[i]] -= c[i], c[n] += c[i]; if(p[i] == 1) c[h[i]] += c[i]; if(p[i] == 2 && c[i] > c[h[i]]) c[h[i]] = c[i]; } return (c[0] > 0 ? c[0] : 0) + c[n]; }
#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...