oj.uz

Submission #712021

# Submission time Handle Problem Language Result Execution time Memory
712021 2023-03-18T01:36:04 Z nicky4321 A Difficult(y) Choice (BOI21_books) C++14
100 / 100
 71 ms 432 KB 
#include <bits/stdc++.h>
#include "books.h"
#define ll long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ALL(x) x.begin(), x.end()
#define vi vector<int>
#define vl vector<ll>
#define SZ(x) (int)x.size()
#define CASE int t;cin>>t;for(int ca=1;ca<=t;ca++)
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
const int MAX = 1 << 20, MOD = 1e9 + 7;
ll a[MAX], asked[MAX];

// int skim(int x){
//     cout << x << " ";
//     int res;
//     cin >> res;
//     return res;
// }

// void answer(vi v){
//     for(int i : v)
//         cout << i << " ";
//     cout << '\n';
// }

// void impossible(){
//     cout << "impossible\n";
// }

ll ask(int x){
    if(asked[x])
        return a[x];
    asked[x] = 1;
    a[x] = skim(x);
    return a[x];
}

void solve(int n, int k, ll A, int s){
    ll tmp = A;
    int l = 1, r = n;
    while(l < r){
        int mid = (r - l) / 2 + l;
        if(ask(mid) <= tmp)
            l = mid + 1;
        else
            r = mid;
    }
    if(ask(l) <= tmp)
        l++;
    vi v;
    ll sum = 0;
    for(int i = 1;i <= k;i++){
        v.PB(i);
        sum += ask(i);
    }
    if(l <= n){
        sum -= a[k];
        sum += a[l];
        if(A <= sum && sum <= 2 * A){
            v.pop_back();
            v.PB(l);
            answer(v);
            return;
        }
        sum += a[k];
        sum -= a[l];
    }
    for(int i = max(1, l - k);i <= l - 1;i++){
        if(v.back() < i)
            v.PB(i);
        ask(i);
    }
    int base = SZ(v);
    for(int i = 0;i < (1 << base);i++){
        int cnt = 0;
        sum = 0;
        for(int j = 0;j < base;j++){
            if(i >> j & 1){
                cnt++;
                sum += ask(v[j]);
            }
        }
        if(cnt != k)
            continue;
        if(A <= sum && sum <= 2 * A){
            vi ans;
            for(int j = 0;j < base;j++){
                if(i >> j & 1)
                    ans.PB(v[j]);
            }
            sort(ALL(ans));
            answer(ans);
            return;
        }
    }
    impossible();
}

// int main(){
//     IOS
//     // CASE
//         solve(15, 3, 8, 40);
//     return 0;
// }

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 308 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 0 ms 208 KB Output is correct
2 Correct 1 ms 308 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 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 62 ms 336 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 64 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 65 ms 296 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 62 ms 328 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 304 KB Output is correct

Subtask #5
15.0 / 15.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 65 ms 296 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 62 ms 328 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 62 ms 292 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 296 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 308 KB Output is correct
43 Correct 1 ms 300 KB Output is correct
44 Correct 1 ms 300 KB Output is correct
45 Correct 1 ms 296 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 5 ms 300 KB Output is correct
48 Correct 1 ms 300 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 63 ms 300 KB Output is correct
51 Correct 1 ms 304 KB Output is correct
52 Correct 1 ms 300 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 328 KB Output is correct
55 Correct 1 ms 300 KB Output is correct
56 Correct 1 ms 292 KB Output is correct
57 Correct 1 ms 308 KB Output is correct
58 Correct 62 ms 300 KB Output is correct
59 Correct 1 ms 300 KB Output is correct
60 Correct 1 ms 300 KB Output is correct
61 Correct 1 ms 300 KB Output is correct
62 Correct 1 ms 328 KB Output is correct
63 Correct 1 ms 296 KB Output is correct
64 Correct 1 ms 320 KB Output is correct
65 Correct 1 ms 308 KB Output is correct
66 Correct 1 ms 312 KB Output is correct
67 Correct 1 ms 304 KB Output is correct
68 Correct 1 ms 300 KB Output is correct
69 Correct 1 ms 300 KB Output is correct
70 Correct 1 ms 300 KB Output is correct
71 Correct 1 ms 296 KB Output is correct
72 Correct 69 ms 292 KB Output is correct
73 Correct 1 ms 304 KB Output is correct
74 Correct 1 ms 312 KB Output is correct
75 Correct 1 ms 304 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 336 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 3 ms 336 KB Output is correct
87 Correct 71 ms 312 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 1 ms 336 KB Output is correct
91 Correct 64 ms 336 KB Output is correct
92 Correct 1 ms 308 KB Output is correct
93 Correct 1 ms 328 KB Output is correct
94 Correct 1 ms 292 KB Output is correct
95 Correct 1 ms 328 KB Output is correct
96 Correct 1 ms 296 KB Output is correct
97 Correct 1 ms 300 KB Output is correct
98 Correct 1 ms 328 KB Output is correct
99 Correct 64 ms 300 KB Output is correct
100 Correct 1 ms 304 KB Output is correct
101 Correct 1 ms 308 KB Output is correct
102 Correct 1 ms 296 KB Output is correct
103 Correct 1 ms 296 KB Output is correct
104 Correct 1 ms 296 KB Output is correct
105 Correct 1 ms 292 KB Output is correct
106 Correct 1 ms 292 KB Output is correct
107 Correct 1 ms 296 KB Output is correct
108 Correct 1 ms 300 KB Output is correct
109 Correct 1 ms 328 KB Output is correct
110 Correct 1 ms 308 KB Output is correct
111 Correct 1 ms 308 KB Output is correct
112 Correct 1 ms 304 KB Output is correct
113 Correct 4 ms 328 KB Output is correct
114 Correct 1 ms 300 KB Output is correct
115 Correct 1 ms 308 KB Output is correct
116 Correct 65 ms 308 KB Output is correct
117 Correct 1 ms 304 KB Output is correct
118 Correct 1 ms 308 KB Output is correct
119 Correct 1 ms 300 KB Output is correct
120 Correct 1 ms 296 KB Output is correct
121 Correct 1 ms 312 KB Output is correct
122 Correct 67 ms 328 KB Output is correct
123 Correct 1 ms 312 KB Output is correct
124 Correct 1 ms 296 KB Output is correct
125 Correct 1 ms 328 KB Output is correct
126 Correct 1 ms 292 KB Output is correct
127 Correct 1 ms 292 KB Output is correct
128 Correct 1 ms 292 KB Output is correct
129 Correct 1 ms 328 KB Output is correct
130 Correct 6 ms 308 KB Output is correct
131 Correct 64 ms 308 KB Output is correct
132 Correct 1 ms 328 KB Output is correct
133 Correct 1 ms 432 KB Output is correct
134 Correct 1 ms 328 KB Output is correct
135 Correct 63 ms 300 KB Output is correct