Submission #1323527

#TimeUsernameProblemLanguageResultExecution timeMemory
1323527tsetsenbilegFriend (IOI14_friend)C++20
8 / 100
1 ms332 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; #define pb push_back using pr = pair<int, int>; const int INF = 1e9+7, MOD = 1e9+7; // Find out best sample int findSample(int n,int a[],int host[],int type[]){ int res = 0; if (type[0] == 2) for (int i = 0; i < n; i++) res = max(res, a[i]); if (type[0] = 1) for (int i = 0; i < n; i++) res = (res + a[i]); return res; }
#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...