oj.uz

Submission #646689

# Submission time Handle Problem Language Result Execution time Memory
646689 2022-09-30T11:48:27 Z beaconmc A Difficult(y) Choice (BOI21_books) C++14
100 / 100
 1 ms 352 KB 
#include <bits/stdc++.h>

#include "books.h"



typedef long long ll;
using namespace std;


#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)

#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)



//
// --- 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.
//

ll n,k,a,s;
map<ll,ll> cache;

ll skimm(ll x){
    if (cache[x] != 0) return cache[x];
    else{
        cache[x] = skim(x);
        return cache[x];
    }

}

bool query(ll x){
    ll sus = skimm(x);


    if (sus*k + k*(k-1)/2 > 2*a){
        return true;
    }
    return false;
}




void solve(int N, int K, long long A, int S) {
    n = N;
    k = K;
    a = A;
    s = S;


    ll lo = 1;
    ll hi = n;

    while (lo<hi){
        ll mid = lo + (hi - lo) / 2;
        if (query(mid)){
            hi = mid;
        }else{
            lo = mid+1;
        }
    }
    vector<ll> sus;
    ll mini = max(ll(1), lo-k);




    FOR(i,lo-k, lo+k-1){
        if (0<i && i<=n){
            sus.push_back(skimm(i));
        }
    }





    FOR(i,0,sus.size()-k+1){
        ll suss = 0;
        FOR(j,i,i+k){
            suss += sus[j];
        }
        if (A <= suss && suss <= 2*A){
            vector<int> ans;

            FOR(p,i,i+k){
                ans.push_back(p+mini);
            }
            answer(ans);
            return;


        }
    }
    ll realsus = 0;

    FOR(i,1,k){
        realsus += skimm(i);
    }
    FOR(i,0,sus.size()){
        if (a<= realsus+sus[i] && realsus+sus[i] <= 2*a){
            vector<int> ans;
            FOR(j,1,k){
                ans.push_back(j);
            }
            ans.push_back(i+mini);
            answer(ans);
            return;
        }
    }




    impossible();


}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:11:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'long long unsigned int' [-Wsign-compare]
   11 | #define FOR(i, x, y) for(ll i=x; i<y; i++)
......
   87 |     FOR(i,0,sus.size()-k+1){
      |         ~~~~~~~~~~~~~~~~~~         
books.cpp:87:5: note: in expansion of macro 'FOR'
   87 |     FOR(i,0,sus.size()-k+1){
      |     ^~~
books.cpp:11:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define FOR(i, x, y) for(ll i=x; i<y; i++)
......
  109 |     FOR(i,0,sus.size()){
      |         ~~~~~~~~~~~~~~             
books.cpp:109:5: note: in expansion of macro 'FOR'
  109 |     FOR(i,0,sus.size()){
      |     ^~~

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 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 0 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 336 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 300 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 304 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 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 0 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 300 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 0 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 300 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 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 300 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 304 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 300 KB Output is correct
48 Correct 1 ms 300 KB Output is correct
49 Correct 1 ms 208 KB Output is correct
50 Correct 1 ms 352 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 0 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 300 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 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 288 KB Output is correct
36 Correct 1 ms 280 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 1 ms 284 KB Output is correct
39 Correct 1 ms 280 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 1 ms 300 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 300 KB Output is correct
47 Correct 1 ms 208 KB Output is correct
48 Correct 1 ms 300 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 1 ms 300 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 0 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 300 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 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 300 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 304 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 300 KB Output is correct
48 Correct 1 ms 300 KB Output is correct
49 Correct 1 ms 208 KB Output is correct
50 Correct 1 ms 352 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 1 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 1 ms 288 KB Output is correct
61 Correct 1 ms 280 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 1 ms 284 KB Output is correct
64 Correct 1 ms 280 KB Output is correct
65 Correct 1 ms 304 KB Output is correct
66 Correct 1 ms 300 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 300 KB Output is correct
72 Correct 1 ms 208 KB Output is correct
73 Correct 1 ms 300 KB Output is correct
74 Correct 1 ms 300 KB Output is correct
75 Correct 1 ms 300 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 1 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 0 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 0 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 1 ms 284 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 1 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 292 KB Output is correct
102 Correct 1 ms 300 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 1 ms 304 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 288 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 328 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 1 ms 300 KB Output is correct
116 Correct 1 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 0 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 296 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 304 KB Output is correct
135 Correct 1 ms 300 KB Output is correct