제출 #1253519

#제출 시각아이디문제언어결과실행 시간메모리
1253519anfi축제 (IOI25_festival)C++20
0 / 100
53 ms6328 KiB
#include "festival.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define fi first #define se second vector<int> max_coupons(int A, vector<int> P, vector<int> T) { int n = P.size(); vector<int> ans(n, 0); vector<pair<int, int>> by_time[5]; for (int i = 0; i < n; ++i) { by_time[T[i]].emplace_back(P[i], i); } for (int t = 0; t < 5; ++t) { sort(by_time[t].begin(), by_time[t].end()); for (auto [price, idx] : by_time[t]) { if (A >= price) { A -= price; ans[idx] = 1; } } } 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...