Submission #775371

#	Time	Username	Problem	Language	Result	Execution time	Memory
775371		boris_mihov	Friend (IOI14_friend)	C++17	8 / 100	1 ms	212 KiB

friend

#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 = std::max(ans, confidence[i]);
    }

	return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31