제출 #1261652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1261652		avighna	축제 (IOI25_festival)	C++20	24 / 100	59 ms	10944 KiB

festival

#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) {
    if (i.t != j.t) {
      return i.t > j.t;
    }
    return i.p < j.p;
  });
  int _n = n;
  for (int i = 0; i < n; ++i) {
    if (a[i].t == 1) {
      _n = i;
      break;
    }
  }
  if (_n == 0) {
    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;
  }
  std::vector<int64_t> psum(n);
  if (n != _n) {
    psum[_n] = a[_n].p;
  }
  for (int i = _n + 1; i < n; ++i) {
    psum[i] = psum[i - 1] + a[i].p;
  }

  const int64_t inf = 1e15;
  int max_ans = 0, corr_j = 0;
  int64_t cur = A;
  for (int j = 0; j <= _n; ++j) {
    int got = j + std::upper_bound(psum.begin(), psum.end(), cur) - psum.begin() - _n;
    if (got > max_ans) {
      max_ans = got;
      corr_j = j;
    }
    if (cur - a[j].p < 0) {
      break;
    }
    cur = std::min(inf, (cur - a[j].p) * a[j].t);
  }

  std::vector<int> ans;
  for (int i = 0; i < corr_j; ++i) {
    ans.push_back(a[i].i);
  }
  for (int size = max_ans - ans.size(), i = 0; i < size; ++i) {
    ans.push_back(a[_n + i].i);
  }
  return ans;
}

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