oj.uz

답안 #577857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577857 2022-06-15T10:16:19 Z patrikpavic2 Uplifting Excursion (BOI22_vault) C++17
10 / 100
 2655 ms 588 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

const int M = 32;
const int GR = M * 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, 0LL) / i);
        L -= uz * i;
        ll trb = M;
        if(uz >= trb){
            A[i] -= (uz - trb);
            kol += uz - trb;
            L2 += trb * i;
        }
        else{
            L2 += uz * i;
        }
        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 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

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

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 40 ms 516 KB Output is correct
3 Correct 14 ms 468 KB Output is correct
4 Correct 1363 ms 588 KB Output is correct
5 Correct 470 ms 512 KB Output is correct
6 Correct 2634 ms 512 KB Output is correct
7 Correct 274 ms 512 KB Output is correct
8 Correct 128 ms 512 KB Output is correct
9 Correct 16 ms 468 KB Output is correct
10 Correct 31 ms 468 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 40 ms 516 KB Output is correct
3 Correct 14 ms 468 KB Output is correct
4 Correct 1363 ms 588 KB Output is correct
5 Correct 470 ms 512 KB Output is correct
6 Correct 2634 ms 512 KB Output is correct
7 Correct 274 ms 512 KB Output is correct
8 Correct 128 ms 512 KB Output is correct
9 Correct 16 ms 468 KB Output is correct
10 Correct 31 ms 468 KB Output is correct
11 Incorrect 1 ms 468 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 40 ms 516 KB Output is correct
3 Correct 14 ms 468 KB Output is correct
4 Correct 1363 ms 588 KB Output is correct
5 Correct 470 ms 512 KB Output is correct
6 Correct 2634 ms 512 KB Output is correct
7 Correct 274 ms 512 KB Output is correct
8 Correct 128 ms 512 KB Output is correct
9 Correct 16 ms 468 KB Output is correct
10 Correct 31 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 41 ms 528 KB Output is correct
13 Correct 13 ms 532 KB Output is correct
14 Correct 1427 ms 516 KB Output is correct
15 Correct 456 ms 520 KB Output is correct
16 Correct 2655 ms 512 KB Output is correct
17 Correct 272 ms 516 KB Output is correct
18 Correct 135 ms 512 KB Output is correct
19 Correct 19 ms 532 KB Output is correct
20 Correct 30 ms 468 KB Output is correct
21 Incorrect 188 ms 516 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

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

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 40 ms 516 KB Output is correct
3 Correct 14 ms 468 KB Output is correct
4 Correct 1363 ms 588 KB Output is correct
5 Correct 470 ms 512 KB Output is correct
6 Correct 2634 ms 512 KB Output is correct
7 Correct 274 ms 512 KB Output is correct
8 Correct 128 ms 512 KB Output is correct
9 Correct 16 ms 468 KB Output is correct
10 Correct 31 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 41 ms 528 KB Output is correct
13 Correct 13 ms 532 KB Output is correct
14 Correct 1427 ms 516 KB Output is correct
15 Correct 456 ms 520 KB Output is correct
16 Correct 2655 ms 512 KB Output is correct
17 Correct 272 ms 516 KB Output is correct
18 Correct 135 ms 512 KB Output is correct
19 Correct 19 ms 532 KB Output is correct
20 Correct 30 ms 468 KB Output is correct
21 Incorrect 188 ms 516 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

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

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 40 ms 516 KB Output is correct
3 Correct 14 ms 468 KB Output is correct
4 Correct 1363 ms 588 KB Output is correct
5 Correct 470 ms 512 KB Output is correct
6 Correct 2634 ms 512 KB Output is correct
7 Correct 274 ms 512 KB Output is correct
8 Correct 128 ms 512 KB Output is correct
9 Correct 16 ms 468 KB Output is correct
10 Correct 31 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 41 ms 528 KB Output is correct
13 Correct 13 ms 532 KB Output is correct
14 Correct 1427 ms 516 KB Output is correct
15 Correct 456 ms 520 KB Output is correct
16 Correct 2655 ms 512 KB Output is correct
17 Correct 272 ms 516 KB Output is correct
18 Correct 135 ms 512 KB Output is correct
19 Correct 19 ms 532 KB Output is correct
20 Correct 30 ms 468 KB Output is correct
21 Incorrect 188 ms 516 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

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