oj.uz

답안 #926471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926471 2024-02-13T05:23:13 Z shmad Kitchen (BOI19_kitchen) C++17
100 / 100
 20 ms 11096 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

int n, m, k, a[N], b[N], dp[N];

void solve () {
	cin >> n >> m >> k;
	int suma = 0, sumb = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (a[i] < k) cout << "Impossible\n", exit(0);
		suma += a[i];
	}
	for (int i = 1; i <= m; i++) cin >> b[i], sumb += b[i];
	fill(dp, dp + N, -inf);
	dp[0] = 0;
	for (int i = 1; i <= m; i++) {
		for (int w = sumb; w >= b[i]; w--) dp[w] = max(dp[w], dp[w - b[i]] + min(b[i], n));
	}
	for (int w = suma; w <= sumb; w++) {
		if (dp[w] >= n * k) {
			cout << w - suma << '\n';
			return;
		}
	}              
	cout << "Impossible\n";
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef AMIR
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10840 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 2 ms 11096 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 1 ms 11096 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 10844 KB Output is correct
2 Correct 11 ms 10844 KB Output is correct
3 Correct 12 ms 10908 KB Output is correct
4 Correct 19 ms 10900 KB Output is correct
5 Correct 19 ms 10844 KB Output is correct
6 Correct 9 ms 10840 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10844 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10840 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 2 ms 11096 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 1 ms 11096 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 14 ms 10844 KB Output is correct
15 Correct 11 ms 10844 KB Output is correct
16 Correct 12 ms 10908 KB Output is correct
17 Correct 19 ms 10900 KB Output is correct
18 Correct 19 ms 10844 KB Output is correct
19 Correct 9 ms 10840 KB Output is correct
20 Correct 1 ms 10844 KB Output is correct
21 Correct 1 ms 10844 KB Output is correct
22 Correct 1 ms 10844 KB Output is correct
23 Correct 2 ms 10844 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 11 ms 10844 KB Output is correct
26 Correct 13 ms 10844 KB Output is correct
27 Correct 5 ms 10844 KB Output is correct
28 Correct 11 ms 10908 KB Output is correct
29 Correct 15 ms 10840 KB Output is correct
30 Correct 20 ms 10844 KB Output is correct