Submission #762498

#TimeUsernameProblemLanguageResultExecution timeMemory
762498goodbyehanbyeolOrganizing the Best Squad (FXCUP4_squad)C++17
19 / 100
3099 ms36544 KiB
#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()); sort(defVec.rbegin(), defVec.rend()); if(atkVec[0].second != defVec[0].second) return atkVec[0].first + defVec[0].first; else return max(atkVec[0].first + defVec[1].first, atkVec[1].first + defVec[0].first); } else{ } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...