Submission #129334

#	Time	Username	Problem	Language	Result	Execution time	Memory
129334		antimirage	Friend (IOI14_friend)	C++14	8 / 100	3 ms	376 KiB

friend

#include "friend.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()

using namespace std;

int findSample(int n, int val[], int batya[], int type[]) {

	int ans = 0;
	if (type[1] == 1) {
		for (int i = 1; i < n; i++) {
			ans += val[i];
		}
	}
	else {
		for (int i = 1; i < n; i++) {
			ans = max(ans, val[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