Submission #1064597

#TimeUsernameProblemLanguageResultExecution timeMemory
1064597NemanjaSo2005Friend (IOI14_friend)C++17
8 / 100
1 ms348 KiB
#include "friend.h" #include<bits/stdc++.h> #define ll long long using namespace std; const int maxn=1e5+5; int N,niz[maxn]; int findSample(int n,int confidence[],int host[],int protocol[]){ ll res=0; N=n; for(int i=1;i<=N;i++) niz[i]=confidence[i-1]; for(int i=1;i<=N;i++) res+=niz[i]; return res; }
#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...