oj.uz

Submission #311326

# Submission time Handle Problem Language Result Execution time Memory
311326 2020-10-09T23:18:30 Z VROOM_VARUN Kitchen (BOI19_kitchen) C++14
100 / 100
 18 ms 1280 KB 
/*
ID: varunra2
LANG: C++
TASK: kitchen
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

const int N = 500;

VI dp;

void bad() {
  cout << "Impossible\n";
  exit(0);
}

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("kitchen.in", "r", stdin);
  // freopen("kitchen.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, m, k;
  cin >> n >> m >> k;
  if (m < k) bad();
  VI a(n), b(m);

  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }

  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }

  sort(all(a));
  sort(all(b));

  dp.assign(N * N + 1, -INF);

  if (*min_element(all(a)) < k) {
    bad();
  }

  int tot = 0;
  int ta = accumulate(all(a), 0);

  dp[0] = 0;

  for (int i = 0; i < m; i++) {
    int cur = b[i];
    tot += cur;
    for (int j = tot; j >= 0; j--) {
      dp[j + cur] = max(dp[j + cur], dp[j] + min(n, cur));
    }
  }

  for (int j = ta; j <= N * N; j++) {
    if (dp[j] >= n * k) {
      cout << j - ta << '\n';
      return 0;
    }
  }

  bad();

  return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1280 KB Output is correct
2 Correct 10 ms 1280 KB Output is correct
3 Correct 8 ms 1280 KB Output is correct
4 Correct 18 ms 1280 KB Output is correct
5 Correct 18 ms 1280 KB Output is correct
6 Correct 8 ms 1280 KB Output is correct

Subtask #4
21.0 / 21.0

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

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 1 ms 1280 KB Output is correct
11 Correct 1 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 13 ms 1280 KB Output is correct
15 Correct 10 ms 1280 KB Output is correct
16 Correct 8 ms 1280 KB Output is correct
17 Correct 18 ms 1280 KB Output is correct
18 Correct 18 ms 1280 KB Output is correct
19 Correct 8 ms 1280 KB Output is correct
20 Correct 1 ms 1280 KB Output is correct
21 Correct 1 ms 1280 KB Output is correct
22 Correct 1 ms 1280 KB Output is correct
23 Correct 1 ms 1280 KB Output is correct
24 Correct 1 ms 1280 KB Output is correct
25 Correct 9 ms 1280 KB Output is correct
26 Correct 11 ms 1280 KB Output is correct
27 Correct 4 ms 1280 KB Output is correct
28 Correct 9 ms 1280 KB Output is correct
29 Correct 13 ms 1280 KB Output is correct
30 Correct 18 ms 1280 KB Output is correct