oj.uz

답안 #577768

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577768 2022-06-15T08:47:01 Z patrikpavic2 Uplifting Excursion (BOI22_vault) C++17
0 / 100
 0 ms 212 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

const int M = 32;
const int INF = 0x3f3f3f3f;

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

ll greedy(ll cur){
    if(cur < 0) return 0;
    ll ret = 0;
    for(int i = 1;i <= m;i++){
        ll uz = min(B[i], cur / i);
        cur -= uz * i; ret += uz;
    }
    return cur == 0 ? ret : -1;
}

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;
    }
    for(int i = 1;i <= m;i++){
        B[i] = A[i] - min(A[i], (ll)M);
        A[i] -= B[i];
    }
    for(int i = 1;i < M * M + M;i++)
        dp[i] = -INF;
    for(int i = 1;i <= m;i++){
        for(int j = 0;j < A[i];j++){
            for(int k = M * M - 1;k >= i;k--)
                dp[k] = max(dp[k], 1 + dp[k - i]);
        }
    }
    ll odg = -1;
    for(int LL = 0;LL < M * M;LL++){
        if(dp[LL] < 0) continue;
        ll jos = greedy(L - LL);
        if(jos == -1) continue;
        odg = max(odg, dp[LL] + jos + bla);
    }
    if(odg < 0)
        printf("impossible\n");
    else
        printf("%lld\n", odg);
    return 0;
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d%lld", &m, &L);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
vault.cpp:28:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         ll x; scanf("%lld", &x);
      |               ~~~~~^~~~~~~~~~~~
vault.cpp:31:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     ll bla; scanf("%lld", &bla);
      |             ~~~~~^~~~~~~~~~~~~~
vault.cpp:33:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         ll x; scanf("%lld", &x);
      |               ~~~~~^~~~~~~~~~~~
vault.cpp:41:15: warning: iteration 1023 invokes undefined behavior [-Waggressive-loop-optimizations]
   41 |         dp[i] = -INF;
      |         ~~~~~~^~~~~~
vault.cpp:40:21: note: within this loop
   40 |     for(int i = 1;i < M * M + M;i++)
      |                   ~~^~~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 15.0

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

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

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

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

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

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

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