Submission #1312493

#TimeUsernameProblemLanguageResultExecution timeMemory
1312493DedibeatFestival (IOI25_festival)C++20
5 / 100
58 ms9580 KiB
#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
  int n = T.size();
  vector<int> o(n);
  for(int i = 0; i < n; i++)
  {
    o[i] = i;
  }
  sort(o.begin(), o.end(), [&](int i, int j)
  {
    if(T[i] == T[j]) return P[i] < P[j];
    return T[i] > T[j];
  });

  vector<int> ans;
  for(int i : o)
  {
    if(P[i] > A) break;
    //cout << P[i] << " " << T[i] << endl;
    A = (A - P[i]) * T[i];
    ans.push_back(i);
    //cout << A << endl;
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...