Submission #605589

#	Time	Username	Problem	Language	Result	Execution time	Memory
605589		slime	Kitchen (BOI19_kitchen)	C++14	100 / 100	162 ms	219364 KiB

kitchen

#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); 
  lucas[0] = 2;
  lucas[1] = 1;
  for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
  fib[0] = 0;
  fib[1] = 1;
  for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
  int n = a.size();
  int bucket[n+1];
  for(int i=1; i<=n; i++) bucket[i] = 1e18;
  int ans = 1;
  for(int x: a) {
    auto it = lower_bound(bucket + 1, bucket +n +1, x);
    int d = distance(bucket, it);
    ans = max(ans, d);
    bucket[d] = min(bucket[d], x);
  }
  return ans;
}
int n, m, k, a[MAXN], b[MAXN];
void solve(int tc) {
  cin >> n >> m >> k;
  for(int i=1; i<=n; i++) {
    cin >> a[i];
    if(a[i] < k) {
      cout << "Impossible\n"; return;
    }
  }
  int sa = 0;
  for(int i=1; i<=n; i++) sa += a[i];
  for(int i=1; i<=m; i++) cin >> b[i];
  const int sum = 90000;
  int dp[m+1][sum+1];
  for(int i=0; i<=m; i++) for(int j=0; j<=sum; j++) dp[i][j] = -1e15;
  dp[0][0] = 0;
  int ans = 1e18;
  for(int i=1; i<=m; i++) {
    int bb = min(b[i], n);
    for(int j=0; j<=sum; j++) {
      dp[i][j] = dp[i-1][j];
      if(j >= b[i]) dp[i][j] = max(dp[i][j], dp[i-1][j - b[i]] + bb);
      if(j >= sa && dp[i][j] >= k * n) ans = min(ans, j - sa);
    }
  }
  if(ans == 1e18) cout << "Impossible\n";
  else cout << ans << "\n";

} 
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1;// cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// I don't know geometry.
// Teaming is unfair.

/*

*/

• Subtask 1: 9 / 9
• Subtask 2: 22 / 22
• Subtask 3: 20 / 20
• Subtask 4: 21 / 21
• Subtask 5: 28 / 28