oj.uz

답안 #957706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957706 2024-04-04T08:31:47 Z batsukh2006 Kitchen (BOI19_kitchen) C++17
51 / 100
 34 ms 464 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
 
#define MOD 1000000007
#define int long long
#define ss second
#define ff first
#define endl '\n'
typedef pair<int,int> pp;
const int mxN=9e4+1;
vector<bool> dp(mxN);
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

	int n,m,k; cin>>n>>m>>k;
	vector<int> a(n),b(m);
	for(int i=0; i<n; i++) cin>>a[i];
	for(int i=0; i<m; i++) cin>>b[i];  
	int sum=0;
	for(int i=0; i<n; i++){
		sum+=a[i];
		if(a[i]<k){
			cout<<"Impossible";
			return 0;
		}
	}
	if(k==1){
		dp[0]=1;
		for(int i=0; i<m; i++){
			for(int k=mxN; k>=b[i]; k--){
				if(dp[k-b[i]]==1) dp[k]=1;
			}
		}
		for(int i=sum; i<=mxN; i++){
			if(dp[i]==1){
				cout<<i-sum;
				return 0;
			}
		}
		cout<<"Impossible";
	}else if(m<=15){
		int ans=1e9;
		for(int i=0; i<(1<<m); i++){
			int cur=0,cnt=0,num=0;
			for(int j=0; j<m; j++){
				if(i&(1<<j)){
					if(num+b[j]>=n){
						cnt++;
						num=min(num,(num+b[j])%n);
					}else{
						num+=b[j];
					}
					cur+=b[j];
				}
			}
			if(cur>=sum&&cnt>=k){
				ans=min(ans,cur-sum);
			}
		}
		if(ans==1e9) cout<<"Impossible";
		else cout<<ans;
	}
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 464 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 15 ms 460 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 34 ms 348 KB Output is correct
5 Correct 28 ms 344 KB Output is correct
6 Correct 14 ms 348 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 464 KB Output is correct
14 Correct 19 ms 348 KB Output is correct
15 Correct 15 ms 460 KB Output is correct
16 Correct 26 ms 348 KB Output is correct
17 Correct 34 ms 348 KB Output is correct
18 Correct 28 ms 344 KB Output is correct
19 Correct 14 ms 348 KB Output is correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -