Submission #1252832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252832		an22inkle	축제 (IOI25_festival)	C++20	0 / 100	1094 ms	3600 KiB

festival

#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 = P.size();
  int mode = 0; // scan for increments
  vector<int> ans;
  vector<bool> ok(n);

  while (mode == 0) {
    mode = 1;
    int tgt = -1;
    for (int i = 0; i < n; i++) {
      if (ok[i] == 0) { //  && A >= (T[i]*P[i])/(T[i] - 1)))
        mode = 0;
        if (tgt == -1) {
          tgt = i;
        } else if (T[i]*(A - P[i]) > T[tgt]*(A - P[tgt])) {
          tgt = i;
        }
      }
    }
    A = T[tgt]*(A - P[tgt]);
    ok[tgt] = 1;
    ans.push_back(tgt);
  }

  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18