oj.uz

답안 #377709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377709 2021-03-14T20:36:41 Z SavicS Kitchen (BOI19_kitchen) C++14
9 / 100
 3 ms 364 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 = 100005;
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];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n >> m >> k;
	ff(i,0,n - 1)cin >> a[i];
	ff(i,0,m - 1)cin >> b[i];
	
//	if(k > m)return cout << "Impossible", 0;
	ff(i,0,n - 1){
		if(a[i] < k)return cout << "Impossible", 0;
	}
	int zbira = 0;
	ff(i,0,n - 1)zbira += a[i];
//	int zbirb = 0;
//	ff(i,0,m - 1)zbirb += b[i];
//	if(zbira > zbirb)return cout << "Impossible", 0;
	
	int rez = inf;
	ff(mask,0,(1 << m) - 1){
		int sum = 0;
		ff(i,0,m - 1){
			if((1 << i) & mask)sum += b[i];
		}
		if(sum >= zbira && (__builtin_popcount(mask) >= k))rez = min(rez, sum - zbira);
		
	}
	if(rez == inf)cout << "Impossible" << endl;
	else cout << rez << endl;
   	return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Incorrect 2 ms 364 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

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 0 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 0 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 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Incorrect 2 ms 364 KB Output isn't correct
12 Halted 0 ms 0 KB -