제출 #1282053

#제출 시각아이디문제언어결과실행 시간메모리
1282053nataliaa축제 (IOI25_festival)C++20
0 / 100
1095 ms6688 KiB
#include "festival.h" #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(); pair<int,int> p1[n], p[n]; for(int i = 0; i <n; i++) { p[i].first = P[i]; p[i].second = i; p1[i].first = i; p1[i].second = T[i]; } sort(p, p+n); vector<int> v; for(int i = 0; i < n ; i++) { int mn = 1e9, ind =0, l =-1, q = 0; for(int j = 0; j<n; j++) { if(p[j].first<=A) { int k = (A-p[j].first)*p1[p[j].second].second; if(k<mn) { if(l!=-1) p[l].first = q; q = p[j].first; l = j; p[j].first = 0; mn = k; ind = j; } } } p[ind].first = 1e9+5; v.push_back(ind); } return v; }
#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...