oj.uz

답안 #328636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328636 2020-11-17T11:21:43 Z soroush Kitchen (BOI19_kitchen) C++14
51 / 100
 22 ms 492 KB 
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma,tune=native")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int  ,int > pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn  = 400;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m , k;
int a[maxn];
int b[maxn];
int suma = 0 , sumb = 0;
priority_queue < int > pq;
int vec[maxn];


void sub3(){
	bitset < 90100 > dp;
	dp = 1;
	for(int i = 0 ; i < m ; i ++)
		dp|= (dp << b[i]);
	for(int i = suma ; ; i ++)
		if(dp[i])	
			dokme(i - suma);
}

void sub2(){
	int mn = 1e9;
	for(int i = 0 ; i < (1 << m) ; i ++){
		if(__builtin_popcount(i) < k)continue;
		int sum = 0;
		for(int j = 0 ; j < m ; j ++ )if(i&(1 << j))sum+=b[j];
		if(sum < suma)continue;
		while(pq.size())pq.pop();
		for(int j = 0 ; j < m ; j ++ )if(i&(1 << j))pq.push(b[j]);
		int ok = 1;
		for(int i = 0 ; i < n ; i ++ ){
			int cnt = 0;
			if(pq.size() < k){ok = 0;break;}
			for(int i = 0 ; i < k ; i ++){
				int x = pq.top();
				pq.pop();
				x--;
				if(x)vec[++cnt] = x;
			}
			for(int i = 1 ; i <= cnt ; i ++)pq.push(vec[i]);
		}
		if(ok) mn = min(mn , sum - suma);
	}
	if(mn == 1e9)dokme("Impossible");
	dokme(mn);
}

int32_t main(){
    migmig;
	cin >> n >> m >> k;
	for(int i = 0 ; i < n ; i ++)	
		cin >> a[i], suma+=a[i];
	for(int i = 0 ; i < m ; i ++)
		cin >> b[i], sumb+=b[i];
	sort(a , a + n);
	sort(b , b + m);
	if(m < k)dokme("Impossible");
	if(*min_element(a , a + n) < k)dokme("Impossible");
	if(suma > sumb)dokme("Impossible");
	if(k == 1)
		sub3();
	if(m <= 15)
		sub2();
	



    return(0);
}

Compilation message

kitchen.cpp: In function 'void sub2()':
kitchen.cpp:58:17: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   58 |    if(pq.size() < k){ok = 0;break;}
      |       ~~~~~~~~~~^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 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 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 8 ms 364 KB Output is correct
10 Correct 16 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 22 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Incorrect 1 ms 364 KB Output isn't correct
21 Halted 0 ms 0 KB -