| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 762498 | goodbyehanbyeol | Organizing the Best Squad (FXCUP4_squad) | C++17 | 3099 ms | 36544 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, dcond;
ll atk[300002], def[300002], pop[300002];
void Init(vector<int> A, vector<int> D, vector<int> P){
n = (int)A.size(), dcond = 1;
for(int i=1; i<=n; i++){
atk[i] = A[i-1];
def[i] = D[i-1];
pop[i] = P[i-1];
if(def[i] != 1) dcond = 0;
}
if(dcond){
}
}
ll BestSquad(int X, int Y){
if(true){
vector<pair<ll, int> > atkVec, defVec;
for(int i=1; i<=n; i++) atkVec.push_back(make_pair(atk[i]*X+pop[i]*Y, i));
for(int i=1; i<=n; i++) defVec.push_back(make_pair(def[i]*X+pop[i]*Y, i));
sort(atkVec.rbegin(), atkVec.rend());
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||