제출 #150019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
150019		Little Piplup (#200)	최적의 팀 구성 (FXCUP4_squad)	C++17	19 / 100	303 ms	24008 KiB

squad

#include "squad.h"
#include <algorithm>
typedef std::pair<long long,long long> pii;
std::vector<int> a,d,p;
std::vector<pii> al,dl,pl;
int n;
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
	int N = A.size();
	n=N;
	a=A;
	d=D;
	p=P;
}

long long BestSquad(int X, int Y){
	for(int i=0; i<n; i++)
	{
		pl.push_back(pii((long long)p[i]*(long long)Y,i));
		al.push_back(pii((long long)a[i]*(long long)X+pl[i].first,i));
		dl.push_back(pii((long long)d[i]*(long long)X+pl[i].first,i));
	}
	std::sort(al.begin(),al.end());
	std::sort(dl.begin(),dl.end());
	std::sort(pl.begin(),pl.end());
	long long maxi = 0;
	int m = 2;
	for(int i=1; i<=m; i++)
	{
		for(int j=1; j<=m; j++)
		{
			if(al[n-i].second!=dl[n-j].second)
			{
				maxi = (maxi>al[n-i].first+dl[n-j].first)?maxi:al[n-i].first+dl[n-j].first;
			}
		}
	}
	return maxi;
}

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