Submission #1339933

#TimeUsernameProblemLanguageResultExecution timeMemory
1339933Desh03Festival (IOI25_festival)C++20
0 / 100
59 ms4284 KiB
#include <bits/stdc++.h>

using namespace std;

vector<int> max_coupons(int a, vector<int> p, vector<int> t) {
    int n = p.size();
    vector<int> id(n);
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](const int &i, const int &j) {
        return ((long long) (a - p[i]) * t[i] - p[j]) * t[j] < ((long long) (a - p[j]) * t[j] - p[i]) * t[i];
    });
    return id;
}
#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...