oj.uz

답안 #377720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377720 2021-03-14T21:17:06 Z SavicS Kitchen (BOI19_kitchen) C++14
21 / 100
 45 ms 876 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 = 305;
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];

const int N = maxn * maxn;
int dp[N];


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];
   	
   	int A = 0;
   	ff(i,1,n){
   		A += a[i];
   		if(a[i] < k)return cout << "Impossible", 0;	
	}
   	
   	memset(dp, -inf, sizeof(dp));
   	
   	dp[0] = 0;
   	ff(i,1,m){
   		fb(j,N,0){
   			if(j >= b[i])dp[j] = max(dp[j], dp[j - b[i]] + min(n, b[i]));
	   }
	}
	
	ff(i,A,N){
		if(dp[i] >= n * k){
			cout << i - A << endl;
			return 0;
		}
	}
   	
	return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 748 KB Output is correct
2 Correct 30 ms 748 KB Output is correct
3 Correct 40 ms 748 KB Output is correct
4 Correct 45 ms 876 KB Output is correct
5 Incorrect 44 ms 748 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 28.0

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