Submission #1277899

#TimeUsernameProblemLanguageResultExecution timeMemory
1277899SabaKharebavaFestival (IOI25_festival)C++20
0 / 100
185 ms15656 KiB
#include<bits/stdc++.h> using namespace std; std::vector<int> max_coupons(int a, std::vector<int> p, std::vector<int> t) { int n = p.size(); vector<vector<int>> v(n, vector<int> (3)); for (int i = 0; i < n; i++) { v[i][0] = p[i]; v[i][1] = t[i]; v[i][2] = i; } sort(v.begin(), v.end(), [&](vector<int> a, vector<int> b) { long long A = -a[0] * a[1] * b[1] - b[0] * b[1]; long long B = -b[0] * a[1] * b[1] - a[0] * a[1]; return A > B; }); vector<int> ans; for (vector<int> vec : v) ans.push_back(vec[2]); 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...