oj.uz

Submission #810818

# Submission time Handle Problem Language Result Execution time Memory
810818 2023-08-06T15:47:55 Z MyCode A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 213 ms 860 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;

void solve(int n, int k, long long A, int S) {
    if (S == n) {
        long long a[n + 1];
        for (int i = 1; i <= n; i++)
            a[i] = skim(i);
        long long pref[n + 1];
        pref[0] = 0;
        for (int i = 1; i <= n; i++)
            pref[i] = a[i] + pref[i - 1];
        function<long long(int, int)> sum = [&](int l, int r) {
            return pref[r] - pref[l - 1];
        };
        for (int i = 1; i <= n; i++) {
            if (sum(i, i + k - 1) >= A && sum(i, i + k - 1) <= 2 * A) {
                vector<int> ans;
                for (int j = i; j < i + k; j++)
                    ans.emplace_back(j);
                answer(ans);
                return;
            }
        };
        long long s[n + 1];
        for (int i = 1; i + k - 2 <= n; i++)
            s[i] = sum(i, i + k - 2);
        for (int i = k; i <= n; i++) {
            int l = 1, r = i - k + 1;
            while (r - l > 1) {
                int m = (l + r) >> 1;
                if (s[m] + a[i] >= A)
                    r = m;
                else
                    l = m;
            }
            int ind = -1;
            if (s[l] + a[i] >= A)ind = l;
            else if (s[r] + a[i] >= A)ind = r;
            if (ind != -1 && s[ind] + a[i] <= 2 * A) {
                vector<int> ans;
                for (int j = ind; j < ind + k - 1; j++)
                    ans.emplace_back(j);
                ans.emplace_back(i);
                answer(ans);
                return;
            }
        }
        impossible();
        return;
    }
    long long sum = 0;
    vector<pair<int, long long>> ans;
    map<int, long long> mp;
    function<long long(int)> skimm = [&](int i) {
        if (mp.find(i) != mp.end())
            return mp[i];
        long long s = skim(i);
        mp[i] = s;
        return s;
    };
    for (int i = 1; i <= k; i++) {
        long long t = skimm(i);
        sum += t;
        ans.emplace_back(i, t);
    }
    for (int j = k; j >= 1; j--) {
        if (sum >= A)break;
        int l = ans[j - 1].first, r = (j < k ? ans[j].first - 1 : n);
        long long val = ans[j - 1].second;
        long long X = skimm(r);
        if (sum + X <= 2 * A) {
            ans[j - 1].first = r;
            sum -= ans[j - 1].second;
            ans[j - 1].second = X;
            sum += ans[j - 1].second;
            continue;
        }
        while (r - l > 1) {
            int m = (l + r) / 2;
            if (sum - val + skimm(m) >= A)
                r = m;
            else
                l = m;
        }
        long long s1 = skimm(l), s2 = skimm(r);
        if (sum - val + s2 > 2 * A || sum - val + s1 >= A)
            ans[j - 1].first = l, ans[j - 1].second = s1,
            sum = sum - val + s1;
        else
            ans[j - 1].first = r, ans[j - 1].second = s2,
            sum = sum - val + s2;
    }
    if (sum > 2 * A || sum < A)
        impossible();
    else {
        vector<int> res;
        for (int i = 0; i < k; i++)
            res.emplace_back(ans[i].first);
        answer(res);
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 8 ms 296 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 8 ms 304 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 5 ms 308 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 148 ms 616 KB Output is correct
10 Correct 142 ms 600 KB Output is correct
11 Correct 213 ms 600 KB Output is correct
12 Correct 132 ms 608 KB Output is correct
13 Correct 170 ms 612 KB Output is correct
14 Correct 185 ms 856 KB Output is correct
15 Correct 164 ms 860 KB Output is correct
16 Correct 186 ms 856 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 240 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 276 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 240 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 276 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 1 ms 208 KB Output is correct
47 Correct 1 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 1 ms 292 KB Output is correct
50 Correct 1 ms 280 KB Output is correct

Subtask #6
20.0 / 20.0

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

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 240 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 276 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 1 ms 208 KB Output is correct
47 Correct 1 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 1 ms 292 KB Output is correct
50 Correct 1 ms 280 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 1 ms 208 KB Output is correct
53 Correct 1 ms 208 KB Output is correct
54 Correct 1 ms 208 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 0 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 0 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 1 ms 300 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 0 ms 208 KB Output is correct
68 Correct 0 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 1 ms 208 KB Output is correct
71 Correct 1 ms 208 KB Output is correct
72 Correct 0 ms 208 KB Output is correct
73 Correct 1 ms 292 KB Output is correct
74 Correct 1 ms 296 KB Output is correct
75 Correct 1 ms 208 KB Output is correct
76 Correct 2 ms 208 KB Output is correct
77 Correct 9 ms 208 KB Output is correct
78 Correct 9 ms 208 KB Output is correct
79 Correct 6 ms 208 KB Output is correct
80 Correct 9 ms 308 KB Output is correct
81 Correct 5 ms 208 KB Output is correct
82 Correct 6 ms 208 KB Output is correct
83 Correct 8 ms 288 KB Output is correct
84 Correct 173 ms 600 KB Output is correct
85 Correct 169 ms 600 KB Output is correct
86 Correct 202 ms 616 KB Output is correct
87 Correct 143 ms 600 KB Output is correct
88 Correct 208 ms 584 KB Output is correct
89 Correct 110 ms 852 KB Output is correct
90 Correct 168 ms 852 KB Output is correct
91 Correct 186 ms 860 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 0 ms 292 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 0 ms 288 KB Output is correct
96 Correct 0 ms 288 KB Output is correct
97 Correct 0 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 0 ms 288 KB Output is correct
101 Correct 0 ms 288 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 0 ms 208 KB Output is correct
104 Correct 0 ms 288 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 1 ms 292 KB Output is correct
107 Correct 0 ms 208 KB Output is correct
108 Correct 0 ms 208 KB Output is correct
109 Correct 0 ms 208 KB Output is correct
110 Correct 1 ms 292 KB Output is correct
111 Correct 0 ms 272 KB Output is correct
112 Correct 0 ms 296 KB Output is correct
113 Correct 1 ms 296 KB Output is correct
114 Correct 0 ms 296 KB Output is correct
115 Correct 1 ms 304 KB Output is correct
116 Correct 1 ms 292 KB Output is correct
117 Correct 0 ms 292 KB Output is correct
118 Correct 0 ms 288 KB Output is correct
119 Correct 0 ms 208 KB Output is correct
120 Correct 0 ms 296 KB Output is correct
121 Correct 1 ms 284 KB Output is correct
122 Correct 1 ms 280 KB Output is correct
123 Correct 0 ms 292 KB Output is correct
124 Correct 1 ms 296 KB Output is correct
125 Correct 1 ms 292 KB Output is correct
126 Correct 0 ms 288 KB Output is correct
127 Correct 0 ms 208 KB Output is correct
128 Correct 1 ms 208 KB Output is correct
129 Correct 1 ms 208 KB Output is correct
130 Correct 1 ms 292 KB Output is correct
131 Correct 1 ms 288 KB Output is correct
132 Correct 0 ms 272 KB Output is correct
133 Correct 1 ms 208 KB Output is correct
134 Correct 0 ms 296 KB Output is correct
135 Correct 1 ms 296 KB Output is correct