제출 #759922

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
759922	2023-06-17 04:56:56	jk410	최적의 팀 구성 (FXCUP4_squad)	C++17	19 / 100	3061 ms	29056 KiB

squad

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
//subtask 1
#include <bits/stdc++.h>
#include "squad.h"
using namespace std;
typedef long long ll;
int n;
vector<ll> a, d, p;
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
  n = (int)A.size();
  for (int i = 0; i < n; i++) {
    a.push_back(A[i]);
    d.push_back(D[i]);
    p.push_back(P[i]);
  }
}
ll BestSquad(int X, int Y){
  vector<ll> am(n), dm(n);
  vector<ll> pdm(n), sdm(n);
  for (int i = 0; i < n; i++) {
    am[i] = X * a[i] + Y * p[i];
    dm[i] = X * d[i] + Y * p[i];
  }
  pdm[0] = dm[0];
  for (int i = 1; i < n; i++)
    pdm[i] = max(pdm[i - 1], dm[i]);
  sdm[n - 1] = dm[n - 1];
  for (int i = n - 2; i >= 0; i--)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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