This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "books.h"
#define ll long long
using namespace std;
void solve(int n, int k, ll a, int Q) {
ll b[n];
for (int i = 0; i < n; i++) {
b[i] = skim(i + 1);
}
vector<int> rem;
for (int i = 0; i < n; i++) {
rem.push_back(i);
}
ll s = 0;
vector<int> ans;
while (k--) {
bool done = 0;
for (auto i : rem) {
if (a - s <= b[i]) {
if (b[i] > 2 * a - s) {
impossible();
}
s += b[i];
ans.push_back(i + 1);
done = 1;
break;
}
}
if (!done) {
s += b[rem.back()];
ans.push_back(rem.back() + 1);
}
vector<int> New;
for (auto i : rem) {
if (i == ans.back()) continue;
New.push_back(i);
}
rem = New;
}
if (!(a <= s && s <= 2 * a)) {
impossible();
}
answer(ans);
}
# | 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... |