Submission #151648

#	Time	Username	Problem	Language	Result	Execution time	Memory
151648		baikdohyup	Organizing the Best Squad (FXCUP4_squad)	C++17	0 / 100	161 ms	11000 KiB

squad

#include "squad.h"
#include <algorithm>
#include <iostream>

std::vector<int> arr1, arr2, arr3;
int N;

void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
	N = A.size();

	arr1 = A;
	arr2 = D;
	arr3 = P;
}

long long BestSquad(int X, int Y){
	long long firstA = 0, secondA = 0, firstD = 0, secondD = 0;
	int firstAidx = 0, firstDidx = 0;

	for (int i = 0; i < N; i++) {
		if ((long long)arr1[i] * (long long)X + (long long)arr3[i] * (long long)Y >= firstA) {
			secondA = firstA;
			firstA = (long long)arr1[i] * (long long)X + (long long)arr3[i] * (long long)Y;
			firstAidx = i;
		}
		if ((long long)arr2[i] * (long long)X + (long long)arr3[i] * (long long)Y >= firstD) {
			secondD = firstD;
			firstD = (long long)arr2[i] * (long long)X + (long long)arr3[i] * (long long)Y;
			firstDidx = i;
		}
	}

	if (firstAidx == firstDidx) {
		return firstA + secondD > firstD + secondA ? firstA + secondD : firstD + secondA;
	}
	else {
		return firstA + firstD;
	}
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 28
• Subtask 3: 0 / 53