oj.uz

Submission #620102

# Submission time Handle Problem Language Result Execution time Memory
620102 2022-08-02T23:29:05 Z slime Uplifting Excursion (BOI22_vault) C++14
30 / 100
 5000 ms 11220 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> all_min_knapsacks(vector<int> v, int m) {
  int n = v.size();
  int dp[2][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 & 1][0] = 0;
    for(int j=1; j<=m; j++) dp[i & 1][j] = 1e18;
    for(int j=1; j<=m; j++) {
      dp[i & 1][j] = dp[(i-1) & 1][j];
      if(j >= v[i]) dp[i & 1][j] = min(dp[i & 1][j], dp[(i-1) & 1][j-v[i]] + 1);
    }
  }
  vector<int> soln;
  for(int i=0; i<=m; i++) {
    if(dp[(n-1) & 1][i] == 1e18) soln.push_back(-1);
    else soln.push_back(dp[(n-1) & 1][i]);
  }
  return soln;

}
vector<int> all_max_knapsacks(vector<int> v, int m) {
  int n = v.size();
  int dp[2][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 & 1][0] = 0;
    for(int j=1; j<=m; j++) dp[i & 1][j] = -1e18;
    for(int j=1; j<=m; j++) {
      dp[i & 1][j] = dp[(i-1) & 1][j];
      if(j >= v[i]) dp[i & 1][j] = max(dp[i & 1][j], dp[(i-1) & 1][j-v[i]] + 1);
    }
  }
  vector<int> soln;
  for(int i=0; i<=m; i++) {
    if(dp[(n-1) & 1][i] == -1e18) soln.push_back(-1);
    else soln.push_back(dp[(n-1) & 1][i]);
  }
  return soln;

}
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(i == 0) {
      if(j > 0) {
        sol.push_back(v[i]);
      }
      break;
    }
    if(j >= v[i] && dp[i][j] == dp[i-1][j-v[i]] + 1) {
      sol.push_back(v[i]);
      j -= v[i];
    }
  }
  return sol;

}
vector<int> max_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] = max(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(i == 0) {
      if(j > 0) {
        sol.push_back(v[i]);
      }
      break;
    }
    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;
  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 contains[m+1];
  for(int i=0; i<=m; i++) contains[i] = 0;
  int sum = 0;
  contains[0] = a[0];
  if(l < 0) {
    cout << "impossible\n"; return;
  }
  if(l == 0) {
    cout << a[0] << "\n"; return;
  }
  for(int i=1; i<=m; i++) {
    int owo = min(a[i], (l - sum) / i);
    sum += owo * i;
    contains[i] = owo;
    if(sum == l) break;
    if(owo < a[i] && sum + i > l) {
      sum += i;
      contains[i]++;
      break;
    }
  }
  if(sum < l) {
    cout << "impossible\n"; return;
  }
  if(sum == l) {
    int sm = 0;
    for(int i=0; i<=m; i++) sm += contains[i];
    cout << sm << "\n"; return;
  }
  vector<int> in, out;
  for(int i=1; i<=m; i++) {
    for(int j=0; j<min(m, contains[i]); j++) in.push_back(i);
    for(int j=0; j<min(m, a[i] - contains[i]); j++) out.push_back(i);
  }
  if(in.empty() || out.empty()) {
    cout << "impossible\n"; return;
  }
  int A = sum - l;
  int insum = 0, outsum = 0;
  for(int x: in ) insum += x;
  for(int x: out ) outsum += x;
  insum = min(insum, 2*m*m);
  outsum = min(outsum, m*m);
  vector<int> resin = all_min_knapsacks(in, insum);
  vector<int> resout = all_max_knapsacks(out, outsum);
  int sm = 0;
  for(int i=0; i<=m; i++) sm += contains[i];
  int ans = -1;
  int id;
  for(int x=0; x<resout.size(); x++) {
    if(resout[x] != -1 && A + x < resin.size() && resin[A + x] != -1) {
      if(sm - resin[A + x] + resout[x] > ans) {
        ans = sm - resin[A + x] + resout[x];
        id = x;
      }
    }
  }
  //vector<int> mi = min_knapsack(in, A + x);
  //vector<int> ma = max_knapsack(out, x);
  cout << (ans == -1 ? "impossible" : to_string(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.

/*
5 16
0 0 0 0 0 0 0 0 3 2 1
*/

Compilation message

vault.cpp: In function 'void solve(long long int)':
vault.cpp:226:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  226 |   for(int x=0; x<resout.size(); x++) {
      |                ~^~~~~~~~~~~~~~
vault.cpp:227:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  227 |     if(resout[x] != -1 && A + x < resin.size() && resin[A + x] != -1) {
      |                           ~~~~~~^~~~~~~~~~~~~~
vault.cpp:225:7: warning: variable 'id' set but not used [-Wunused-but-set-variable]
  225 |   int id;
      |       ^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 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 7 ms 7252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 9 ms 7408 KB Output is correct
3 Correct 7 ms 7252 KB Output is correct
4 Correct 10 ms 7380 KB Output is correct
5 Correct 11 ms 7424 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7340 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 9 ms 7348 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 9 ms 7408 KB Output is correct
3 Correct 7 ms 7252 KB Output is correct
4 Correct 10 ms 7380 KB Output is correct
5 Correct 11 ms 7424 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7340 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 9 ms 7348 KB Output is correct
11 Incorrect 8 ms 7252 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 9 ms 7408 KB Output is correct
3 Correct 7 ms 7252 KB Output is correct
4 Correct 10 ms 7380 KB Output is correct
5 Correct 11 ms 7424 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7340 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 9 ms 7348 KB Output is correct
11 Correct 7 ms 7252 KB Output is correct
12 Correct 9 ms 7344 KB Output is correct
13 Correct 8 ms 7296 KB Output is correct
14 Correct 9 ms 7376 KB Output is correct
15 Correct 10 ms 7380 KB Output is correct
16 Correct 10 ms 7380 KB Output is correct
17 Correct 7 ms 7380 KB Output is correct
18 Correct 9 ms 7380 KB Output is correct
19 Correct 10 ms 7396 KB Output is correct
20 Correct 9 ms 7384 KB Output is correct
21 Correct 8 ms 7380 KB Output is correct
22 Correct 8 ms 7380 KB Output is correct
23 Correct 18 ms 7556 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 19 ms 7552 KB Output is correct
26 Correct 22 ms 7508 KB Output is correct
27 Correct 13 ms 7380 KB Output is correct
28 Correct 20 ms 7544 KB Output is correct

Subtask #4-2
0 / 10.0

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

Subtask #5-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 9 ms 7408 KB Output is correct
3 Correct 7 ms 7252 KB Output is correct
4 Correct 10 ms 7380 KB Output is correct
5 Correct 11 ms 7424 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7340 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 9 ms 7348 KB Output is correct
11 Correct 7 ms 7252 KB Output is correct
12 Correct 9 ms 7344 KB Output is correct
13 Correct 8 ms 7296 KB Output is correct
14 Correct 9 ms 7376 KB Output is correct
15 Correct 10 ms 7380 KB Output is correct
16 Correct 10 ms 7380 KB Output is correct
17 Correct 7 ms 7380 KB Output is correct
18 Correct 9 ms 7380 KB Output is correct
19 Correct 10 ms 7396 KB Output is correct
20 Correct 9 ms 7384 KB Output is correct
21 Correct 8 ms 7380 KB Output is correct
22 Correct 8 ms 7380 KB Output is correct
23 Correct 18 ms 7556 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 19 ms 7552 KB Output is correct
26 Correct 22 ms 7508 KB Output is correct
27 Correct 13 ms 7380 KB Output is correct
28 Correct 20 ms 7544 KB Output is correct
29 Correct 7 ms 7252 KB Output is correct
30 Correct 9 ms 7380 KB Output is correct
31 Correct 9 ms 7252 KB Output is correct
32 Correct 9 ms 7320 KB Output is correct
33 Correct 9 ms 7364 KB Output is correct
34 Correct 9 ms 7312 KB Output is correct
35 Correct 7 ms 7388 KB Output is correct
36 Correct 7 ms 7380 KB Output is correct
37 Correct 8 ms 7380 KB Output is correct
38 Correct 9 ms 7380 KB Output is correct
39 Correct 8 ms 7380 KB Output is correct
40 Correct 8 ms 7416 KB Output is correct
41 Correct 18 ms 7508 KB Output is correct
42 Correct 9 ms 7268 KB Output is correct
43 Correct 20 ms 7472 KB Output is correct
44 Correct 21 ms 7476 KB Output is correct
45 Correct 13 ms 7380 KB Output is correct
46 Correct 20 ms 7508 KB Output is correct
47 Correct 11 ms 7868 KB Output is correct
48 Correct 10 ms 7764 KB Output is correct
49 Correct 191 ms 8160 KB Output is correct
50 Correct 8 ms 7392 KB Output is correct
51 Correct 188 ms 8172 KB Output is correct
52 Correct 221 ms 8092 KB Output is correct
53 Correct 91 ms 7812 KB Output is correct
54 Correct 157 ms 8152 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 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 9 ms 7408 KB Output is correct
3 Correct 7 ms 7252 KB Output is correct
4 Correct 10 ms 7380 KB Output is correct
5 Correct 11 ms 7424 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7340 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 9 ms 7348 KB Output is correct
11 Correct 7 ms 7252 KB Output is correct
12 Correct 9 ms 7344 KB Output is correct
13 Correct 8 ms 7296 KB Output is correct
14 Correct 9 ms 7376 KB Output is correct
15 Correct 10 ms 7380 KB Output is correct
16 Correct 10 ms 7380 KB Output is correct
17 Correct 7 ms 7380 KB Output is correct
18 Correct 9 ms 7380 KB Output is correct
19 Correct 10 ms 7396 KB Output is correct
20 Correct 9 ms 7384 KB Output is correct
21 Correct 8 ms 7380 KB Output is correct
22 Correct 8 ms 7380 KB Output is correct
23 Correct 18 ms 7556 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 19 ms 7552 KB Output is correct
26 Correct 22 ms 7508 KB Output is correct
27 Correct 13 ms 7380 KB Output is correct
28 Correct 20 ms 7544 KB Output is correct
29 Correct 7 ms 7252 KB Output is correct
30 Correct 9 ms 7380 KB Output is correct
31 Correct 9 ms 7252 KB Output is correct
32 Correct 9 ms 7320 KB Output is correct
33 Correct 9 ms 7364 KB Output is correct
34 Correct 9 ms 7312 KB Output is correct
35 Correct 7 ms 7388 KB Output is correct
36 Correct 7 ms 7380 KB Output is correct
37 Correct 8 ms 7380 KB Output is correct
38 Correct 9 ms 7380 KB Output is correct
39 Correct 8 ms 7380 KB Output is correct
40 Correct 8 ms 7416 KB Output is correct
41 Correct 18 ms 7508 KB Output is correct
42 Correct 9 ms 7268 KB Output is correct
43 Correct 20 ms 7472 KB Output is correct
44 Correct 21 ms 7476 KB Output is correct
45 Correct 13 ms 7380 KB Output is correct
46 Correct 20 ms 7508 KB Output is correct
47 Correct 11 ms 7868 KB Output is correct
48 Correct 10 ms 7764 KB Output is correct
49 Correct 191 ms 8160 KB Output is correct
50 Correct 8 ms 7392 KB Output is correct
51 Correct 188 ms 8172 KB Output is correct
52 Correct 221 ms 8092 KB Output is correct
53 Correct 91 ms 7812 KB Output is correct
54 Correct 157 ms 8152 KB Output is correct
55 Correct 8 ms 7308 KB Output is correct
56 Correct 9 ms 7408 KB Output is correct
57 Correct 7 ms 7256 KB Output is correct
58 Correct 9 ms 7440 KB Output is correct
59 Correct 12 ms 7380 KB Output is correct
60 Correct 9 ms 7320 KB Output is correct
61 Correct 8 ms 7380 KB Output is correct
62 Correct 8 ms 7360 KB Output is correct
63 Correct 8 ms 7380 KB Output is correct
64 Correct 8 ms 7316 KB Output is correct
65 Correct 8 ms 7380 KB Output is correct
66 Correct 10 ms 7528 KB Output is correct
67 Correct 18 ms 7448 KB Output is correct
68 Correct 7 ms 7380 KB Output is correct
69 Correct 19 ms 7488 KB Output is correct
70 Correct 20 ms 7484 KB Output is correct
71 Correct 16 ms 7560 KB Output is correct
72 Correct 20 ms 7508 KB Output is correct
73 Correct 10 ms 7776 KB Output is correct
74 Correct 11 ms 7788 KB Output is correct
75 Correct 193 ms 8160 KB Output is correct
76 Correct 8 ms 7380 KB Output is correct
77 Correct 169 ms 8092 KB Output is correct
78 Correct 232 ms 8160 KB Output is correct
79 Correct 91 ms 7796 KB Output is correct
80 Correct 154 ms 8144 KB Output is correct
81 Execution timed out 5067 ms 11220 KB Time limit exceeded
82 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

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