| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|
| 150316 | | distutpia (#200) | 최적의 팀 구성 (FXCUP4_squad) | C++17 | | 3100 ms | 10872 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "squad.h"
int siz;
std::vector<int> A1;
std::vector<int> D1;
std::vector<int> P1;
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
int N = A.size();
siz=N;
A1=A;
D1=D;
P1=P;
}
long long BestSquad(int X, int Y){
long long int ans=0;
for(int i=0; i<siz; i++){
for(int j=0; j<siz; j++){
if(i==j){
continue;
}
if(ans<(long long)(A1[i]+D1[j])*(long long)X+(long long)(P1[i]+P1[j])*(long long)Y){
ans=(long long)(A1[i]+D1[j])*(long long)X+(long long)(P1[i]+P1[j])*(long long)Y;
}
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |