| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 150609 | TLEWA맞 (#200) | Organizing the Best Squad (FXCUP4_squad) | C++17 | 5 ms | 384 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"
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define inf 1e18
typedef long long LL;
int n;
vector<int> a, d, p;
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
n=A.size();
a=A;
d=D;
p=P;
}
long long BestSquad(int X, int Y){
LL maxx11=0, maxx21=0, maxx12=0, maxx22=0;
int maxnum1, maxnum2;
for(int i=0; i<n; i++){
if(maxx12<(LL)X*a[i]+(LL)Y*p[i]){
if(maxx11<(LL)X*a[i]+(LL)Y*p[i]){
maxx12=maxx11;
maxx11=(LL)X*a[i]+(LL)Y*p[i];
maxnum1=i;
}
else maxx12=(LL)X*a[i]+(LL)Y*p[i];
}
}
for(int i=0; i<n; i++){
if(maxx22<(LL)X*a[i]+(LL)Y*p[i]){
if(maxx12<(LL)X*a[i]+(LL)Y*p[i]){
maxx22=maxx21;
maxx21=(LL)X*a[i]+(LL)Y*p[i];
maxnum2=i;
}
else maxx22=(LL)X*a[i]+(LL)Y*p[i];
}
}
if(maxnum1!=maxnum2)return maxx11+maxx21;
return max(maxx11+maxx22, maxx12+maxx22);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
