Submission #114380

#TimeUsernameProblemLanguageResultExecution timeMemory
114380E869120Friend (IOI14_friend)C++14
8 / 100
3 ms512 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int bit = 0; for (int i = 1; i <= n - 1; i++) bit |= (1 << protocol[i]); if (bit == 1) { // Subtask 4. } if (bit == 2) { // Subtask 2. int sum = 0; for (int i = 0; i < n; i++) sum += confidence[i]; return sum; } if (bit == 4) { // Subtask 3. } if (n <= 10) { // Subtask 5. } return -1; }
#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...