oj.uz

답안 #953745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953745 2024-03-26T15:23:18 Z asdasdqwer A Difficult(y) Choice (BOI21_books) C++14
60 / 100
 135 ms 1992 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;

//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void subtask2(int N, int K, long long A, int S) {
    vector<long long> a(N);
    for (int i=0;i<N;i++) {
        a[i] = skim(i+1);
    }

    long long pref = 0;
    for (int i=0;i<K;i++) {
        pref += a[i];
    }

    if (pref > 2*A) {
        impossible();
        return;
    }

    auto it = lower_bound(a.begin(), a.end(), A);
    if (it != a.end()) {
        long long num = *it;
        for (int i=0;i<K-1;i++) num += a[i];
        if (num <= 2LL*A) {
            vector<int> idx;
            for (int i=0;i<K-1;i++) idx.push_back(i+1);
            idx.push_back(distance(a.begin(), it)+1);

            answer(idx);
            return;
        }
    }

    while (a.back() >= A)a.pop_back();

    for (int i=0;i<(int)a.size()-K+1;i++) {
        long long sum = 0;
        for (int j=0;j<K;j++) {
            sum += a[j+i];
        }

        if (A <= sum && sum <= 2LL*A) {
            vector<int> idx;
            for (int j=0;j<K;j++) {
                idx.push_back(i+j+1);
            }

            answer(idx);
            return;
        }
    }

    impossible();
}

vector<long long> vals;
int toge;
int qu;

long long query(int i) {
    if (vals[i] == -1) {
        qu++;
        assert(qu <= toge);

        vals[i] = skim(i+1);
    }

    return vals[i];
}

void solve(int N, int K, long long A, int S) {
    toge = S;
    qu=0;
    if (N <= S) {
        subtask2(N,K,A,S);
        return;
    }

    vals.assign(N, -1);

    // check first K values
    long long sum = 0;
    for (int i=0;i<K;i++) {
        sum += query(i);
    }

    if (sum > 2LL*A) {
        impossible();
        return;
    }

    if (sum >= A) {
        vector<int> idx;
        for (int i=0;i<K;i++) {
            idx.push_back(i+1);
        }
        answer(idx);
        return;
    }


    // binary search for the first value greater or equal to A
    int l = K, r = N-1;
    int ans = -1;
    long long valans = -1;
    while (l <= r) {
        int m = l + (r-l)/2;
        long long val = query(m);
        if (val == A) {
            ans = m;
            valans = A;
            break;
        }

        if (val < A) {
            l = m+1;
        }

        else {
            ans = m;
            valans = val;
            r = m-1;
        }
    }

    // check if prefix + a is fitting
    int last = N-1;
    if (ans != -1) {
        long long cand = sum - query(K-1) + valans;
        long long cand2 = sum - query(0) + valans;
        if (A <= cand && cand <= 2LL*A) {
            vector<int> idx;
            for (int i=0;i<K-1;i++)idx.push_back(i+1);
            idx.push_back(ans+1);
            answer(idx);
            return;
        }

        if (A <= cand2 && cand2 <= 2LL*A) {
            vector<int> idx;
            for (int i=1;i<K;i++)idx.push_back(i+1);
            idx.push_back(ans+1);
            answer(idx);
            return;
        }

        last = ans-1;
    }

    long long suf = 0;
    for (int i=0;i<K;i++) {
        suf += query(last - i);
    }

    if (A <= suf && suf <= 2LL*A) {
        vector<int> idx;
        for (int i=0;i<K;i++) {
            idx.push_back(last - i + 1);
        }
        answer(idx);
        return;
    }

    if (suf < A) {
        impossible();
        return;
    }

    // now prefix has sum < a, and suffix has sum > 2*a
    // then, there must be a subarray, such that the sum is exactly in between
    // why? because if that wasn't true, then the added contribution must be greater than a
    // however, since all elements are smaller than a, any difference between two elements cannot be greater 
    // that a, hence, there must be a subarray with the desired sum

    l = 0, r = last - K + 1;
    while (l <= r) {
        int m = l + (r-l)/2;

        long long tmpSum = 0;
        for (int i=0;i<K;i++) {
            tmpSum += query(i+m);
        }

        if (A <= tmpSum && tmpSum <= 2LL*A) {
            vector<int> idx;
            for (int i=0;i<K;i++)idx.push_back(i+m+1);
            answer(idx);
            return;
        }

        else if (tmpSum < A) {
            l = m+1;
        }

        else {
            r = m-1;
        }
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 111 ms 600 KB Output is correct
10 Correct 118 ms 600 KB Output is correct
11 Correct 113 ms 600 KB Output is correct
12 Correct 128 ms 600 KB Output is correct
13 Correct 109 ms 600 KB Output is correct
14 Correct 114 ms 600 KB Output is correct
15 Correct 135 ms 600 KB Output is correct
16 Correct 115 ms 600 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1196 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 1 ms 1192 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1112 KB Output is correct
25 Correct 1 ms 1192 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1196 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 1 ms 1192 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1112 KB Output is correct
25 Correct 1 ms 1192 KB Output is correct
26 Correct 1 ms 1120 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 1 ms 1196 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1368 KB Output is correct
32 Correct 1 ms 1120 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1120 KB Output is correct
35 Correct 1 ms 1200 KB Output is correct
36 Correct 1 ms 1120 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 1 ms 1392 KB Output is correct
39 Correct 1 ms 1112 KB Output is correct
40 Correct 1 ms 1368 KB Output is correct
41 Correct 1 ms 1112 KB Output is correct
42 Correct 1 ms 1368 KB Output is correct
43 Correct 1 ms 1112 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 1 ms 1112 KB Output is correct
46 Correct 1 ms 1368 KB Output is correct
47 Correct 1 ms 1112 KB Output is correct
48 Correct 1 ms 1112 KB Output is correct
49 Correct 1 ms 1188 KB Output is correct
50 Correct 1 ms 1112 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1196 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 1 ms 1192 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1112 KB Output is correct
25 Correct 1 ms 1192 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1192 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 1 ms 1192 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1112 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 1 ms 1196 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 1 ms 1368 KB Output is correct
36 Correct 1 ms 1112 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 1 ms 1112 KB Output is correct
39 Correct 1 ms 1112 KB Output is correct
40 Correct 1 ms 1368 KB Output is correct
41 Correct 1 ms 1112 KB Output is correct
42 Correct 1 ms 1196 KB Output is correct
43 Correct 1 ms 1364 KB Output is correct
44 Correct 1 ms 1124 KB Output is correct
45 Correct 1 ms 1196 KB Output is correct
46 Runtime error 2 ms 1992 KB Execution killed with signal 6
47 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1196 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 1 ms 1192 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1112 KB Output is correct
25 Correct 1 ms 1192 KB Output is correct
26 Correct 1 ms 1120 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 1 ms 1196 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1368 KB Output is correct
32 Correct 1 ms 1120 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1120 KB Output is correct
35 Correct 1 ms 1200 KB Output is correct
36 Correct 1 ms 1120 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 1 ms 1392 KB Output is correct
39 Correct 1 ms 1112 KB Output is correct
40 Correct 1 ms 1368 KB Output is correct
41 Correct 1 ms 1112 KB Output is correct
42 Correct 1 ms 1368 KB Output is correct
43 Correct 1 ms 1112 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 1 ms 1112 KB Output is correct
46 Correct 1 ms 1368 KB Output is correct
47 Correct 1 ms 1112 KB Output is correct
48 Correct 1 ms 1112 KB Output is correct
49 Correct 1 ms 1188 KB Output is correct
50 Correct 1 ms 1112 KB Output is correct
51 Correct 1 ms 1112 KB Output is correct
52 Correct 1 ms 1192 KB Output is correct
53 Correct 1 ms 1112 KB Output is correct
54 Correct 1 ms 1192 KB Output is correct
55 Correct 1 ms 1112 KB Output is correct
56 Correct 1 ms 1112 KB Output is correct
57 Correct 1 ms 1112 KB Output is correct
58 Correct 1 ms 1196 KB Output is correct
59 Correct 1 ms 1112 KB Output is correct
60 Correct 1 ms 1368 KB Output is correct
61 Correct 1 ms 1112 KB Output is correct
62 Correct 1 ms 1112 KB Output is correct
63 Correct 1 ms 1112 KB Output is correct
64 Correct 1 ms 1112 KB Output is correct
65 Correct 1 ms 1368 KB Output is correct
66 Correct 1 ms 1112 KB Output is correct
67 Correct 1 ms 1196 KB Output is correct
68 Correct 1 ms 1364 KB Output is correct
69 Correct 1 ms 1124 KB Output is correct
70 Correct 1 ms 1196 KB Output is correct
71 Runtime error 2 ms 1992 KB Execution killed with signal 6
72 Halted 0 ms 0 KB -