Submission #1254730

#	Time	Username	Problem	Language	Result	Execution time	Memory
1254730		MilosMilutinovic	축제 (IOI25_festival)	C++20	5 / 100	736 ms	3576 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> max_coupons(int A, vector<int> p, vector<int> t) {
  int n = int(p.size());
  vector<bool> was(n);
  vector<int> res;
  int64_t a = A;
  for (int i = 0; i < n; i++) {
    a = min(a, int64_t(1e17));
    bool has = false;
    for (int j = 0; j < n; j++) {
      if (was[j] || a < p[j]) {
        continue;
      }
      int64_t new_a = (a - p[j]) * 1LL * t[j];
      if (new_a >= a) {
        has = true;
      }
    }
    if (has) {
      int64_t best = int64_t(1e18);
      int id = -1;
      for (int j = 0; j < n; j++) {
        if (was[j] || a < p[j]) {
          continue;
        }
        int64_t new_a = (a - p[j]) * 1LL * t[j];
        if (new_a >= a && new_a <= best) {
          best = new_a;
          id = j;
        }
      }
      a = best;
      was[id] = true;
      res.push_back(id);
    } else {
      int64_t best = -1;
      int id = -1;
      for (int j = 0; j < n; j++) {
        if (was[j] || a < p[j]) {
          continue;
        }
        int64_t new_a = (a - p[j]) * 1LL * t[j];
        if (new_a >= best) {
          best = new_a;
          id = j;
        }
      }
      if (id != -1) {
        a = best;
        was[id] = true;
        res.push_back(id);
      } else {
        break;
      }
    }
  }
  return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 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