oj.uz

Submission #720299

# Submission time Handle Problem Language Result Execution time Memory
720299 2023-04-07T22:03:00 Z Johann A Difficult(y) Choice (BOI21_books) C++14
100 / 100
 2 ms 1152 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.
//

typedef long long ll;
typedef vector<ll> vi;
typedef set<ll> si;
#define sz(x) (int)(x).size()

ll A;
int N, K, S;

vi store;
ll mySkim(int x)
{
    assert(1 <= x && x <= N);
    if (store[x] == -1)
        store[x] = skim(x);
    return store[x];
}
ll eval(si &ans)
{
    assert(sz(ans) == K);
    ll checkSum = 0;
    for (ll x : ans)
        checkSum += mySkim((int)x);
    return checkSum;
}

void myImpossible() { impossible(); }
void myAnswer(si &ans)
{
    assert(sz(ans) == K);
    ll checkSum = eval(ans);
    assert(A <= checkSum && checkSum <= 2 * A);
    vector<int> yourAns;
    for (ll x : ans)
        yourAns.push_back((int)x);
    answer(yourAns);
}

void solve(int _N, int _K, long long _A, int _S)
{
    A = _A, N = _N, K = _K, S = _S;
    store.assign(N + 1, -1); // starting with 1 index
    // if (S == N)              // Sub 1 & 2
    // {
    //     for (int i = 1; i <= N; ++i)
    //         mySkim(i);

    //     ll psum = 0;
    //     for (int i = 1; i <= K; ++i)
    //         psum += mySkim(i);
    //     if (psum > 2 * A)
    //         myImpossible();
    //     int idx = 1;
    //     while (idx + K <= N && psum < A)
    //     {
    //         psum -= mySkim(idx);
    //         psum += mySkim(idx + K);
    //         ++idx;
    //     }
    //     if (psum > 2 * A)
    //     {
    //         assert(mySkim(idx + K - 1) > A);
    //         si ans;
    //         for (int i = 1; i <= K - 1; ++i)
    //             ans.insert(i);
    //         ans.insert(idx + K - 1);
    //         if (eval(ans) <= 2 * A)
    //             myAnswer(ans);
    //         else
    //             myImpossible();
    //     }
    //     else if (psum >= A)
    //     {
    //         si ans;
    //         for (int i = idx; i < idx + K; ++i)
    //             ans.insert(i);
    //         myAnswer(ans);
    //     }
    //     else
    //         myImpossible();
    // }
    // else
    { // Sub 4
        ll psum = 0;
        for (int i = 1; i <= K - 1; ++i)
            psum += mySkim(i);
        if (psum + mySkim(K) > 2 * A)
        {
            myImpossible();
            return;
        }

        // binary search for first Element below 2 * A - psum
        int l = K, r = N, m;
        while (l < r)
        {
            m = (l + r + 1) / 2;
            if (mySkim(m) > 2 * A - psum)
                r = m - 1;
            else
                l = m;
        }
        psum += mySkim(l);
        if (A <= psum && psum <= 2 * A)
        {
            si ans;
            for (int i = 1; i <= K - 1; ++i)
                ans.insert(i);
            ans.insert(l);
            myAnswer(ans);
            return;
        }
        else
        {
            for (int vorne = 0; vorne <= K; ++vorne)
            {
                si ans;
                for (int i = 1; i <= vorne; ++i)
                    ans.insert(i);
                for (int i = l; i > l - K + vorne; --i)
                    ans.insert(i);
                ll check = eval(ans);
                if (A <= check && check <= 2 * A)
                {
                    myAnswer(ans);
                    return;
                }
            }
            myImpossible();
        }
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 1056 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 1056 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 2 ms 1012 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 1152 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 1084 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 1056 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 2 ms 1012 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 1152 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 1084 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 2 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 2 ms 976 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 1 ms 976 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 1056 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 2 ms 1012 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 1152 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 1084 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 2 ms 976 KB Output is correct
35 Correct 2 ms 976 KB Output is correct
36 Correct 1 ms 1104 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 2 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 2 ms 976 KB Output is correct
49 Correct 2 ms 976 KB Output is correct
50 Correct 2 ms 1024 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 976 KB Output is correct
2 Correct 1 ms 976 KB Output is correct
3 Correct 1 ms 976 KB Output is correct
4 Correct 1 ms 976 KB Output is correct
5 Correct 1 ms 976 KB Output is correct
6 Correct 1 ms 976 KB Output is correct
7 Correct 1 ms 1056 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 1 ms 976 KB Output is correct
12 Correct 2 ms 1012 KB Output is correct
13 Correct 1 ms 976 KB Output is correct
14 Correct 1 ms 976 KB Output is correct
15 Correct 1 ms 976 KB Output is correct
16 Correct 1 ms 976 KB Output is correct
17 Correct 1 ms 976 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 1 ms 1152 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 1084 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 976 KB Output is correct
26 Correct 1 ms 976 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 976 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 976 KB Output is correct
35 Correct 1 ms 976 KB Output is correct
36 Correct 1 ms 976 KB Output is correct
37 Correct 1 ms 976 KB Output is correct
38 Correct 2 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 1 ms 976 KB Output is correct
41 Correct 1 ms 976 KB Output is correct
42 Correct 1 ms 976 KB Output is correct
43 Correct 1 ms 976 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 976 KB Output is correct
47 Correct 1 ms 976 KB Output is correct
48 Correct 2 ms 976 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 1 ms 976 KB Output is correct
51 Correct 1 ms 976 KB Output is correct
52 Correct 1 ms 976 KB Output is correct
53 Correct 1 ms 976 KB Output is correct
54 Correct 1 ms 976 KB Output is correct
55 Correct 1 ms 976 KB Output is correct
56 Correct 1 ms 976 KB Output is correct
57 Correct 1 ms 976 KB Output is correct
58 Correct 2 ms 976 KB Output is correct
59 Correct 2 ms 976 KB Output is correct
60 Correct 2 ms 976 KB Output is correct
61 Correct 1 ms 1104 KB Output is correct
62 Correct 1 ms 976 KB Output is correct
63 Correct 2 ms 976 KB Output is correct
64 Correct 1 ms 976 KB Output is correct
65 Correct 1 ms 976 KB Output is correct
66 Correct 1 ms 976 KB Output is correct
67 Correct 1 ms 976 KB Output is correct
68 Correct 1 ms 976 KB Output is correct
69 Correct 1 ms 976 KB Output is correct
70 Correct 1 ms 976 KB Output is correct
71 Correct 1 ms 976 KB Output is correct
72 Correct 1 ms 976 KB Output is correct
73 Correct 2 ms 976 KB Output is correct
74 Correct 2 ms 976 KB Output is correct
75 Correct 2 ms 1024 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 464 KB Output is correct
85 Correct 1 ms 464 KB Output is correct
86 Correct 1 ms 412 KB Output is correct
87 Correct 1 ms 420 KB Output is correct
88 Correct 1 ms 464 KB Output is correct
89 Correct 2 ms 416 KB Output is correct
90 Correct 1 ms 412 KB Output is correct
91 Correct 1 ms 464 KB Output is correct
92 Correct 1 ms 976 KB Output is correct
93 Correct 1 ms 976 KB Output is correct
94 Correct 1 ms 1060 KB Output is correct
95 Correct 1 ms 976 KB Output is correct
96 Correct 1 ms 1064 KB Output is correct
97 Correct 1 ms 1052 KB Output is correct
98 Correct 1 ms 1064 KB Output is correct
99 Correct 1 ms 1056 KB Output is correct
100 Correct 1 ms 1056 KB Output is correct
101 Correct 2 ms 1152 KB Output is correct
102 Correct 2 ms 1064 KB Output is correct
103 Correct 1 ms 1056 KB Output is correct
104 Correct 1 ms 1060 KB Output is correct
105 Correct 1 ms 976 KB Output is correct
106 Correct 1 ms 976 KB Output is correct
107 Correct 1 ms 1060 KB Output is correct
108 Correct 1 ms 1044 KB Output is correct
109 Correct 2 ms 976 KB Output is correct
110 Correct 1 ms 976 KB Output is correct
111 Correct 1 ms 976 KB Output is correct
112 Correct 1 ms 1040 KB Output is correct
113 Correct 1 ms 976 KB Output is correct
114 Correct 1 ms 976 KB Output is correct
115 Correct 1 ms 976 KB Output is correct
116 Correct 1 ms 1056 KB Output is correct
117 Correct 1 ms 968 KB Output is correct
118 Correct 1 ms 976 KB Output is correct
119 Correct 1 ms 1040 KB Output is correct
120 Correct 1 ms 976 KB Output is correct
121 Correct 1 ms 1064 KB Output is correct
122 Correct 1 ms 1060 KB Output is correct
123 Correct 1 ms 1060 KB Output is correct
124 Correct 2 ms 1056 KB Output is correct
125 Correct 1 ms 1060 KB Output is correct
126 Correct 1 ms 976 KB Output is correct
127 Correct 1 ms 976 KB Output is correct
128 Correct 1 ms 1060 KB Output is correct
129 Correct 2 ms 976 KB Output is correct
130 Correct 1 ms 1056 KB Output is correct
131 Correct 1 ms 1036 KB Output is correct
132 Correct 1 ms 976 KB Output is correct
133 Correct 1 ms 976 KB Output is correct
134 Correct 1 ms 976 KB Output is correct
135 Correct 1 ms 976 KB Output is correct