oj.uz

Submission #724021

# Submission time Handle Problem Language Result Execution time Memory
724021 2023-04-14T15:40:00 Z lovrot Kitchen (BOI19_kitchen) C++17
0 / 100
 11 ms 836 KB 
#include <cstdio>
#include <algorithm>

using namespace std; 

const int N = 310;
const int INF = 2e9;

int n, m, k, A[N], B[N]; 
int dp[2][N * N]; 

int main() {
	for(int i = 0; i < N * N; i++) dp[0][i] = -INF; 

	scanf("%d%d%d", &n, &m, &k); 
	int nim = INF, sum = 0;
	for(int i = 0; i < n; i++) {
		scanf("%d", A + i); 
		nim = min(nim, A[i]); 
		sum += A[i]; 
	}
	for(int i = 0; i < m; i++) scanf("%d", B + i); 

	if(nim < k || m < k) {
		printf("Impossible\n");
		return 0; 
	}
	bool f = 0;
	int _sum = 0;
	for(int i = 0; i < m; i++) {
		f ^= 1;
		_sum += B[i]; 
		for(int j = 0; j <= _sum; j++) 
			dp[f][j] = max(dp[!f][j], B[i] > j ? 0 : dp[!f][j - B[i]] + min(n, B[i])); 
	}
	for(int i = 0; i < N * N; i++) 
		if(dp[f][i] >= n * k && i >= sum) {
			printf("%d\n", i - sum); 
			return 0; 
		}
	printf("Impossible\n");
	return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  scanf("%d%d%d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d", A + i);
      |   ~~~~~^~~~~~~~~~~~~
kitchen.cpp:22:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  for(int i = 0; i < m; i++) scanf("%d", B + i);
      |                             ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -