| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1282060 | georgeckito | 축제 (IOI25_festival) | C++20 | 259 ms | 25468 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) {
vector<int> R;
map< int, vector<int> > m;
for(int i = 0; i < P.size(); i++) {
m[P[i]].push_back(i);
}
sort(P.begin(), P.end());
for(int i = 0; i < P.size(); i++) {
if(A-P[i] >= 0) {
A -= P[i];
R.push_back(m[P[i]].back());
m[P[i]].pop_back();
} else break;
}
return R;
}
/*
4 13
4 1
500 3
8 3
14 4
*/| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
