Submission #1261749

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261749		avighna	Festival (IOI25_festival)	C++20	15 / 100	273 ms	329196 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) {
    return (j.p + i.p * i.t) * j.t < (i.p + j.p * j.t) * i.t;
  });

  const int64_t inf = 1e15;
  const int lg = 200;
  std::vector dp(n, std::vector<int64_t>(std::min(n + 1, lg), -inf));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j <= std::min(n, lg - 1); ++j) {
      if (j == 0) {
        dp[i][j] = A;
        continue;
      }
      if (j > i + 1) {
        dp[i][j] = -inf;
        continue;
      }
      if (i == 0) {
        dp[i][j] = A - a[i].p >= 0 ? (A - a[i].p) * a[i].t : -inf;
        continue;
      }
      dp[i][j] = dp[i - 1][j];
      if (dp[i - 1][j - 1] - a[i].p >= 0) {
        dp[i][j] = std::max(dp[i][j], (dp[i - 1][j - 1] - a[i].p) * a[i].t);
      }
    }
    for (int j = 0; j <= std::min(n, lg - 1); ++j) {
      dp[i][j] = std::min(dp[i][j], inf);
    }
  }

  int max_ans = 0, corr_j = 0;
  for (int j = 0; j <= std::min(n, lg - 1); ++j) {
    if (dp[n - 1][j] < 0) {
      continue;
    }
    int got = j;
    if (got > max_ans) {
      max_ans = got;
      corr_j = j;
    }
  }

  std::vector<int> ans;
  int i = n - 1, j = corr_j;
  bool is_dp_inf = dp[i][j] == inf;
  while (i >= 0 and j > 0) {
    if (i == 0) {
      if (j != 0) {
        ans.push_back(a[i].i);
        j--;
      }
      i--;
      continue;
    }
    if (i != 0 and dp[i - 1][j - 1] - a[i].p >= 0 and (dp[i - 1][j - 1] - a[i].p) * a[i].t > dp[i - 1][j]) {
      j--;
      ans.push_back(a[i].i);
    }
    i--;
  }
  std::reverse(ans.begin(), ans.end());
  while (is_dp_inf and !ans.empty() and ans.back() != n - 1) {
    ans.push_back(ans.back() + 1);
  }
  return ans;
}

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