oj.uz

답안 #950647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950647 2024-03-20T14:21:05 Z Pring A Difficult(y) Choice (BOI21_books) C++17
5 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
#include "books.h"
using namespace std;

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;
using ll = long long;

namespace {
    const int MXN = 10;
    int n, k, s;
    ll a;
    int b;
    vector<int> v;
    ll l[MXN], r[MXN];

    int BSH(int l, int r, ll b) {
        while (l + 1 < r) {
            int mid = (l + r) >> 1;
            (skim(mid) >= b ? r : l) = mid;
        }
        return r;
    }

    void SOLVE() {
        b = BSH(0, n + 1, a);
        if (b < k) {
            impossible();
            return;
        }
        FOR(i, 0, k) l[i] = skim(i + 1);
        if (b != n + 1) {
            ll c = skim(b);
            ll acc = 0;
            FOR(i, 0, k - 1) acc += l[i];
            acc += c;
            if (acc <= 2 * a) {
                FOR(i, 1, k) v.push_back(i);
                v.push_back(b);
                answer(v);
                return;
            }
        }
        if (b == k) {
            impossible();
            return;
        }
        FOR(i, 0, k) r[i] = skim(b - k + i);
        ll acc = 0;
        FOR(i, 0, k) acc += r[i];
        if (acc < a) {
            impossible();
            return;
        }
        if (acc <= 2 * a) {
            FOR(i, 0, k) v.push_back(b - k + i);
            answer(v);
            return;
        }
        FOR(i, 0, k) {
            acc -= r[i];
            acc += l[i];
            if (acc <= 2 * a) {
                FOR(j, 0, i + 1) v.push_back(j);
                FOR(j, i + 1, k) v.push_back(b - k + j);
                answer(v);
                return;
            }
        }
        impossible();
    }
}

void solve(int n, int k, ll a, int s) {
    ::n = n;
    ::k = k;
    ::a = a;
    ::s = s;
    SOLVE();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 592 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 0 ms 600 KB Incorrect
14 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Incorrect
10 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 344 KB Incorrect
10 Halted 0 ms 0 KB -