답안 #1004306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004306 2024-06-21T07:31:12 Z LilPluton Kitchen (BOI19_kitchen) C++14
20 / 100
31 ms 1112 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 = 1e5 + 5;
 
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], chefsum += chef[i];
    sort(chef + 1, chef + m + 1);
    
    if(k == 1)
    {
        dp[0] = 1;
        for(int i = 1; i <= m; ++i)
        {
            for(int j = N; j >= chef[i]; --j)
            {
                if(dp[j - chef[i]])
                    dp[j] = 1;
            }
        }
        for(ll i = sum; i <= N; ++i)
        {
            if(dp[i])
            {
                cout << i - sum << endll;
                return 0;
            }
        }
        cout << "Impossible" << endll;
        return 0;
    }
    
    if(m < k || a[1] < k)
    {
        cout << "Impossible" << endll;
        return 0;
    }
  
    
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 856 KB Output is correct
2 Correct 21 ms 856 KB Output is correct
3 Correct 25 ms 600 KB Output is correct
4 Correct 31 ms 856 KB Output is correct
5 Correct 26 ms 1112 KB Output is correct
6 Correct 20 ms 828 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -