제출 #1254725

#제출 시각아이디문제언어결과실행 시간메모리
1254725MilosMilutinovic축제 (IOI25_festival)C++20
0 / 100
24 ms3400 KiB
#include "festival.h" #include <bits/stdc++.h> using namespace std; vector<int> max_coupons(int a, vector<int> p, vector<int> t) { int n = int(p.size()); vector<bool> was(n); vector<int> res; for (int i = 0; i < n; i++) { int best = -1; int id = -1; for (int j = 0; j < n; j++) { if (was[j] || a < p[j]) { continue; } int new_a = (a - p[j]) * t[j]; if (new_a >= best) { new_a = best; id = j; } } if (id != -1) { a = best; res.push_back(id); was[id] = true; } else { break; } } return res; }
#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...