oj.uz

답안 #331687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331687 2020-11-29T14:23:11 Z soroush Kitchen (BOI19_kitchen) C++14
20 / 100
 15 ms 1132 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  = 1e5;
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;

int dp[2][maxn];

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);
	ms(dp, -1);
	dp[0][0] = 0;
	for(int i = 0 ; i < m ; i ++)
		for(int j = b[i] ; j <= sumb ; j ++)
			if(dp[i%2][j-b[i]]!=-1)dp[(i+1)%2][j] = max(dp[i%2][j - b[i]] + min(b[i] , n) , dp[i%2][j]);
			else dp[(i + 1)%2][j] = dp[i%2][j];
	for(int i = suma ; i <= sumb ; i ++ )
		if(dp[m%2][i] >= n*k)dokme(i - suma);
	cout << "Impossible";
    return(0);
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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