Submission #1255562

#TimeUsernameProblemLanguageResultExecution timeMemory
1255562onbertFestival (IOI25_festival)C++20
27 / 100
72 ms9656 KiB
#include "festival.h" #include <bits/stdc++.h> using namespace std; #define int long long struct thing { int p, t, id; bool operator < (const thing &b) const { if (t == b.t) return p < b.p; return (b.t - 1) * t * p < (t - 1) * b.t * b.p; } }; const int maxn = 2e5 + 5; int n; vector<thing> a; vector<int32_t> max_coupons(int32_t A, vector<int32_t> P, vector<int32_t> T) { n = P.size(); for (int i=0;i<n;i++) a.push_back({P[i], T[i], i}); sort(a.begin(), a.end()); vector<int32_t> ans(n); for (int i=0;i<n;i++) ans[i] = a[i].id; 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...