Submission #1260972

#TimeUsernameProblemLanguageResultExecution timeMemory
1260972alexddFestival (IOI25_festival)C++20
5 / 100
70 ms7356 KiB
#include "festival.h" #include <bits/stdc++.h> using namespace std; int n,init; vector<int> p,t; bool cmp(int i, int j) { if(p[i] * t[i] * t[j] + p[j] * t[j] != p[j] * t[i] * t[j] + p[i] * t[i]) return p[i] * t[i] * t[j] + p[j] * t[j] < p[j] * t[i] * t[j] + p[i] * t[i]; return p[i] < p[j]; } std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { p = P; t = T; n = p.size(); init = A; vector<int> ord; for(int i=0;i<n;i++) ord.push_back(i); sort(ord.begin(),ord.end(),cmp); vector<int> sol; for(int i:ord) { if((A - p[i]) * t[i] >= 0) { sol.push_back(i); A = (A - p[i]) * t[i]; } } return sol; }
#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...