| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1281491 | lizi14 | 축제 (IOI25_festival) | C++20 | 38 ms | 7128 KiB |
#include "festival.h"
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
using namespace std;
#define ss second
#define f first
vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
vector<pair<int,int>>p(P.size());
for(int i=0; i<P.size(); i++){
p[i]={P[i],i};
}
sort(p.begin(),p.end());
vector<int>v;
for(int i=0; i<p.size(); i++){
if(A<p[i].f)break;
else{
A=(A-p[i].f);
v.push_back(p[i].ss);
}
}
return {v};
}| # | 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... | ||||
