oj.uz

Submission #681647

# Submission time Handle Problem Language Result Execution time Memory
681647 2023-01-13T14:04:45 Z YENGOYAN A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 2 ms 1100 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;
using ll = long long;
//
// --- 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 solve(int n, int k, long long a, int s) {
    vector<ll> vec(n);
    ll sm = 0;
    for (int i = 0; i < k - 1; ++i) {
        vec[i] = skim(i + 1);
        sm += vec[i];
    }
    int l = k - 2, r = n - 1;
    while (l + 1 < r) {
        int m = (l + r) / 2;
        ll b = vec[m];
        if (!b) b = skim(m + 1);
        vec[m] = b;
        if (b > a) r = m;
        else l = m;
    }
    ++r;
    if (r == n || (sm + vec[r + 1] < a || sm + vec[r + 1] > 2 * a)) {
        vector<int> ids;
        for (int i = 0; i < k; ++i) {
            if (!vec[i]) vec[i] = skim(i + 1);
            ids.push_back(i);
        }
        for (int i = max(r - k, k); i < r; ++i) {
            if (!vec[i]) vec[i] = skim(i + 1);
            ids.push_back(i);
        }
        for (int i = 0; i + k - 1 < ids.size(); ++i) {
            sm = 0;
            for (int j = i; j < i + k; ++j) {
                sm += vec[ids[j]];
            }
            if (sm >= a && sm <= 2 * a) {
                vector<int> ans;
                for (int j = i; j < i + k; ++j) 
                    ans.push_back(ids[j] + 1);
                answer(ans);
                return;
            }
        }
        sm = 0;
        for (int i = 0; i < k - 1; ++i) sm += vec[i];
        l = k - 2, r = n - 1;
        while (l + 1 < r) {
            int m = (l + r) / 2;
            long long b = vec[m];
            if (!b) b = skim(m + 1);
            vec[m] = b;
            if (sm + b >= a) r = m;
            else l = m;
        }
        if (sm + vec[r] < a || sm + vec[r] > 2 * a) impossible();
        else {
            vector<int> ans;
            for (int i = 1; i <= k - 1; ++i) ans.push_back(i);
            ans.push_back(r + 1);
            answer(ans);
        }
        return;
    }
    vector<int> ans;
    for (int i = 1; i < k; ++i) ans.push_back(i);
    ans.push_back(r + 2);
    answer(ans);
}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:44:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for (int i = 0; i + k - 1 < ids.size(); ++i) {
      |                         ~~~~~~~~~~^~~~~~~~~~~~

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 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 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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 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 2 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 976 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 976 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 2 ms 976 KB Output is correct
12 Correct 1 ms 976 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 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 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 976 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 2 ms 976 KB Output is correct
12 Correct 1 ms 976 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 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 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 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 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 2 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 2 ms 976 KB Output is correct
48 Correct 1 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 976 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 2 ms 976 KB Output is correct
12 Correct 1 ms 976 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 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 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 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 1100 KB Output is correct
48 Correct 2 ms 976 KB Output is correct
49 Correct 2 ms 976 KB Output is correct
50 Correct 1 ms 976 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 976 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 2 ms 976 KB Output is correct
12 Correct 1 ms 976 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 1 ms 976 KB Output is correct
20 Correct 1 ms 976 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 1 ms 976 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 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 1 ms 976 KB Output is correct
39 Correct 1 ms 976 KB Output is correct
40 Correct 2 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 2 ms 976 KB Output is correct
48 Correct 1 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 1 ms 976 KB Output is correct
59 Correct 1 ms 976 KB Output is correct
60 Correct 1 ms 976 KB Output is correct
61 Correct 1 ms 976 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 1100 KB Output is correct
73 Correct 2 ms 976 KB Output is correct
74 Correct 2 ms 976 KB Output is correct
75 Correct 1 ms 976 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 0 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 464 KB Output is correct
87 Correct 1 ms 464 KB Output is correct
88 Correct 1 ms 464 KB Output is correct
89 Correct 1 ms 464 KB Output is correct
90 Correct 1 ms 464 KB Output is correct
91 Correct 1 ms 464 KB Output is correct
92 Correct 2 ms 976 KB Output is correct
93 Correct 1 ms 976 KB Output is correct
94 Correct 1 ms 976 KB Output is correct
95 Correct 1 ms 976 KB Output is correct
96 Correct 2 ms 976 KB Output is correct
97 Correct 1 ms 976 KB Output is correct
98 Correct 1 ms 976 KB Output is correct
99 Correct 1 ms 976 KB Output is correct
100 Correct 1 ms 976 KB Output is correct
101 Correct 1 ms 976 KB Output is correct
102 Correct 2 ms 976 KB Output is correct
103 Correct 1 ms 976 KB Output is correct
104 Correct 1 ms 976 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 976 KB Output is correct
108 Correct 1 ms 976 KB Output is correct
109 Correct 1 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 976 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 976 KB Output is correct
117 Correct 1 ms 976 KB Output is correct
118 Correct 1 ms 976 KB Output is correct
119 Correct 1 ms 976 KB Output is correct
120 Correct 1 ms 976 KB Output is correct
121 Correct 1 ms 976 KB Output is correct
122 Correct 2 ms 976 KB Output is correct
123 Correct 1 ms 976 KB Output is correct
124 Correct 1 ms 976 KB Output is correct
125 Correct 1 ms 976 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 976 KB Output is correct
129 Correct 1 ms 976 KB Output is correct
130 Correct 1 ms 976 KB Output is correct
131 Correct 2 ms 976 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