Submission #1286775

#TimeUsernameProblemLanguageResultExecution timeMemory
1286775kawhietFestival (IOI25_festival)C++20
5 / 100
1096 ms4048 KiB
#include <bits/stdc++.h> #include "festival.h" using namespace std; constexpr int64_t inf = 1e15; vector<int> max_coupons(int A, vector<int> p, vector<int> t) { int n = p.size(); vector<bool> vis(n); vector<int> res; int64_t x = A; int j = 0; while (x >= 0) { int64_t mx = -inf; for (int i = 0; i < n; i++) { if (!vis[i] && (x - p[i]) * t[i] > mx) { mx = (x - p[i]) * t[i]; mx = min(mx, inf); j = i; } } if (mx >= 0) { vis[j] = 1; res.push_back(j); x = mx; } 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...