oj.uz

Submission #532814

# Submission time Handle Problem Language Result Execution time Memory
532814 2022-03-04T02:29:44 Z safaricola A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 2 ms 1096 KB 
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
//
// --- 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) {
    // TODO implement this function
    int count=0;
    ll b[N+5];
    memset(b,0,sizeof(b));
    int low = 0, high = N + 1;
    while(high - low >= 2)
    {
        int mid = (high + low) / 2;
        count++;
        assert(count<S);
        b[mid]=skim(mid);
        if(b[mid] < A) low = mid;
        else high = mid;
    }
    ll a[K+5];
    memset(a,0,sizeof(a));
    //cout<<low<<endl;
    high=low;
    //if(high<=K-2)impossible();
    for(int i=1; i<=K; i++){
        if(!b[i]){
            count++;
            assert(count<S);
            b[i]=skim(i);
        }
        a[i]=a[i-1]+b[i];
    }
    ll c[K+5];
    memset(c,0, sizeof(c));
    for(int i=high; i>=max(high-K+1,1); i--){
        if(!b[i]){
            count++;
            assert(count<S);
            b[i]=skim(i);
        }
        c[high-i+1]=c[high-i]+b[i];
    }
    //for(int i=1; i<=K; i++)cout<<c[i]<<" ";
    //    cout<<endl;
    if(high<N && !b[high+1]){
            count++;
            assert(count<S);
            b[high+1]=skim(high+1);
    }
    if(high<N && b[high+1]+a[K-1]<=2*A){
        vector<int> v;
        for(int i=1; i<=K-1; i++){
            v.push_back(i);
        }
        v.push_back(high+1);
        answer(v);
    }else{
        for(int i=0; i<=K;i++){
            //printf("i=%d, sum=%lld \n", i,a[i]+c[K-i]);
            if(a[i]+c[K-i]>=A && a[i]+c[K-i]<=2*A){
                vector<int> v;
                for(int j=1; j<=i; j++){
                    v.push_back(j);
                }
                for(int j=0; j<K-i; j++){
                    v.push_back(high-j);
                }
                answer(v);
            }
        }
    }
    impossible();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 456 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
15.0 / 15.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 968 KB Output is correct
2 Correct 2 ms 968 KB Output is correct
3 Correct 2 ms 968 KB Output is correct
4 Correct 1 ms 968 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 968 KB Output is correct
7 Correct 1 ms 968 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 1 ms 968 KB Output is correct
11 Correct 2 ms 968 KB Output is correct
12 Correct 2 ms 968 KB Output is correct
13 Correct 1 ms 968 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 1 ms 968 KB Output is correct
16 Correct 2 ms 968 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 968 KB Output is correct
19 Correct 1 ms 968 KB Output is correct
20 Correct 1 ms 968 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 968 KB Output is correct
23 Correct 1 ms 968 KB Output is correct
24 Correct 1 ms 968 KB Output is correct
25 Correct 1 ms 968 KB Output is correct
26 Correct 1 ms 968 KB Output is correct
27 Correct 1 ms 968 KB Output is correct
28 Correct 1 ms 968 KB Output is correct
29 Correct 1 ms 968 KB Output is correct
30 Correct 1 ms 968 KB Output is correct
31 Correct 1 ms 968 KB Output is correct
32 Correct 1 ms 968 KB Output is correct
33 Correct 1 ms 968 KB Output is correct
34 Correct 1 ms 968 KB Output is correct
35 Correct 1 ms 968 KB Output is correct
36 Correct 2 ms 1076 KB Output is correct
37 Correct 1 ms 968 KB Output is correct
38 Correct 1 ms 968 KB Output is correct
39 Correct 1 ms 968 KB Output is correct
40 Correct 2 ms 968 KB Output is correct
41 Correct 2 ms 968 KB Output is correct
42 Correct 1 ms 968 KB Output is correct
43 Correct 1 ms 968 KB Output is correct
44 Correct 1 ms 968 KB Output is correct
45 Correct 1 ms 968 KB Output is correct
46 Correct 1 ms 968 KB Output is correct
47 Correct 1 ms 1032 KB Output is correct
48 Correct 1 ms 968 KB Output is correct
49 Correct 1 ms 968 KB Output is correct
50 Correct 1 ms 1028 KB Output is correct
51 Correct 1 ms 968 KB Output is correct
52 Correct 1 ms 968 KB Output is correct
53 Correct 1 ms 968 KB Output is correct
54 Correct 1 ms 968 KB Output is correct
55 Correct 1 ms 968 KB Output is correct
56 Correct 1 ms 968 KB Output is correct
57 Correct 1 ms 968 KB Output is correct
58 Correct 1 ms 968 KB Output is correct
59 Correct 1 ms 968 KB Output is correct
60 Correct 1 ms 1088 KB Output is correct
61 Correct 2 ms 968 KB Output is correct
62 Correct 2 ms 968 KB Output is correct
63 Correct 1 ms 968 KB Output is correct
64 Correct 1 ms 968 KB Output is correct
65 Correct 1 ms 968 KB Output is correct
66 Correct 1 ms 1088 KB Output is correct
67 Correct 1 ms 968 KB Output is correct
68 Correct 1 ms 968 KB Output is correct
69 Correct 1 ms 968 KB Output is correct
70 Correct 2 ms 968 KB Output is correct
71 Correct 1 ms 968 KB Output is correct
72 Correct 1 ms 968 KB Output is correct
73 Correct 1 ms 968 KB Output is correct
74 Correct 1 ms 968 KB Output is correct
75 Correct 1 ms 968 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 1 ms 284 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 412 KB Output is correct
85 Correct 1 ms 416 KB Output is correct
86 Correct 1 ms 456 KB Output is correct
87 Correct 1 ms 456 KB Output is correct
88 Correct 1 ms 456 KB Output is correct
89 Correct 1 ms 412 KB Output is correct
90 Correct 1 ms 456 KB Output is correct
91 Correct 1 ms 456 KB Output is correct
92 Correct 1 ms 1056 KB Output is correct
93 Correct 2 ms 968 KB Output is correct
94 Correct 2 ms 1052 KB Output is correct
95 Correct 1 ms 968 KB Output is correct
96 Correct 1 ms 1040 KB Output is correct
97 Correct 1 ms 968 KB Output is correct
98 Correct 1 ms 1048 KB Output is correct
99 Correct 2 ms 968 KB Output is correct
100 Correct 1 ms 968 KB Output is correct
101 Correct 2 ms 1052 KB Output is correct
102 Correct 1 ms 1032 KB Output is correct
103 Correct 2 ms 1040 KB Output is correct
104 Correct 1 ms 1052 KB Output is correct
105 Correct 1 ms 1048 KB Output is correct
106 Correct 2 ms 968 KB Output is correct
107 Correct 1 ms 968 KB Output is correct
108 Correct 1 ms 1052 KB Output is correct
109 Correct 1 ms 1044 KB Output is correct
110 Correct 1 ms 1048 KB Output is correct
111 Correct 1 ms 1048 KB Output is correct
112 Correct 2 ms 968 KB Output is correct
113 Correct 1 ms 1052 KB Output is correct
114 Correct 1 ms 968 KB Output is correct
115 Correct 1 ms 968 KB Output is correct
116 Correct 1 ms 968 KB Output is correct
117 Correct 1 ms 968 KB Output is correct
118 Correct 1 ms 1052 KB Output is correct
119 Correct 1 ms 968 KB Output is correct
120 Correct 1 ms 968 KB Output is correct
121 Correct 2 ms 1052 KB Output is correct
122 Correct 1 ms 1036 KB Output is correct
123 Correct 1 ms 1056 KB Output is correct
124 Correct 1 ms 968 KB Output is correct
125 Correct 1 ms 968 KB Output is correct
126 Correct 1 ms 1028 KB Output is correct
127 Correct 2 ms 1048 KB Output is correct
128 Correct 2 ms 972 KB Output is correct
129 Correct 1 ms 968 KB Output is correct
130 Correct 1 ms 1044 KB Output is correct
131 Correct 2 ms 1052 KB Output is correct
132 Correct 1 ms 1096 KB Output is correct
133 Correct 1 ms 968 KB Output is correct
134 Correct 2 ms 1056 KB Output is correct
135 Correct 1 ms 1060 KB Output is correct