이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <map>
#include "books.h"
using namespace std;
map<int, long long> m;
int s;
long long get(int x, int K) {
long long ret = 0;
for (int i = 0; i < K; i++) {
if (m.find(x + i + 1) == m.end()) m[x + i + 1] = skim(x + i + 1);
ret += m[x + i + 1];
if (ret > (long long)4e18) ret = (long long)4e18;
}
return ret;
}
void solve(int N, int K, long long A, int S) {
if (get(0, K) >= A && get(0, K) <= 2 * A) {
vector<int> v;
for (int i = 0; i < K; i++) v.push_back(i + 1);
answer(v);
return;
}
int l = 0, r = N - 1;
while (l < r) {
int m = (l + r) / 2;
long long t = get(m, 1);
if (t < A) l = m + 1;
else r = m;
}
if (l - 1 >= K && get(l, 1) + get(0, K - 1) >= A && get(l, 1) + get(0, K - 1) <= 2 * A) {
vector<int> v;
for (int i = 0; i < K - 1; i++) v.push_back(i + 1);
v.push_back(l + 1);
answer(v);
return;
}
if (l >= K) for (int i = 0; i <= K; i++) if (get(0, i) + get(l - K + i, K - i) >= A && get(0, i) + get(l - K + i, K - i) <= 2 * A) {
vector<int> v;
for (int j = 0; j < i; j++) v.push_back(j + 1);
for (int j = 0; j < K - i; j++) v.push_back(l - K + i + j + 1);
answer(v);
return;
}
impossible();
}
# | 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... |