oj.uz

Submission #697984

# Submission time Handle Problem Language Result Execution time Memory
697984 2023-02-11T17:39:15 Z _martynas A Difficult(y) Choice (BOI21_books) C++14
100 / 100
 239 ms 1380 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.
//

#define F first
#define S second
#define PB push_back
#define all(a) (a).begin(), (a).end()

using ll = long long;

void solve(int N, int K, long long A, int S) {
    vector<pair<ll, int>> known;
    if(S >= N) {
        for(int i = 1; i <= N; i++) {
            known.PB({skim(i), i});
        }
        vector<pair<ll, int>> consider = known;
        sort(all(consider));
        consider.erase(unique(consider.begin(), consider.end()), consider.end());
        for(int i = K-1; i < consider.size(); i++) {
            if(consider[i].F >= A) {
                ll sum = consider[i].F;
                for(int j = 1; j < K; j++) sum += consider[j-1].F;
                if(A <= sum && sum <= 2*A) {
                    vector<int> ans;
                    for(int j = 1; j < K; j++) ans.PB(consider[j-1].S);
                    ans.PB(i+1);
                    answer(ans);
                }
                break;
            }
        }
        for(int i = 1; i+K-1 <= consider.size(); i++) {
            ll sum = 0;
            for(int j = 0; j < K; j++) sum += consider[i-1+j].F;
            if(A <= sum && sum <= 2*A) {
                vector<int> ans;
                for(int j = 0; j < K; j++) ans.PB(consider[i-1+j].S);
                answer(ans);
            }
        }
        impossible();
    }
    else {
        // S < N
        // S >= 40 for every test (or equal to N)
        // Therefore, N > 40 (if not testing locally)
        int lo = 1, hi = N;
        // find first x such that x >= A
        while(lo < hi) {
            int m = (lo+hi)/2;
            if(skim(m) < A) {
                lo = m+1;
            }
            else {
                hi = m;
            }
        }
        for(int i = 1; i <= K; i++) {
            known.PB({skim(i), i});
        }
        ll sum = skim(lo);
        ll mx = sum;
        for(int i = 1; i < K; i++) sum += known[i-1].F;
        if(lo < K) sum -= mx, sum += known[K-1].F;
        if(A <= sum && sum <= 2*A) {
            vector<int> ans;
            for(int i = 1; i < K; i++) ans.PB(known[i-1].S);
            if(lo >= K) ans.PB(lo);
            else ans.PB(K);
            answer(ans);
        }
        vector<pair<ll, int>> consider = known;
        for(int i = 1; i <= K; i++) {
            int where = max(1, lo-i+(mx < A));
            consider.PB({skim(where), where});
        }
        sort(all(consider));
        consider.erase(unique(consider.begin(), consider.end()), consider.end());
        for(int i = 1; i+K-1 <= consider.size(); i++) {
            sum = 0;
            for(int j = 0; j < K; j++) sum += consider[i-1+j].F;
            if(A <= sum && sum <= 2*A) {
                vector<int> ans;
                for(int j = 0; j < K; j++) ans.PB(consider[i-1+j].S);
                answer(ans);
            }
        }
        impossible();
    }
}
/*
6 3 10 6
1 2 3 4 5 6

6 3 15 6
1 2 3 4 5 6

6 3 100 6
1 2 3 4 197 200

6 3 16 6
1 2 3 4 5 6

15 3 42 14
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

15 3 60 14
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
*/

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:32:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int i = K-1; i < consider.size(); i++) {
      |                          ~~^~~~~~~~~~~~~~~~~
books.cpp:45:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int i = 1; i+K-1 <= consider.size(); i++) {
      |                        ~~~~~~^~~~~~~~~~~~~~~~~~
books.cpp:92:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for(int i = 1; i+K-1 <= consider.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 6 ms 324 KB Output is correct
3 Correct 7 ms 336 KB Output is correct
4 Correct 8 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 6 ms 336 KB Output is correct
7 Correct 9 ms 300 KB Output is correct
8 Correct 10 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 308 KB Output is correct
2 Correct 8 ms 320 KB Output is correct
3 Correct 6 ms 296 KB Output is correct
4 Correct 9 ms 332 KB Output is correct
5 Correct 10 ms 328 KB Output is correct
6 Correct 8 ms 316 KB Output is correct
7 Correct 8 ms 336 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 224 ms 1116 KB Output is correct
10 Correct 192 ms 1180 KB Output is correct
11 Correct 160 ms 1204 KB Output is correct
12 Correct 203 ms 1380 KB Output is correct
13 Correct 208 ms 1164 KB Output is correct
14 Correct 239 ms 1132 KB Output is correct
15 Correct 171 ms 1144 KB Output is correct
16 Correct 206 ms 1196 KB Output is correct

Subtask #3
10.0 / 10.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
9 Correct 1 ms 208 KB Output is correct

Subtask #4
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 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
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 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 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct

Subtask #5
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 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
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 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 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 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 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 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 1 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 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 1 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 1 ms 208 KB Output is correct
50 Correct 1 ms 208 KB Output is correct

Subtask #6
20.0 / 20.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
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 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 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 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 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 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 312 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 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 1 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 1 ms 208 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 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
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 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 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 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 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 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 1 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 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 1 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 1 ms 208 KB Output is correct
50 Correct 1 ms 208 KB Output is correct
51 Correct 1 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 1 ms 208 KB Output is correct
57 Correct 1 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 0 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 1 ms 312 KB Output is correct
64 Correct 1 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 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 1 ms 208 KB Output is correct
73 Correct 1 ms 208 KB Output is correct
74 Correct 1 ms 208 KB Output is correct
75 Correct 1 ms 208 KB Output is correct
76 Correct 2 ms 336 KB Output is correct
77 Correct 9 ms 328 KB Output is correct
78 Correct 8 ms 336 KB Output is correct
79 Correct 8 ms 324 KB Output is correct
80 Correct 8 ms 336 KB Output is correct
81 Correct 10 ms 336 KB Output is correct
82 Correct 6 ms 316 KB Output is correct
83 Correct 10 ms 316 KB Output is correct
84 Correct 168 ms 1184 KB Output is correct
85 Correct 130 ms 1168 KB Output is correct
86 Correct 190 ms 1256 KB Output is correct
87 Correct 201 ms 1188 KB Output is correct
88 Correct 222 ms 1168 KB Output is correct
89 Correct 216 ms 1192 KB Output is correct
90 Correct 213 ms 1192 KB Output is correct
91 Correct 161 ms 1228 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 208 KB Output is correct
101 Correct 1 ms 208 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 1 ms 208 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 1 ms 208 KB Output is correct
107 Correct 0 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 1 ms 208 KB Output is correct
111 Correct 1 ms 208 KB Output is correct
112 Correct 1 ms 208 KB Output is correct
113 Correct 1 ms 208 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 1 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 1 ms 208 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct
124 Correct 1 ms 208 KB Output is correct
125 Correct 1 ms 208 KB Output is correct
126 Correct 1 ms 208 KB Output is correct
127 Correct 1 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 208 KB Output is correct
131 Correct 1 ms 208 KB Output is correct
132 Correct 1 ms 208 KB Output is correct
133 Correct 1 ms 208 KB Output is correct
134 Correct 1 ms 208 KB Output is correct
135 Correct 1 ms 208 KB Output is correct