Submission #129334

#TimeUsernameProblemLanguageResultExecution timeMemory
129334antimirageFriend (IOI14_friend)C++14
8 / 100
3 ms376 KiB
#include "friend.h" //#include "grader.cpp" #include <bits/stdc++.h> #define fr first #define sc second #define mk make_pair #define pb push_back #define all(s) s.begin(), s.end() using namespace std; int findSample(int n, int val[], int batya[], int type[]) { int ans = 0; if (type[1] == 1) { for (int i = 1; i < n; i++) { ans += val[i]; } } else { for (int i = 1; i < n; i++) { ans = max(ans, val[i]); } } 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...