제출 #1316806

#제출 시각아이디문제언어결과실행 시간메모리
1316806madamadam3축제 (IOI25_festival)C++20
5 / 100
58 ms10016 KiB
#include "festival.h"
#include <bits/stdc++.h>  

using namespace std;
#define all(x) (x).begin(), (x).end()

typedef long long ll;
using pi = pair<ll, ll>;
using vi = vector<ll>;

struct coupon {
  ll t, p, idx;
  const bool operator<(const coupon &other) const {
    return t == other.t ? p < other.p : t < other.t;
  }
};

vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
  ll a = A, n = P.size();
  vector<coupon> coupons; for (int i = 0; i < n; i++) coupons.push_back(coupon{T[i], P[i], i});
  sort(all(coupons));

  vector<int> ans;
  for (int i = 0; i < n; i++) {
    ll t = coupons[i].t, p = coupons[i].p;
    if (a - p < 0) break;
 
    a = (a-p) * t;
    ans.push_back(coupons[i].idx);
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...