제출 #1259315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1259315		nicolo_010	Festival (IOI25_festival)	C++20	0 / 100	188 ms	16308 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using v = vector<T>;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i = k; i < n; i++)

std::vector<int> max_coupons(int AA, std::vector<int> P, std::vector<int> T) {
  ll A = AA;
  v<v<int>> order;
  v<v<int>> ones;
  int N = P.size();
  rep(i, 0, N) {
    order.push_back({P[i], T[i], i});
  }
  sort(order.begin(), order.end(), [&](v<int> a, v<int> b) {
    ll v1 = -a[0]*a[1]*b[1] - b[0]*b[1];
    ll v2 = -b[0]*b[1]*a[1] - a[0]*a[1];
    return v1 > v2;
  });
  /*
  v<v<ll>> dp(N+1, v<ll>(N+1, -1));
  dp[0][0] = A;
  rep(i, 1, N+1) {
    rep(j, 1, N+1) {
      dp[i][j] = max(dp[i][j], (dp[i-1][j-1]-order[i-1][0])*order[i-1][1]);
    }
  }
  */
  v<int> ans;
  rep(i, 0, N) {
    ans.push_back(order[i][2]);
  } 
  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