Submission #584804

#TimeUsernameProblemLanguageResultExecution timeMemory
584804jack715Friend (IOI14_friend)C++14
8 / 100
1 ms340 KiB
#include "friend.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second

using namespace std;

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans = 0;
    for (int i = 0; i < n; i++)
        ans += confidence[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...