oj.uz

답안 #567414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567414 2022-05-23T12:33:54 Z birthdaycake Kitchen (BOI19_kitchen) C++17
29 / 100
 20 ms 1052 KB 
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define mod 1000000007
#define boost ios_base::sync_with_stdio(false), cin.tie(NULL);
using namespace std;
 
 
 
 
int dp[200001],a[20001],b[200001];
 
signed main(){
    boost;
    
    
    
    
    int n,m,k,sum = 0; cin >> n >> m >>  k;
    for(int i = 0; i < n; i++){
        cin >> a[i]; sum += a[i];
    }
    
    if(k == 1){
        for(int j = 0; j < m; j++) cin >> b[j];
        
        dp[0] = 1;
        for(int i = 0; i < m; i++){
            for(int j = 90000; j >= b[i]; j--){
                dp[j] += dp[j - b[i]];
            }
        }
        for(int i = sum; i <= 90000; i++){
            if(dp[i]){
                cout << i - sum;
                return 0;
            }
        }
        cout << "Impossible";
        return 0;
    }
    
    
    for(int j = 0; j < m; j++) cin >> b[j];
    
    if(m < k){
        cout << "Impossible";
        return 0;
    }
    
    for(int i = 0; i < n; i++){
        if(a[i] < k){
            cout << "Impossible";
            return 0;
        }
    }
    
    
    
    int ans = 1e18;
    for(int i = 0; i < (1 << m); i++){
        int tot = 0, good = 1, xx = 0;
        for(int j = 0; j < m; j++){
            if(i & (1 << j)){
                xx += min(b[j],n);
                tot += b[j];
            }
        }
        if(xx == n * k){
            if(tot >= sum) ans = min(ans,tot - sum);
        }
        
    }
    if(ans == 1e18){
        cout << "Impossible";
        return 0;
    }
    cout << ans;
    return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:62:22: warning: unused variable 'good' [-Wunused-variable]
   62 |         int tot = 0, good = 1, xx = 0;
      |                      ^~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 976 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Incorrect 2 ms 340 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 1048 KB Output is correct
2 Correct 15 ms 1052 KB Output is correct
3 Correct 20 ms 980 KB Output is correct
4 Correct 14 ms 980 KB Output is correct
5 Correct 15 ms 1044 KB Output is correct
6 Correct 11 ms 1040 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Incorrect 2 ms 340 KB Output isn't correct
13 Halted 0 ms 0 KB -