oj.uz

답안 #1004515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004515 2024-06-21T09:33:11 Z LilPluton Kitchen (BOI19_kitchen) C++14
0 / 100
 17 ms 856 KB 
#include <bits/stdc++.h>
/// author: LilPluton auuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu
#define OPT         ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define intt        long long
#define ll          long long
#define pb          push_back
#define arr         array
#define vll         vector<int>
#define fi          first
#define se          second
#define rep(i,j,k)  for(int i = j; i <= k; ++i)
#define all(a)      a.begin(),a.end()
#define pii         pair<int,int>
#define endll       '\n'
using namespace std;
const ll INF = 1e18;
const int N = 305 * 305;
 
ll n, m, k, sum, chefsum;
ll a[N], chef[N];
ll dp[N];
signed main()
{
    cin >> n >> m >> k;
    for(ll i = 1; i <= n; ++i)
        cin >> a[i], sum += a[i];
    sort(a + 1, a + n + 1);
    for(ll i = 1; i <= m; ++i)
    {
        cin >> chef[i];
        for(ll  j = N; j >= chef[i]; --j)
        {
            if(j == chef[i] || dp[j - chef[i]])
            {
                dp[j] = max(dp[j], dp[j - chef[i]] + min(n, chef[i]));
            }
        }
    }
    if(m < k || a[1] < k)
    {
        cout << "Impossible";
        return 0;
    }
    for(ll i = sum; i <= N; ++i)
    {
        if(dp[sum] >= k * n)
        {
            cout << i - sum << endll;
            return 0;
        }
    }
    cout << "Impossible";
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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