oj.uz

답안 #577828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577828 2022-06-15T09:41:07 Z patrikpavic2 Uplifting Excursion (BOI22_vault) C++17
30 / 100
 527 ms 368 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

const int M = 102;
const int GR = M * M;
const int INF = 0x3f3f3f3f;

int m;
ll L, A[M], kol;
int dp[2 * GR];

int main(){
    scanf("%d%lld", &m, &L);
    for(int i = m;i >= 1;i--){
        ll x; scanf("%lld", &x);
      //  A[i] += x; L += x * i;
    }
    ll bla; scanf("%lld", &bla);
    for(int i = 1;i <= m;i++){
        ll x; scanf("%lld", &x);
        A[i] += x;
    }
    ll L2 = 0;
    for(int i = 1;i <= m;i++){
        ll uz = min(A[i], max(L - GR, 0LL) / i);
        ll trb = M / i;
        if(A[i] - uz >= trb){
            kol += uz; L -= uz * i;
            A[i] -= uz;
        }
        else{
            L -= uz * i; kol += A[i] - min(A[i], trb);
            L2 += ((ll)min(A[i], trb) - A[i] + uz) * i;
            A[i] = min(A[i], trb);
        }
        A[i] = min((ll)2 * GR / i, A[i]);
    }
    L += L2;
    for(int i = 1;i < 2 * GR;i++)
        dp[i] = -INF;
    for(int i = 1;i <= m;i++){
        for(int j = 0;j < A[i];j++){
            for(int k = 2 * GR - 1;k >= i;k--)
                dp[k] = max(dp[k], 1 + dp[k - i]);
        }
    }
    if(L >= 2 * GR || dp[L] < 0)
        printf("impossible\n");
    else
        printf("%lld\n", kol + dp[L] + bla);
    return 0;
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d%lld", &m, &L);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
vault.cpp:19:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         ll x; scanf("%lld", &x);
      |               ~~~~~^~~~~~~~~~~~
vault.cpp:22:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     ll bla; scanf("%lld", &bla);
      |             ~~~~~^~~~~~~~~~~~~~
vault.cpp:24:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         ll x; scanf("%lld", &x);
      |               ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 14 ms 360 KB Output is correct
3 Correct 12 ms 360 KB Output is correct
4 Correct 139 ms 340 KB Output is correct
5 Correct 46 ms 340 KB Output is correct
6 Correct 429 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 14 ms 368 KB Output is correct
9 Correct 33 ms 340 KB Output is correct
10 Correct 16 ms 360 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 14 ms 360 KB Output is correct
3 Correct 12 ms 360 KB Output is correct
4 Correct 139 ms 340 KB Output is correct
5 Correct 46 ms 340 KB Output is correct
6 Correct 429 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 14 ms 368 KB Output is correct
9 Correct 33 ms 340 KB Output is correct
10 Correct 16 ms 360 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 14 ms 360 KB Output is correct
3 Correct 12 ms 360 KB Output is correct
4 Correct 139 ms 340 KB Output is correct
5 Correct 46 ms 340 KB Output is correct
6 Correct 429 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 14 ms 368 KB Output is correct
9 Correct 33 ms 340 KB Output is correct
10 Correct 16 ms 360 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 14 ms 364 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 140 ms 344 KB Output is correct
15 Correct 43 ms 340 KB Output is correct
16 Correct 419 ms 344 KB Output is correct
17 Correct 28 ms 340 KB Output is correct
18 Correct 13 ms 352 KB Output is correct
19 Correct 31 ms 344 KB Output is correct
20 Correct 16 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 11 ms 360 KB Output is correct
24 Correct 6 ms 340 KB Output is correct
25 Correct 18 ms 360 KB Output is correct
26 Correct 150 ms 344 KB Output is correct
27 Correct 395 ms 344 KB Output is correct
28 Correct 25 ms 340 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 14 ms 360 KB Output is correct
3 Correct 12 ms 360 KB Output is correct
4 Correct 139 ms 340 KB Output is correct
5 Correct 46 ms 340 KB Output is correct
6 Correct 429 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 14 ms 368 KB Output is correct
9 Correct 33 ms 340 KB Output is correct
10 Correct 16 ms 360 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 14 ms 364 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 140 ms 344 KB Output is correct
15 Correct 43 ms 340 KB Output is correct
16 Correct 419 ms 344 KB Output is correct
17 Correct 28 ms 340 KB Output is correct
18 Correct 13 ms 352 KB Output is correct
19 Correct 31 ms 344 KB Output is correct
20 Correct 16 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 11 ms 360 KB Output is correct
24 Correct 6 ms 340 KB Output is correct
25 Correct 18 ms 360 KB Output is correct
26 Correct 150 ms 344 KB Output is correct
27 Correct 395 ms 344 KB Output is correct
28 Correct 25 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 17 ms 360 KB Output is correct
31 Correct 7 ms 340 KB Output is correct
32 Correct 144 ms 344 KB Output is correct
33 Correct 48 ms 344 KB Output is correct
34 Correct 434 ms 340 KB Output is correct
35 Correct 28 ms 344 KB Output is correct
36 Correct 13 ms 360 KB Output is correct
37 Correct 28 ms 344 KB Output is correct
38 Correct 16 ms 364 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 11 ms 360 KB Output is correct
42 Correct 9 ms 364 KB Output is correct
43 Correct 17 ms 364 KB Output is correct
44 Correct 134 ms 344 KB Output is correct
45 Correct 384 ms 348 KB Output is correct
46 Correct 19 ms 340 KB Output is correct
47 Correct 4 ms 340 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 13 ms 368 KB Output is correct
50 Correct 4 ms 340 KB Output is correct
51 Correct 89 ms 340 KB Output is correct
52 Correct 132 ms 340 KB Output is correct
53 Correct 527 ms 344 KB Output is correct
54 Correct 17 ms 340 KB Output is correct

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 14 ms 360 KB Output is correct
3 Correct 12 ms 360 KB Output is correct
4 Correct 139 ms 340 KB Output is correct
5 Correct 46 ms 340 KB Output is correct
6 Correct 429 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 14 ms 368 KB Output is correct
9 Correct 33 ms 340 KB Output is correct
10 Correct 16 ms 360 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 14 ms 364 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 140 ms 344 KB Output is correct
15 Correct 43 ms 340 KB Output is correct
16 Correct 419 ms 344 KB Output is correct
17 Correct 28 ms 340 KB Output is correct
18 Correct 13 ms 352 KB Output is correct
19 Correct 31 ms 344 KB Output is correct
20 Correct 16 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 11 ms 360 KB Output is correct
24 Correct 6 ms 340 KB Output is correct
25 Correct 18 ms 360 KB Output is correct
26 Correct 150 ms 344 KB Output is correct
27 Correct 395 ms 344 KB Output is correct
28 Correct 25 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 17 ms 360 KB Output is correct
31 Correct 7 ms 340 KB Output is correct
32 Correct 144 ms 344 KB Output is correct
33 Correct 48 ms 344 KB Output is correct
34 Correct 434 ms 340 KB Output is correct
35 Correct 28 ms 344 KB Output is correct
36 Correct 13 ms 360 KB Output is correct
37 Correct 28 ms 344 KB Output is correct
38 Correct 16 ms 364 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 11 ms 360 KB Output is correct
42 Correct 9 ms 364 KB Output is correct
43 Correct 17 ms 364 KB Output is correct
44 Correct 134 ms 344 KB Output is correct
45 Correct 384 ms 348 KB Output is correct
46 Correct 19 ms 340 KB Output is correct
47 Correct 4 ms 340 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 13 ms 368 KB Output is correct
50 Correct 4 ms 340 KB Output is correct
51 Correct 89 ms 340 KB Output is correct
52 Correct 132 ms 340 KB Output is correct
53 Correct 527 ms 344 KB Output is correct
54 Correct 17 ms 340 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 12 ms 360 KB Output is correct
57 Correct 8 ms 364 KB Output is correct
58 Correct 144 ms 348 KB Output is correct
59 Correct 44 ms 340 KB Output is correct
60 Correct 442 ms 344 KB Output is correct
61 Correct 26 ms 340 KB Output is correct
62 Correct 15 ms 340 KB Output is correct
63 Correct 26 ms 364 KB Output is correct
64 Correct 16 ms 364 KB Output is correct
65 Correct 2 ms 340 KB Output is correct
66 Correct 2 ms 340 KB Output is correct
67 Correct 14 ms 360 KB Output is correct
68 Correct 7 ms 364 KB Output is correct
69 Correct 16 ms 340 KB Output is correct
70 Correct 135 ms 344 KB Output is correct
71 Correct 395 ms 344 KB Output is correct
72 Correct 20 ms 340 KB Output is correct
73 Correct 4 ms 340 KB Output is correct
74 Correct 4 ms 340 KB Output is correct
75 Correct 11 ms 340 KB Output is correct
76 Correct 4 ms 340 KB Output is correct
77 Correct 83 ms 344 KB Output is correct
78 Correct 126 ms 340 KB Output is correct
79 Correct 500 ms 344 KB Output is correct
80 Correct 18 ms 340 KB Output is correct
81 Incorrect 1 ms 340 KB Output isn't correct
82 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -