제출 #762179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762179		anha3k25cvp	Kitchen (BOI19_kitchen)	C++14	0 / 100	30 ms	468 KiB

kitchen

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 5 + 1e5;
const int inf = 7 + 1e9;

vector <int> a, f;

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n, m, k;
    cin >> n >> m >> k;
    int val = 0;
    for (int i = 1; i <= n; i ++) {
        int x;
        cin >> x;
        if (x < k) {
            cout << "Impossible";
            return 0;
        }
        val += x;
    }
    int ma = 0;
    a.assign(m + 1, 0);
    for (int i = 1; i <= m; i ++) {
        cin >> a[i];
        ma += a[i];
    }
    f.assign(ma + 1, 0);
    int ans = inf;
    for (int num = 0; num <= m; num ++)
        for (int sum = ma; sum >= 0; sum --) {
            if (num < m)
                f[sum + a[num + 1]] = max(f[sum + a[num + 1]], f[sum] + min(a[num + 1], n));
            if (sum >= val && f[sum] >= n * k)
                ans = min(ans, sum);
        }
    if (ans < inf)
        cout << ans - val;
    else
        cout << "Impossible";
    return 0;
}

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

kitchen.cpp: In function 'int main()':
kitchen.cpp:21:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen (TASKNAME".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:22:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen (TASKNAME".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28