제출 #1269310

#제출 시각아이디문제언어결과실행 시간메모리
1269310sula2축제 (IOI25_festival)C++20
27 / 100
58 ms4288 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<int> ind(N); iota(ind.begin(), ind.end(), 0); sort(ind.begin(), ind.end(), [&](int i, int j) { long long x = 1LL*-P[i]*T[i]*T[j] - 1LL*P[j]*T[j]; long long y = 1LL*-P[j]*T[j]*T[i] - 1LL*P[i]*T[i]; return x > y; }); return ind; }
#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...