oj.uz

답안 #1001001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001001 2024-06-18T12:34:43 Z amine_aroua A Difficult(y) Choice (BOI21_books) C++17
60 / 100
 2 ms 2016 KB 
#include <bits/stdc++.h>
using namespace std;
#define intt long long
#define forr(i , x , y) for(int i = x ;i <= y;i++)
#define pb push_back
#define fore(i , n) for(int i = 0 ; i <n;i++)
/**
 * skims through the i-th book and returns its difficulty x_i (1 <= i <= N).
 */
long long skim(int);

/**
 * buys your selection of books. This function has to be called with
 * v = {i_1, ..., i_K} (1 <= i_1, ..., i_K <= N) where the i_j's are pairwise
 * distinct and satisfy A <= x_{i_1} + ... + x_{i_K} <= 2 A.
 */
void answer(std::vector<int>);

/**
 * states that it is impossible to buy a set of K books with the desired difficulty.
 */
void impossible();
intt get(int i , vector<intt> &x)
{
    if(x[i] == -1)
        return x[i] = skim(i);
    return x[i];
}
void solve(int n, int k, long long a, int s)
{
    vector<intt> x(n + 1 , -1);
    vector<intt> pref(n + 1);
    vector<int> ans;
    forr(i , 1 , k - 1)
    {
        pref[i] = pref[i - 1] + get(i , x);
    }
    if(pref[k - 1] + get(k , x) > 2ll * a)
    {
        impossible();
    }
    int l = 0 , r = n;
    while(l + 1 < r)
    {
        int mid = (l + r)/2;
        if(get(mid , x) >= a)
        {
            r = mid;
        }
        else
            l = mid;
    }
    if(get(r , x) >= a && r >= k && get(r , x) + pref[k - 1] <= 2ll*a)
    {
        forr(i , 1, k - 1)
            ans.pb(i);
        ans.pb(r);
        answer(ans);
        return ;
    }
    int lo = k, hi = r;
    while(lo + 1 < hi)
    {
        int mid = (lo + hi)/2;
        intt sm= 0;
        forr(i , mid - k + 1 , mid)
            sm+=get(i , x);
        if(a <= sm && sm <= 2ll * a)
        {
            forr(i , mid - k + 1 , mid)
                ans.pb(i);
            answer(ans);
            return;
        }
        if(sm > 2ll * a)
        {
            hi = mid;
        }
        if(sm < a)
            lo = mid;
    }
    intt sm = 0;
    forr(i , lo - k +1 , lo)
    {
        sm+=get(i , x);
    }
    if(a <= sm && sm <= 2ll * a)
    {
        forr(i , lo - k +1 , lo)
            ans.pb(i);
        answer(ans);
        return ;
    }
    sm = 0;
    forr(i , hi - k +1 , hi)
    {
        sm+=get(i , x);
    }
    if(a <= sm && sm <= 2ll * a)
    {
        forr(i , hi - k +1 , hi)
            ans.pb(i);
        answer(ans);
        return ;
    }
    impossible();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 816 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 600 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 2 ms 1784 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 1 ms 1880 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 2 ms 1784 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 1 ms 1880 KB Output is correct
26 Correct 1 ms 1880 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 1 ms 1880 KB Output is correct
29 Correct 1 ms 1964 KB Output is correct
30 Correct 1 ms 1880 KB Output is correct
31 Correct 1 ms 1968 KB Output is correct
32 Correct 1 ms 1964 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 2 ms 1880 KB Output is correct
35 Correct 1 ms 1880 KB Output is correct
36 Correct 1 ms 1880 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 1 ms 1880 KB Output is correct
39 Correct 1 ms 1880 KB Output is correct
40 Correct 1 ms 1880 KB Output is correct
41 Correct 1 ms 1880 KB Output is correct
42 Correct 1 ms 1880 KB Output is correct
43 Correct 1 ms 1880 KB Output is correct
44 Correct 1 ms 1880 KB Output is correct
45 Correct 1 ms 1880 KB Output is correct
46 Correct 1 ms 1880 KB Output is correct
47 Correct 1 ms 1880 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1880 KB Output is correct
50 Correct 1 ms 1880 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 2 ms 1784 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 1 ms 1880 KB Output is correct
26 Correct 1 ms 1880 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 1 ms 1880 KB Output is correct
29 Correct 1 ms 1880 KB Output is correct
30 Correct 1 ms 1880 KB Output is correct
31 Correct 1 ms 1880 KB Output is correct
32 Correct 2 ms 1880 KB Output is correct
33 Correct 2 ms 1880 KB Output is correct
34 Correct 1 ms 1964 KB Output is correct
35 Correct 1 ms 1880 KB Output is correct
36 Correct 1 ms 1880 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 1 ms 1960 KB Output is correct
39 Correct 1 ms 1880 KB Output is correct
40 Correct 1 ms 1880 KB Output is correct
41 Correct 1 ms 1880 KB Output is correct
42 Correct 1 ms 1812 KB Output is correct
43 Correct 1 ms 1880 KB Output is correct
44 Correct 1 ms 1964 KB Output is correct
45 Correct 1 ms 1880 KB Output is correct
46 Runtime error 1 ms 2016 KB Execution killed with signal 13
47 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 2 ms 1784 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 1 ms 1880 KB Output is correct
26 Correct 1 ms 1880 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 1 ms 1880 KB Output is correct
29 Correct 1 ms 1964 KB Output is correct
30 Correct 1 ms 1880 KB Output is correct
31 Correct 1 ms 1968 KB Output is correct
32 Correct 1 ms 1964 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 2 ms 1880 KB Output is correct
35 Correct 1 ms 1880 KB Output is correct
36 Correct 1 ms 1880 KB Output is correct
37 Correct 1 ms 1880 KB Output is correct
38 Correct 1 ms 1880 KB Output is correct
39 Correct 1 ms 1880 KB Output is correct
40 Correct 1 ms 1880 KB Output is correct
41 Correct 1 ms 1880 KB Output is correct
42 Correct 1 ms 1880 KB Output is correct
43 Correct 1 ms 1880 KB Output is correct
44 Correct 1 ms 1880 KB Output is correct
45 Correct 1 ms 1880 KB Output is correct
46 Correct 1 ms 1880 KB Output is correct
47 Correct 1 ms 1880 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1880 KB Output is correct
50 Correct 1 ms 1880 KB Output is correct
51 Correct 1 ms 1880 KB Output is correct
52 Correct 1 ms 1880 KB Output is correct
53 Correct 1 ms 1880 KB Output is correct
54 Correct 1 ms 1880 KB Output is correct
55 Correct 1 ms 1880 KB Output is correct
56 Correct 1 ms 1880 KB Output is correct
57 Correct 2 ms 1880 KB Output is correct
58 Correct 2 ms 1880 KB Output is correct
59 Correct 1 ms 1964 KB Output is correct
60 Correct 1 ms 1880 KB Output is correct
61 Correct 1 ms 1880 KB Output is correct
62 Correct 1 ms 1880 KB Output is correct
63 Correct 1 ms 1960 KB Output is correct
64 Correct 1 ms 1880 KB Output is correct
65 Correct 1 ms 1880 KB Output is correct
66 Correct 1 ms 1880 KB Output is correct
67 Correct 1 ms 1812 KB Output is correct
68 Correct 1 ms 1880 KB Output is correct
69 Correct 1 ms 1964 KB Output is correct
70 Correct 1 ms 1880 KB Output is correct
71 Runtime error 1 ms 2016 KB Execution killed with signal 13
72 Halted 0 ms 0 KB -