oj.uz

Submission #925949

# Submission time Handle Problem Language Result Execution time Memory
925949 2024-02-12T11:29:55 Z vjudge1 Kitchen (BOI19_kitchen) C++17
100 / 100
 28 ms 1172 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 2e5 + 1, mod = 998244353;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slv() {
	int n, m, k;
	cin >> n >> m >> k;
	int a[n], v = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		v += a[i];
		if (a[i] < k) {
			cout << "Impossible";
			return;
		}
	}
	int b[m], w = 0;
	for (int i = 0; i < m; i++) {
		cin >> b[i];
		w += b[i];
	}
	int pr[w + 1];
	vector<int> dp(w + 1, -inf);
	dp[0] = 0;
	for (int i = 0; i < m; i++) {
		for (int j = w; j >= b[i]; j--) {
			if (dp[j] < dp[j - b[i]] + min(n, b[i])) {
				dp[j] = dp[j - b[i]] + min(n, b[i]);  
				pr[j] = i;
			}
		}
	}
	for (int x = v; x <= w; x++) {
		if (dp[x] < k * n) continue;
		cout << x - v;
		return;
	}
	cout << "Impossible";
}
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama

Compilation message

kitchen.cpp: In function 'void slv()':
kitchen.cpp:48:6: warning: variable 'pr' set but not used [-Wunused-but-set-variable]
   48 |  int pr[w + 1];
      |      ^~
kitchen.cpp: At global scope:
kitchen.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 372 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 856 KB Output is correct
2 Correct 11 ms 860 KB Output is correct
3 Correct 13 ms 600 KB Output is correct
4 Correct 23 ms 860 KB Output is correct
5 Correct 22 ms 1112 KB Output is correct
6 Correct 9 ms 860 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 372 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 14 ms 856 KB Output is correct
15 Correct 11 ms 860 KB Output is correct
16 Correct 13 ms 600 KB Output is correct
17 Correct 23 ms 860 KB Output is correct
18 Correct 22 ms 1112 KB Output is correct
19 Correct 9 ms 860 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 11 ms 860 KB Output is correct
26 Correct 14 ms 860 KB Output is correct
27 Correct 5 ms 604 KB Output is correct
28 Correct 11 ms 860 KB Output is correct
29 Correct 16 ms 860 KB Output is correct
30 Correct 28 ms 1172 KB Output is correct