oj.uz

답안 #377718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377718 2021-03-14T21:08:13 Z SavicS Kitchen (BOI19_kitchen) C++14
0 / 100
 479 ms 18924 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 55;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m, k;
int a[maxn];
int b[maxn];

bool dp[maxn][maxn][maxn * maxn];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);

	cin >> n >> m >> k;
	ff(i,1,n)cin >> a[i];
	ff(i,1,m)cin >> b[i];
   	
   	ff(i,1,n){
		if(a[i] < k)return cout << "Impossible", 0;
	}
	
   	int S = 0;
   	ff(i,1,m)S += b[i];
   	
	dp[0][0][0] = 1;
	ff(i,1,m){
		ff(j,0,m){
			ff(l,0,S){
				if(j >= 1 && b[i] >= k)dp[i][j][l] |= dp[i - 1][j - 1][l - b[i]];
				dp[i][j][l] |= dp[i - 1][j][l];
			}
		}
	}   
	
//	ff(l,0,S)cout << dp[m][m][l] << " ";
//	cout << endl;

	int zbir = 0;
	ff(i,1,n)zbir += a[i];

	int rez = inf;
	ff(j,k,m){
		ff(l,zbir,S){
			if(dp[m][j][l]){
				rez = min(rez, l - zbir);
			}
		}
	}
	if(rez == inf)cout << "Impossible" << endl;
	else cout << rez << endl;
	return 0;
}
/**

2 5 5
7 6 
4 6 1 6 4 


1 4 3
6 
7 7 8 10 


2 3 1
10 6 
1 9 10 


// probati bojenje sahovski ili slicno

**/

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 479 ms 18924 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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