oj.uz

답안 #925931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925931 2024-02-12T11:01:22 Z vjudge1 Kitchen (BOI19_kitchen) C++17
51 / 100
 26 ms 1368 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 w = 90000;
	int b[m], pr[w + 1];
	vector<int> dp(w + 1, -inf);
	dp[0] = 0;
	for (int i = 0; i < m; i++) {
		cin >> b[i];
		for (int j = w; j >= b[i]; j--) {
			if (dp[j] < dp[j - b[i]] + 1) {
				dp[j] = dp[j - b[i]] + 1;  
				pr[j] = i;
			}
		}
	}
	for (int x = v; x <= w; x++) {
		if (dp[x] < k) continue;
		vector<int> s;
		int y = x;
		while (y) {
			s.push_back(b[pr[y]]);
			y -= b[pr[y]];
		}
		bool ok = 1;
		for (int i = 0; i < n; i++) {
			sort(all(s));
			if (!s[sz(s) - k]) {
				ok = 0;
				break;
			}
			for (int j = sz(s) - k; j < sz(s); j++) 
				s[j]--;
		}
		if (ok) {
			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:82:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   82 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1116 KB Output is correct
2 Correct 16 ms 1176 KB Output is correct
3 Correct 26 ms 1368 KB Output is correct
4 Correct 24 ms 1116 KB Output is correct
5 Correct 20 ms 1116 KB Output is correct
6 Correct 16 ms 1172 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 19 ms 1116 KB Output is correct
15 Correct 16 ms 1176 KB Output is correct
16 Correct 26 ms 1368 KB Output is correct
17 Correct 24 ms 1116 KB Output is correct
18 Correct 20 ms 1116 KB Output is correct
19 Correct 16 ms 1172 KB Output is correct
20 Incorrect 4 ms 1112 KB Output isn't correct
21 Halted 0 ms 0 KB -