Submission #392875

#TimeUsernameProblemLanguageResultExecution timeMemory
392875Aldas25Friend (IOI14_friend)C++14
8 / 100
1 ms336 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define REP(n) FOR(O, 1, (n)) #define f first #define s second #define pb push_back typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vii; const int MAXN = 100100; int n; int conf[MAXN], h[MAXN], prot[MAXN]; int sub4 () { int ret = 0; FOR(i, 0, n-1) ret += conf[i]; return ret; } int findSample(int N,int confidence[],int host[],int protocol[]){ n = N; FOR(i, 0, n-1) conf[i] = confidence[i]; FOR(i, 1, n-1) h[i] = host[i], prot[i] = protocol[i]; bool is4 = true; FOR(i, 1, n-1) { if (protocol[i] != 1) is4 = false; } if (is4) { return sub4(); } else {return sub4();} }
#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...