# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775309 | 2023-07-06T09:34:08 Z | danikoynov | Friend (IOI14_friend) | C++14 | 0 ms | 0 KB |
#include "friend.h" #include<bits/stdc++.h> using namespace std; // Find out best sample vector < int > adj[maxn]; int findSample(int n,int confidence[],int host[],int protocol[]) { bool only_my = true, only_we = true; for (int i = 1; i < n; i ++) { if (protocol[i] != 1) only_my = false; if (protocol[i] != 2) only_we = false; } if (only_my) { int ans = 0; for (int i = 0; i < n; i ++) ans += confidence[i]; return ans; } else if (only_we) { int ans = 0; for (int i = 0; i < n; i ++) ans = max(ans, confidence[i]); return ans; } }