oj.uz

Submission #525546

# Submission time Handle Problem Language Result Execution time Memory
525546 2022-02-11T22:10:00 Z Yazan_Alattar Kitchen (BOI19_kitchen) C++14
9 / 100
 1000 ms 24900 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 5005;
const ll inf = 1e18;
const ll mod = 998244353;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
 
int n, m, k, sum, a[M], b[M], tot;
bool dp[M][M];
 
int main()
{
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 1; i <= n; ++i) {
		scanf("%d",  &a[i]);
		sum += a[i];
		if(a[i] < k) printf("Impossible\n"), exit(0);
	}
	for(int i = 1; i <= m; ++i) scanf("%d", &b[i]), tot += b[i];
	if(sum > tot) printf("Impossible\n"), exit(0);
	
	dp[0][0] = 1;
	for(int i = 1; i <= m; ++i) {
		for(int cost = M - b[i] - 1; cost >= 0; --cost) {
			for(int filled = 0; filled + min(n, b[i]) < M; ++filled) {
				dp[filled + min(n, b[i])][cost + b[i]] |= dp[filled][cost];
			}
		}
		for(int cost = M - b[i] - 1; cost >= 0; --cost)
			for(int filled = M - 2; filled >= 0; --filled)
				dp[filled][cost] |= dp[filled + 1][cost];
	}
	
	for(int i = sum; i < M; ++i) if(dp[n * k][i]) printf("%d\n", i - sum), exit(0);
	printf("Impossible\n");
	
	return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%d%d%d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |   scanf("%d",  &a[i]);
      |   ~~~~~^~~~~~~~~~~~~~
kitchen.cpp:26:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  for(int i = 1; i <= m; ++i) scanf("%d", &b[i]), tot += b[i];
      |                              ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 24784 KB Output is correct
2 Correct 884 ms 24796 KB Output is correct
3 Correct 900 ms 24900 KB Output is correct
4 Correct 857 ms 24796 KB Output is correct
5 Correct 941 ms 24792 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 24784 KB Output is correct
2 Correct 884 ms 24796 KB Output is correct
3 Correct 900 ms 24900 KB Output is correct
4 Correct 857 ms 24796 KB Output is correct
5 Correct 941 ms 24792 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Execution timed out 1097 ms 24828 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1101 ms 24704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1097 ms 24668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 24784 KB Output is correct
2 Correct 884 ms 24796 KB Output is correct
3 Correct 900 ms 24900 KB Output is correct
4 Correct 857 ms 24796 KB Output is correct
5 Correct 941 ms 24792 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Execution timed out 1097 ms 24828 KB Time limit exceeded
10 Halted 0 ms 0 KB -