| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1322450 | adiyer | A Difficult(y) Choice (BOI21_books) | C++20 | 1 ms | 1184 KiB |
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
typedef long long ll;
void solve(int n, int k, ll s, int c) {
vector < int > ans, pos;
ll a[n + 1], cur = 0;
for(int i = 1; i <= n; i++) a[i] = skim(i);
for(int i = 1; i <= n; i++){
if(s <= a[i] && a[i] <= 2 * s){
answer({i}); return;
}
}
for(int i = 1; i <= k; i++) cur += a[i];
if(cur > 2 * s){ impossible(); return; }
ll cur2 = 0, cnt = 0;
for(int i = n; i >= 1; i--)
if(a[i] < s && cnt < k)
cur2 += a[i], cnt++, pos.push_back(i);
if(cur2 < s){ impossible(); return; }
reverse(pos.begin(), pos.end());
for(int i = 1; i <= k; i++){
cur -= a[i];
cur += a[pos.back()];
ans.push_back(pos.back());
if(s <= cur && cur <= 2 * s){
for(int j = i + 1; j <= k; j++) ans.push_back(j);
answer(ans);
return;
}
pos.pop_back();
}
int x = 5/0;
return;
}
컴파일 시 표준 에러 (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... | ||||
