Submission #296635

#	Time	Username	Problem	Language	Result	Execution time	Memory
296635		emil_physmath	Friend (IOI14_friend)	C++17	16 / 100	1 ms	384 KiB

friend

#include <algorithm>
#include <numeric>
#include "friend.h"
using namespace std;
using llong = long long;

enum Protocol { ME = 0, MY = 1, WE = 2 };
// Find out best sample
int findSample(int n, int a[], int host[], int prot[]){
    if (count(prot + 1, prot + n, ME) == n - 1) {
    }
    if (count(prot + 1, prot + n, MY) == n - 1)
        return accumulate(a, a + n, 0);
    if (count(prot + 1, prot + n, WE) == n - 1)
        return *max_element(a, a + n);
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:16:1: warning: control reaches end of non-void function [-Wreturn-type]
   16 | }
      | ^

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