제출 #775373

#제출 시각아이디문제언어결과실행 시간메모리
775373boris_mihov친구 (IOI14_friend)C++17
8 / 100
1 ms256 KiB
#include "friend.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

int n;
int findSample(int N, int confidence[], int host[], int protocol[])
{
    n = N;
    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...