제출 #319337

#제출 시각아이디문제언어결과실행 시간메모리
319337Fischer친구 (IOI14_friend)C++14
100 / 100
32 ms2660 KiB
#include <bits/stdc++.h> #include "friend.h" using namespace std; int findSample(int n, int confidence[], int host[], int protocol[]) { int extra = 0; for (int i = n-1; i > 0; --i) { if (protocol[i] == 1) { confidence[host[i]] += confidence[i]; } else if (protocol[i] == 2) { confidence[host[i]] = max(confidence[host[i]], confidence[i]); } else { extra += confidence[i]; confidence[host[i]] = max(0, confidence[host[i]] - confidence[i]); } } return confidence[0] + extra; }
#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...