oj.uz

Submission #987244

# Submission time Handle Problem Language Result Execution time Memory
987244 2024-05-22T12:22:58 Z VMaksimoski008 A Difficult(y) Choice (BOI21_books) C++17
45 / 100
 2 ms 924 KB 
#include <bits/stdc++.h>
#include "books.h"

using namespace std;
using ll = long long;
using ull = unsigned long long;

map<int, ll> memo;

ll ask(int p) {
    if(memo.count(p)) return memo[p];
    return memo[p] = skim(p);
}

void solve(int N, int K, ll A, int S) {
    // if(N == S) {
    //     vector<ull> v = { 0 };
    //     for(int i=1; i<=N; i++) v.push_back(skim(i));

    //     ull sum1 = 0;
    //     for(int i=1; i<=K; i++) sum1 += v[i];

    //     if(sum1 >= A && sum1 <= 2 * A) {
    //         vector<int> ans;
    //         for(int i=1; i<=K; i++) ans.push_back(i);
    //         answer(ans);
    //     }

    //     for(int i=2; i+K-1<=N; i++) {
    //         sum1 -= v[i-1];
    //         sum1 += v[i+K-1];
    //         if(sum1 > 2 * A) break;

    //         if(sum1 >= A && sum1 <= 2 * A) {
    //             vector<int> ans;
    //             for(int j=i; j<=i+K-1; j++) ans.push_back(j);
    //             answer(ans);
    //         }
    //     }

    //     for(int i=K; i<=N; i++) {
    //         if(v[i] >= A) {
    //             ll sum = 0;
    //             for(int j=1; j<=K-1; j++) sum += v[j];
    //             if(sum + v[i] >= A && sum + v[i] <= 2 * A) {
    //                 vector<int> ans;
    //                 for(int j=1; j<=K-1; j++) ans.push_back(j);
    //                 ans.push_back(i);
    //                 answer(ans);
    //             }
    //             break;
    //         }
    //     }

    //     impossible();
    //     return ;
    // }

    //sub 3
    int l=1, r=N-K+1;
    while(l <= r) {
        int mid = (l + r) / 2;
        ll sum = 0;
        for(int i=mid; i<=mid+K-1; i++) sum += ask(i);

        if(sum >= A && sum <= 2 * A) {
            vector<int> ans;
            for(int i=mid; i<=mid+K-1; i++) ans.push_back(i);
            answer(ans);
        }

        if(sum < A) l = mid + 1;
        if(sum > 2 * A) r = mid - 1;
    }

    l=K, r=N-K+1;
    int p = -1;

    while(l <= r) {
        int mid = (l + r) / 2;
        if(ask(mid) >= A) p = mid, r = mid - 1;
        else l = mid + 1;
    }

    if(p != -1) {
        ll sum = ask(p);
        for(int i=1; i<=K-1; i++) sum += ask(i);
        if(sum >= A && sum <= 2 * A) {
            vector<int> ans;
            for(int i=1; i<=K-1; i++) ans.push_back(i);
            ans.push_back(p);
            answer(ans);
        }
    }
    
    impossible();
    return ;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 540 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 420 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 436 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 692 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 2 ms 856 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 540 KB Output is correct
37 Correct 1 ms 924 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 2 ms 440 KB Output is correct
40 Correct 1 ms 432 KB Output is correct
41 Correct 2 ms 436 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Runtime error 1 ms 596 KB Execution killed with signal 13
44 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

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