oj.uz

Submission #206089

# Submission time Handle Problem Language Result Execution time Memory
206089 2020-03-02T08:57:39 Z alishahali1382 Kitchen (BOI19_kitchen) C++14
100 / 100
 29 ms 888 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 310, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN], B[MAXN];
int dp[MAXN*MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m>>k;
	for (int i=1; i<=n; i++){
		cin>>A[i];
		ans+=A[i];
		if (A[i]<k) kill("Impossible")
	}
	memset(dp, -31, sizeof(dp));
	dp[0]=0;
	for (int i=1; i<=m; i++){
		cin>>B[i];
		for (int j=MAXN*MAXN-1; j>=B[i]; j--) dp[j]=max(dp[j], dp[j-B[i]] + min(B[i], n));
	}
	for (int i=ans; i<MAXN*MAXN; i++) if (dp[i]>=n*k) kill(i-ans)
	cout<<"Impossible\n";
	
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 636 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 5 ms 664 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 760 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 636 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 5 ms 664 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 760 KB Output is correct
9 Correct 6 ms 760 KB Output is correct
10 Correct 6 ms 760 KB Output is correct
11 Correct 6 ms 760 KB Output is correct
12 Correct 6 ms 764 KB Output is correct
13 Correct 6 ms 760 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 760 KB Output is correct
2 Correct 22 ms 760 KB Output is correct
3 Correct 28 ms 760 KB Output is correct
4 Correct 28 ms 760 KB Output is correct
5 Correct 29 ms 760 KB Output is correct
6 Correct 20 ms 760 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 636 KB Output is correct
2 Correct 8 ms 760 KB Output is correct
3 Correct 8 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 6 ms 376 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 636 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 5 ms 664 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 760 KB Output is correct
9 Correct 6 ms 760 KB Output is correct
10 Correct 6 ms 760 KB Output is correct
11 Correct 6 ms 760 KB Output is correct
12 Correct 6 ms 764 KB Output is correct
13 Correct 6 ms 760 KB Output is correct
14 Correct 27 ms 760 KB Output is correct
15 Correct 22 ms 760 KB Output is correct
16 Correct 28 ms 760 KB Output is correct
17 Correct 28 ms 760 KB Output is correct
18 Correct 29 ms 760 KB Output is correct
19 Correct 20 ms 760 KB Output is correct
20 Correct 8 ms 636 KB Output is correct
21 Correct 8 ms 760 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 8 ms 760 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 20 ms 760 KB Output is correct
26 Correct 24 ms 760 KB Output is correct
27 Correct 17 ms 760 KB Output is correct
28 Correct 24 ms 760 KB Output is correct
29 Correct 25 ms 888 KB Output is correct
30 Correct 27 ms 760 KB Output is correct