oj.uz

Submission #976122

# Submission time Handle Problem Language Result Execution time Memory
976122 2024-05-06T07:54:10 Z Circling A Difficult(y) Choice (BOI21_books) C++17
60 / 100
 2 ms 1436 KB 
/*The British Royal Family and a small cadre of English Fabian Socialists, in
conjunction with the Rockefellers and the Rothchilds, are engaged in a
conspiracy to greatly reduce the population of the human race in order to head
off a Malthusian catastrophe, a catastrophe that could easily be avoided by
simply building a massive amount of nuclear power plants and a number of massive
superhighways and bridges to connect all of the world's continents. But doing
that would cut into the conspiracy's profits. So the British Royal Family
invented environmentalism and neoliberalism in order to hide the truth. And in
order to further reduce the population, the British Royal Family is also the
world's foremost drug trafficking conspiracy. And it uses its control of the IMF
to push austerity in order to kill as many people in the global south as
possible.
And also Henry Kissinger is a gay KGB agent. */
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>

#include "books.h"
using namespace std;

long long arr[100001];


long long wiseskim(int i){
    if (arr[i] == -1) arr[i] = skim(i);
    return arr[i];
}


void solve(int n, int k, long long a, int s){
    for (int i = 1; i <= n; i++) arr[i] = -1;
    vector<int> solution;
    if (k * wiseskim(1) + k * (k - 1) / 2 > 2 * a){
        impossible();
        return;
    }
    int lastbelowa = 0;
    for (int i = 16; i >= 0; i--) if (lastbelowa + (1 << i) <= n && wiseskim(lastbelowa + (1 << i)) < a) lastbelowa += 1 << i;
    if (lastbelowa < k){
        impossible();
        return;
    }
    long long sum;
    if (lastbelowa < n){
        sum = wiseskim(lastbelowa + 1);
        for (int i = 1; i < k; i++) sum += wiseskim(i);
        if (sum <= 2 * a){
            for (int i = 1; i < k; i++) solution.push_back(i);
            solution.push_back(lastbelowa + 1);
            answer(solution);
            return;
        }
    }
    sum = 0;
    solution.clear();
    for (int i = 1; i <= k; i++){
        solution.push_back(i);
        sum += wiseskim(i);
    }
    if (sum > 2 * a){
        impossible();
        return;
    }
    if (sum >= a){
        answer(solution);
        return;
    }
    for (int i = 1; i <= k; i++){
        sum += wiseskim(lastbelowa + 1 - i) - wiseskim(k + 1 - i);
        solution[k - i] = lastbelowa + 1 - i;
        if (sum >= a){
            answer(solution);
            return;
        }
    }
    impossible();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Incorrect
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Incorrect
6 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
15.0 / 15.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 2 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1208 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1272 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1368 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1212 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1120 KB Output is correct
23 Correct 1 ms 1112 KB Output is correct
24 Correct 1 ms 1368 KB Output is correct
25 Correct 1 ms 1112 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 1 ms 1368 KB Output is correct
31 Correct 1 ms 1112 KB Output is correct
32 Correct 1 ms 1368 KB Output is correct
33 Correct 1 ms 1112 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 1 ms 1112 KB Output is correct
36 Correct 1 ms 1368 KB Output is correct
37 Correct 1 ms 1268 KB Output is correct
38 Correct 1 ms 1112 KB Output is correct
39 Correct 1 ms 1112 KB Output is correct
40 Correct 1 ms 1368 KB Output is correct
41 Correct 1 ms 1112 KB Output is correct
42 Correct 1 ms 1112 KB Output is correct
43 Correct 1 ms 1112 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 1 ms 1112 KB Output is correct
46 Correct 1 ms 1112 KB Output is correct
47 Correct 1 ms 1112 KB Output is correct
48 Correct 1 ms 1112 KB Output is correct
49 Correct 2 ms 1112 KB Output is correct
50 Correct 1 ms 1112 KB Output is correct
51 Correct 1 ms 1112 KB Output is correct
52 Correct 1 ms 1112 KB Output is correct
53 Correct 1 ms 1112 KB Output is correct
54 Correct 1 ms 1208 KB Output is correct
55 Correct 1 ms 1112 KB Output is correct
56 Correct 1 ms 1112 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 1 ms 1112 KB Output is correct
59 Correct 1 ms 1112 KB Output is correct
60 Correct 1 ms 1112 KB Output is correct
61 Correct 1 ms 1368 KB Output is correct
62 Correct 1 ms 1112 KB Output is correct
63 Correct 1 ms 1368 KB Output is correct
64 Correct 1 ms 1112 KB Output is correct
65 Correct 1 ms 1112 KB Output is correct
66 Correct 1 ms 1368 KB Output is correct
67 Correct 1 ms 1112 KB Output is correct
68 Correct 1 ms 1368 KB Output is correct
69 Correct 1 ms 1112 KB Output is correct
70 Correct 1 ms 1436 KB Output is correct
71 Correct 1 ms 1112 KB Output is correct
72 Correct 1 ms 1112 KB Output is correct
73 Correct 2 ms 1112 KB Output is correct
74 Correct 1 ms 1112 KB Output is correct
75 Correct 1 ms 1112 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Incorrect 0 ms 344 KB Incorrect
81 Halted 0 ms 0 KB -