Submission #431713

#TimeUsernameProblemLanguageResultExecution timeMemory
431713cfalasFriend (IOI14_friend)C++14
8 / 100
1 ms332 KiB
#include<bits/stdc++.h> using namespace std; #define F first #define S second typedef pair<int, int> ii; #define FORi(i,a,b) for(int i=(int)a;i<(int)b;i++) #define FOR(i,n) FORi(i,0,n) #include "friend.h" // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int ans=0; if(protocol[0]==1) FOR(i,n) ans+=confidence[i]; else FOR(i,n) ans=max(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...