Submission #1261452

#TimeUsernameProblemLanguageResultExecution timeMemory
1261452avighnaFestival (IOI25_festival)C++20
27 / 100
60 ms9408 KiB
#include <bits/stdc++.h>

struct item {
  int64_t i, p, t;
};

std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
  const int n = P.size();
  std::vector<item> a(n);
  for (int i = 0; i < n; ++i) {
    a[i] = {i, P[i], T[i]};
  }
  std::sort(a.begin(), a.end(), [&](item i, item j) {
    return (j.p + i.p * i.t) * j.t < (i.p + j.p * j.t) * i.t;
  });
  std::vector<int> ans;
  int64_t cur = A;
  for (auto &i : a) {
    if (cur - i.p < 0) {
      break;
    }
    cur = (cur - i.p) * i.t;
    ans.push_back(i.i);
  }
  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...