제출 #702750

#제출 시각아이디문제언어결과실행 시간메모리
702750lukameladze친구 (IOI14_friend)C++14
0 / 100
1 ms212 KiB
# include "friend.h" # include <bits/stdc++.h> using namespace std; #define f first #define s second //#define int long long #define pii pair <int, int> #define pb push_back const int N = 3e5 + 5; int t,n,a[N]; int findSample(int n, int confidence[], int host[], int protocol[]){ int ans = 0; for (int i = n - 1; i >= 0; i--) { if (protocol[i] == 0) { ans += confidence[i]; confidence[host[i]] -= max(0, confidence[host[i]] - confidence[i]); } else if (protocol[i] == 1) { confidence[host[i]] += confidence[i]; } else { confidence[host[i]] = max(confidence[host[i]], confidence[i]); } } ans += confidence[0]; return ans; }
#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...