oj.uz

Submission #621225

# Submission time Handle Problem Language Result Execution time Memory
621225 2022-08-03T14:54:19 Z slime Uplifting Excursion (BOI22_vault) C++14
40 / 100
 664 ms 223344 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) { // O(m * sqrt(sum(v))), v.size ≤ m^2
  int n = v.size();
  int freq[301];
  for(int i=1; i<=300; i++) freq[i] = 0;
  for(int x: v) freq[x]++;
  int dp[301][m+1];
  for(int i=0; i<301; i++) for(int j=1; j<=m; j++) dp[i][j] = 1e18;
  dp[0][0] = 0;
  for(int i=1; i<=300; i++) {
    if(freq[i] == 0) {
      for(int j=0; j<=m; j++) dp[i][j] = dp[i-1][j]; continue;
    }
    deque<pair<int, int> > dq[i]; // min-deque
    dq[0].push_back({0, 0});
    dp[i][0] = 0;
    for(int j=1; j<=m; j++) {
      while(dq[j % i].size() && dq[j % i].back().first > dp[i-1][j] - j / i) {
        dq[j % i].pop_back();
      }
      dq[j % i].push_back({dp[i-1][j] - j / i, j});
      while(dq[j % i].size() && dq[j % i].front().second < j - i * freq[i]) {
        dq[j % i].pop_front();
      }
      dp[i][j] = min(dp[i-1][j], dq[j % i].front().first + j / i);
    }
  }
  vector<int> res;
  for(int i=0; i<=m; i++) res.push_back((dp[300][i]> 1e16 ? -1: dp[300][i]));
  return res;
}
vector<int> all_max_knapsacks(vector<int> v, int m) { // O(m * sqrt(sum(v))), v.size ≤ m^2
  int n = v.size();
  int freq[301];
  for(int i=1; i<=300; i++) freq[i] = 0;
  for(int x: v) freq[x]++;
  int dp[301][m+1];
  for(int i=0; i<301; i++) for(int j=1; j<=m; j++) dp[i][j] = -1e18;
  dp[0][0] = 0;
  for(int i=1; i<=300; i++) {
    if(freq[i] == 0) {
      for(int j=0; j<=m; j++) dp[i][j] = dp[i-1][j]; continue;
    }
    deque<pair<int, int> > dq[i]; // min-deque
    dq[0].push_back({0, 0});
    dp[i][0] = 0;
    for(int j=1; j<=m; j++) {
      while(dq[j % i].size() && dq[j % i].back().first < dp[i-1][j] - j / i) {
        dq[j % i].pop_back();
      }
      while(dq[j % i].size() && dq[j % i].front().second < j - i * freq[i]) {
        dq[j % i].pop_front();
      }
      if(dq[j % i].empty()) dp[i][j] = dp[i-1][j];
      else dp[i][j] = max(dp[i-1][j], dq[j % i].front().first + j / i);
      dq[j % i].push_back({dp[i-1][j] - j / i, j});
    }
  }
  vector<int> res;
  for(int i=0; i<=m; i++) res.push_back((dp[300][i] < -1e16 ? -1 : dp[300][i]));
  return res;
}
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, m*m);
  outsum = min(outsum, m*m);
  vector<int> resin = all_min_knapsacks(in, insum);
  vector<int> resout = all_max_knapsacks(out, outsum);
  /*
  for(int x: resin) cout << x << " ";
  cout << "\n";
  for(int x: resout) cout << x << " ";
  cout << "\n";
  cout << A << "\n";
  */
  int sm = 0;
  for(int i=0; i<=m; i++) sm += contains[i];
  //cout << sm << "\n";
  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 'std::vector<long long int> all_min_knapsacks(std::vector<long long int>, long long int)':
vault.cpp:75:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   75 |       for(int j=0; j<=m; j++) dp[i][j] = dp[i-1][j]; continue;
      |       ^~~
vault.cpp:75:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   75 |       for(int j=0; j<=m; j++) dp[i][j] = dp[i-1][j]; continue;
      |                                                      ^~~~~~~~
vault.cpp:66:7: warning: unused variable 'n' [-Wunused-variable]
   66 |   int n = v.size();
      |       ^
vault.cpp: In function 'std::vector<long long int> all_max_knapsacks(std::vector<long long int>, long long int)':
vault.cpp:105:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  105 |       for(int j=0; j<=m; j++) dp[i][j] = dp[i-1][j]; continue;
      |       ^~~
vault.cpp:105:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  105 |       for(int j=0; j<=m; j++) dp[i][j] = dp[i-1][j]; continue;
      |                                                      ^~~~~~~~
vault.cpp:96:7: warning: unused variable 'n' [-Wunused-variable]
   96 |   int n = v.size();
      |       ^
vault.cpp: In function 'void solve(long long int)':
vault.cpp:190: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]
  190 |   for(int x=0; x<resout.size(); x++) {
      |                ~^~~~~~~~~~~~~~
vault.cpp:191: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]
  191 |     if(resout[x] != -1 && A + x < resin.size() && resin[A + x] != -1) {
      |                           ~~~~~~^~~~~~~~~~~~~~
vault.cpp:189:7: warning: variable 'id' set but not used [-Wunused-but-set-variable]
  189 |   int id;
      |       ^~

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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 10 ms 9428 KB Output is correct
3 Correct 7 ms 7328 KB Output is correct
4 Correct 10 ms 9428 KB Output is correct
5 Correct 10 ms 9428 KB Output is correct
6 Correct 9 ms 9428 KB Output is correct
7 Correct 9 ms 9496 KB Output is correct
8 Correct 9 ms 9428 KB Output is correct
9 Correct 10 ms 9428 KB Output is correct
10 Correct 11 ms 9556 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 10 ms 9428 KB Output is correct
3 Correct 7 ms 7328 KB Output is correct
4 Correct 10 ms 9428 KB Output is correct
5 Correct 10 ms 9428 KB Output is correct
6 Correct 9 ms 9428 KB Output is correct
7 Correct 9 ms 9496 KB Output is correct
8 Correct 9 ms 9428 KB Output is correct
9 Correct 10 ms 9428 KB Output is correct
10 Correct 11 ms 9556 KB Output is correct
11 Incorrect 7 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 10 ms 9428 KB Output is correct
3 Correct 7 ms 7328 KB Output is correct
4 Correct 10 ms 9428 KB Output is correct
5 Correct 10 ms 9428 KB Output is correct
6 Correct 9 ms 9428 KB Output is correct
7 Correct 9 ms 9496 KB Output is correct
8 Correct 9 ms 9428 KB Output is correct
9 Correct 10 ms 9428 KB Output is correct
10 Correct 11 ms 9556 KB Output is correct
11 Correct 8 ms 7372 KB Output is correct
12 Correct 10 ms 9428 KB Output is correct
13 Correct 8 ms 7368 KB Output is correct
14 Correct 11 ms 9444 KB Output is correct
15 Correct 10 ms 9428 KB Output is correct
16 Correct 11 ms 9428 KB Output is correct
17 Correct 11 ms 9428 KB Output is correct
18 Correct 10 ms 9428 KB Output is correct
19 Correct 10 ms 9448 KB Output is correct
20 Correct 10 ms 9428 KB Output is correct
21 Correct 12 ms 13076 KB Output is correct
22 Correct 13 ms 12884 KB Output is correct
23 Correct 14 ms 13396 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 14 ms 13392 KB Output is correct
26 Correct 15 ms 13348 KB Output is correct
27 Correct 15 ms 13316 KB Output is correct
28 Correct 15 ms 13396 KB Output is correct

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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 10 ms 9428 KB Output is correct
3 Correct 7 ms 7328 KB Output is correct
4 Correct 10 ms 9428 KB Output is correct
5 Correct 10 ms 9428 KB Output is correct
6 Correct 9 ms 9428 KB Output is correct
7 Correct 9 ms 9496 KB Output is correct
8 Correct 9 ms 9428 KB Output is correct
9 Correct 10 ms 9428 KB Output is correct
10 Correct 11 ms 9556 KB Output is correct
11 Correct 8 ms 7372 KB Output is correct
12 Correct 10 ms 9428 KB Output is correct
13 Correct 8 ms 7368 KB Output is correct
14 Correct 11 ms 9444 KB Output is correct
15 Correct 10 ms 9428 KB Output is correct
16 Correct 11 ms 9428 KB Output is correct
17 Correct 11 ms 9428 KB Output is correct
18 Correct 10 ms 9428 KB Output is correct
19 Correct 10 ms 9448 KB Output is correct
20 Correct 10 ms 9428 KB Output is correct
21 Correct 12 ms 13076 KB Output is correct
22 Correct 13 ms 12884 KB Output is correct
23 Correct 14 ms 13396 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 14 ms 13392 KB Output is correct
26 Correct 15 ms 13348 KB Output is correct
27 Correct 15 ms 13316 KB Output is correct
28 Correct 15 ms 13396 KB Output is correct
29 Correct 9 ms 7368 KB Output is correct
30 Correct 11 ms 9428 KB Output is correct
31 Correct 8 ms 7380 KB Output is correct
32 Correct 12 ms 9428 KB Output is correct
33 Correct 10 ms 9548 KB Output is correct
34 Correct 10 ms 9428 KB Output is correct
35 Correct 11 ms 9428 KB Output is correct
36 Correct 10 ms 9420 KB Output is correct
37 Correct 11 ms 9492 KB Output is correct
38 Correct 12 ms 9440 KB Output is correct
39 Correct 15 ms 13012 KB Output is correct
40 Correct 14 ms 12800 KB Output is correct
41 Correct 14 ms 13396 KB Output is correct
42 Correct 7 ms 7372 KB Output is correct
43 Correct 14 ms 13344 KB Output is correct
44 Correct 14 ms 13396 KB Output is correct
45 Correct 14 ms 13360 KB Output is correct
46 Correct 16 ms 13396 KB Output is correct
47 Correct 33 ms 31064 KB Output is correct
48 Correct 35 ms 30264 KB Output is correct
49 Correct 58 ms 31432 KB Output is correct
50 Correct 9 ms 7380 KB Output is correct
51 Correct 43 ms 31436 KB Output is correct
52 Correct 50 ms 31420 KB Output is correct
53 Correct 40 ms 31228 KB Output is correct
54 Correct 44 ms 31340 KB Output is correct

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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 10 ms 9428 KB Output is correct
3 Correct 7 ms 7328 KB Output is correct
4 Correct 10 ms 9428 KB Output is correct
5 Correct 10 ms 9428 KB Output is correct
6 Correct 9 ms 9428 KB Output is correct
7 Correct 9 ms 9496 KB Output is correct
8 Correct 9 ms 9428 KB Output is correct
9 Correct 10 ms 9428 KB Output is correct
10 Correct 11 ms 9556 KB Output is correct
11 Correct 8 ms 7372 KB Output is correct
12 Correct 10 ms 9428 KB Output is correct
13 Correct 8 ms 7368 KB Output is correct
14 Correct 11 ms 9444 KB Output is correct
15 Correct 10 ms 9428 KB Output is correct
16 Correct 11 ms 9428 KB Output is correct
17 Correct 11 ms 9428 KB Output is correct
18 Correct 10 ms 9428 KB Output is correct
19 Correct 10 ms 9448 KB Output is correct
20 Correct 10 ms 9428 KB Output is correct
21 Correct 12 ms 13076 KB Output is correct
22 Correct 13 ms 12884 KB Output is correct
23 Correct 14 ms 13396 KB Output is correct
24 Correct 7 ms 7380 KB Output is correct
25 Correct 14 ms 13392 KB Output is correct
26 Correct 15 ms 13348 KB Output is correct
27 Correct 15 ms 13316 KB Output is correct
28 Correct 15 ms 13396 KB Output is correct
29 Correct 9 ms 7368 KB Output is correct
30 Correct 11 ms 9428 KB Output is correct
31 Correct 8 ms 7380 KB Output is correct
32 Correct 12 ms 9428 KB Output is correct
33 Correct 10 ms 9548 KB Output is correct
34 Correct 10 ms 9428 KB Output is correct
35 Correct 11 ms 9428 KB Output is correct
36 Correct 10 ms 9420 KB Output is correct
37 Correct 11 ms 9492 KB Output is correct
38 Correct 12 ms 9440 KB Output is correct
39 Correct 15 ms 13012 KB Output is correct
40 Correct 14 ms 12800 KB Output is correct
41 Correct 14 ms 13396 KB Output is correct
42 Correct 7 ms 7372 KB Output is correct
43 Correct 14 ms 13344 KB Output is correct
44 Correct 14 ms 13396 KB Output is correct
45 Correct 14 ms 13360 KB Output is correct
46 Correct 16 ms 13396 KB Output is correct
47 Correct 33 ms 31064 KB Output is correct
48 Correct 35 ms 30264 KB Output is correct
49 Correct 58 ms 31432 KB Output is correct
50 Correct 9 ms 7380 KB Output is correct
51 Correct 43 ms 31436 KB Output is correct
52 Correct 50 ms 31420 KB Output is correct
53 Correct 40 ms 31228 KB Output is correct
54 Correct 44 ms 31340 KB Output is correct
55 Correct 7 ms 7320 KB Output is correct
56 Correct 9 ms 9548 KB Output is correct
57 Correct 8 ms 7352 KB Output is correct
58 Correct 12 ms 9548 KB Output is correct
59 Correct 12 ms 9580 KB Output is correct
60 Correct 10 ms 9428 KB Output is correct
61 Correct 11 ms 9464 KB Output is correct
62 Correct 10 ms 9432 KB Output is correct
63 Correct 10 ms 9420 KB Output is correct
64 Correct 10 ms 9532 KB Output is correct
65 Correct 13 ms 13036 KB Output is correct
66 Correct 12 ms 12884 KB Output is correct
67 Correct 15 ms 13396 KB Output is correct
68 Correct 8 ms 7380 KB Output is correct
69 Correct 16 ms 13436 KB Output is correct
70 Correct 15 ms 13396 KB Output is correct
71 Correct 14 ms 13312 KB Output is correct
72 Correct 14 ms 13376 KB Output is correct
73 Correct 31 ms 31064 KB Output is correct
74 Correct 31 ms 30284 KB Output is correct
75 Correct 44 ms 31440 KB Output is correct
76 Correct 8 ms 7380 KB Output is correct
77 Correct 54 ms 31436 KB Output is correct
78 Correct 49 ms 31376 KB Output is correct
79 Correct 42 ms 31180 KB Output is correct
80 Correct 44 ms 31308 KB Output is correct
81 Correct 651 ms 223292 KB Output is correct
82 Correct 9 ms 7752 KB Output is correct
83 Correct 664 ms 223080 KB Output is correct
84 Correct 634 ms 223344 KB Output is correct
85 Correct 199 ms 222484 KB Output is correct
86 Correct 208 ms 222032 KB Output is correct
87 Correct 571 ms 223116 KB Output is correct

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 -