| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1326327 | hahaha | Festival (IOI25_festival) | C++20 | 21 ms | 3504 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
vector <int>P,T;
int A, n;
vector<signed> max_coupons(signed A, std::vector<signed> P,
std::vector<signed> T){
pair<int,int> t1[n],t2[n];
int k1=-1,k2=-1;
for(int i=0; i<n; i++){
if(T[i]==2){
t2[++k2].f=P[i];
t2[k2].s=i;}
else{
t1[++k1].f=P[i];
t1[k1].s=i;}
}
k1++; k2++;
sort(t1, t1+k1);
sort(t2, t2+k2);
for(int i=1; i<k1; i++) t1[i].f+=t1[i-1].f;
int c=A;
int m1=0,m2=0;
for(int i=0; i<=k2&&c>-1; i++){
int l=-1, r=k1-1;
while(l<r){
int x=(l+r+1)/2;
if(t1[x].f<=c) l=x;
else if(t1[x].f<c) r=x-1;
}
if(m1+m2<i+l+1){
m1=l+1;
m2=i;
}
int z=1e16;
c=min((c-t2[i].f)*2, z);
}
vector<signed> R;
for( int i=0; i<m2; i++)
R.push_back(t2[i].s);
for(int i=0; i<m1; i++)
R.push_back(t1[i].s);
for(auto v:R)
return R;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
