제출 #577714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
577714		patrikpavic2	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	342 ms	596 KiB

vault

#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

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

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

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++){
        ll ost = min((ll)M, A[i]);
        ll uz = min(A[i] - ost, max(L - (M * M - 5 * M), 0LL) / i);
        kol += uz; L -= uz * i;
        A[i] = ost;
    }
    for(int i = 1;i < 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]);
        }
    }
    if(L >= M * M || dp[L] < 0)
        printf("impossible\n");
    else
        printf("%lld\n", kol + dp[L] + bla);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10