oj.uz

Submission #617342

# Submission time Handle Problem Language Result Execution time Memory
617342 2022-08-01T10:54:46 Z slime Uplifting Excursion (BOI22_vault) C++14
0 / 100
 14 ms 14676 KB 
 #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;
}
vector<int> min_knapsack(vector<int> v, int m) {
  int n = v.size();
  int dp[n][m+1];
  for(int i=0; i<=m; i++) dp[0][i] = 1e18;
  dp[0][0] = 0;
  dp[0][v[0]] = 1;
  for(int i=1; i<n; i++) {
    dp[i][0] = 0;
    for(int j=1; j<=m; j++) {
      dp[i][j] = dp[i-1][j];
      if(j >= v[i]) dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + 1);
    }
  }
  if(dp[n-1][m] == 1e18) return {};
  vector<int> sol;
  int j = m;
  for(int i=n-1; i>=0; i--) {
    if(j >= v[i] && dp[i][j] == dp[i-1][j-v[i]] + 1) {
      sol.push_back(v[i]);
      j -= v[i];
    }
  }
  return sol;

}
void solve(int tc) {
  int m, l;
  cin >> m >> l;
  if(l < 0) {
    cout << "impossible\n"; return;
  }
  int a[m+1];
  for(int i=0; i<m; i++) {
    int x; cin >> x;
  }
  for(int i=0; i<=m; i++) {
    cin >> a[i];
  }
  int s = 0;
  int t = a[0];
  int inc[m+1];
  for(int i=0; i<=m; i++) inc[i] = 0;
  inc[0] = a[0];
  for(int i=1; i<=m; i++) {
    if((l - s) % i == 0 || s + a[i] * i < l) {
      int n = (l - s) / i;
      n = min(n, a[i]);
      s += n * i;
      t += n;
      inc[i] = n;
      if(s == l) {
        cout << t <<"\n"; return;
      }
      continue;
    }
    int hypo = (l - s + i - 1) / i;
    int res = hypo * i + s;
    assert(res > l);
    int tar = res - l;
    vector<int> elements;
    for(int j=1; j<i; j++) {
      for(int k=1; k*j<=tar && k <= inc[j]; k++) {
        elements.push_back(j);
      }
    }
    if(elements.size() > 100000) return;
    vector<int> vt = min_knapsack(elements, tar);
    if(vt.empty()) {
      hypo = max(0ll, hypo - 1);
      s += hypo * i;
      t += hypo;
      inc[i] = hypo;
      continue;
    }

    // update s, t, inc
    for(int x: vt) {
      inc[x]--;
      s -= x;
      t--;
    }
    s += hypo * i;
    t += hypo;
    inc[i] = hypo;
    assert(s == l);
    cout << t << "\n"; 
    return;
  }
  cout <<"impossible\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
0 / 5.0

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

Subtask #2
0 / 15.0

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

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7248 KB Output is correct
3 Correct 8 ms 7364 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 8 ms 7252 KB Output is correct
7 Runtime error 14 ms 14676 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7248 KB Output is correct
3 Correct 8 ms 7364 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 8 ms 7252 KB Output is correct
7 Runtime error 14 ms 14676 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7248 KB Output is correct
3 Correct 8 ms 7364 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 8 ms 7252 KB Output is correct
7 Runtime error 14 ms 14676 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

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

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7248 KB Output is correct
3 Correct 8 ms 7364 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 8 ms 7252 KB Output is correct
7 Runtime error 14 ms 14676 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

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

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 8 ms 7248 KB Output is correct
3 Correct 8 ms 7364 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 8 ms 7252 KB Output is correct
7 Runtime error 14 ms 14676 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

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