oj.uz

Submission #678491

# Submission time Handle Problem Language Result Execution time Memory
678491 2023-01-06T04:45:59 Z cig32 Self Study (JOI22_ho_t2) C++17
100 / 100
 374 ms 11464 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#ifdef ONLINE_JUDGE
const int MAXN = 3e5 + 10;
#endif
#ifndef ONLINE_JUDGE
const int MAXN = 1029;
#endif
const int MOD = 998244353;
#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;
}
void solve(int tc) {
  int n, m;
  cin >> n >> m;
  int a[n+1], b[n+1];
  for(int i=1; i<=n; i++) {
    cin >> a[i];
  }
  for(int i=1; i<=n; i++) {
    cin >> b[i];
  }
  int lb = 0, rb = 1e18;
  while(lb < rb) {
    ll mi = (lb + rb + 1) >> 1;
    ll free = 0; // free electrons
    ll req = 0;
    for(int i=1; i<=n; i++) {
      ll cnt = (mi + max(a[i], b[i]) - 1) / max(a[i], b[i]);
      ll add = (cnt <= m ? m - cnt : 0ll);
      free += add; 
      if(cnt > m) {
        ll done = m * max(a[i], b[i]);
        ll rem = mi - done;
        req += (rem + b[i] - 1) / b[i];
      }
    }
    if(req <= free) lb = mi;
    else rb = mi - 1;
    
  }
  cout << lb << '\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);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 230 ms 10776 KB Output is correct
12 Correct 239 ms 10904 KB Output is correct
13 Correct 271 ms 8832 KB Output is correct
14 Correct 293 ms 8832 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 374 ms 6200 KB Output is correct
17 Correct 277 ms 11408 KB Output is correct
18 Correct 247 ms 10820 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 374 ms 6200 KB Output is correct
3 Correct 277 ms 11408 KB Output is correct
4 Correct 247 ms 10820 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 119 ms 5568 KB Output is correct
14 Correct 90 ms 3788 KB Output is correct
15 Correct 63 ms 2952 KB Output is correct
16 Correct 51 ms 2428 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 5 ms 468 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 230 ms 10776 KB Output is correct
12 Correct 239 ms 10904 KB Output is correct
13 Correct 271 ms 8832 KB Output is correct
14 Correct 293 ms 8832 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 119 ms 5568 KB Output is correct
24 Correct 90 ms 3788 KB Output is correct
25 Correct 63 ms 2952 KB Output is correct
26 Correct 51 ms 2428 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 5 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 374 ms 6200 KB Output is correct
36 Correct 277 ms 11408 KB Output is correct
37 Correct 247 ms 10820 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 5 ms 468 KB Output is correct
46 Correct 8 ms 656 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 42 ms 2128 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 5 ms 468 KB Output is correct
52 Correct 1 ms 360 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 140 ms 5536 KB Output is correct
56 Correct 84 ms 3168 KB Output is correct
57 Correct 108 ms 3168 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 119 ms 5568 KB Output is correct
10 Correct 90 ms 3788 KB Output is correct
11 Correct 63 ms 2952 KB Output is correct
12 Correct 51 ms 2428 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 7 ms 340 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 374 ms 6200 KB Output is correct
22 Correct 277 ms 11408 KB Output is correct
23 Correct 247 ms 10820 KB Output is correct
24 Correct 47 ms 1948 KB Output is correct
25 Correct 130 ms 5032 KB Output is correct
26 Correct 26 ms 1364 KB Output is correct
27 Correct 246 ms 10780 KB Output is correct
28 Correct 257 ms 10820 KB Output is correct
29 Correct 257 ms 10824 KB Output is correct
30 Correct 257 ms 10776 KB Output is correct
31 Correct 293 ms 10768 KB Output is correct
32 Correct 365 ms 6196 KB Output is correct
33 Correct 258 ms 11464 KB Output is correct
34 Correct 372 ms 6200 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 230 ms 10776 KB Output is correct
12 Correct 239 ms 10904 KB Output is correct
13 Correct 271 ms 8832 KB Output is correct
14 Correct 293 ms 8832 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 119 ms 5568 KB Output is correct
24 Correct 90 ms 3788 KB Output is correct
25 Correct 63 ms 2952 KB Output is correct
26 Correct 51 ms 2428 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 5 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 5 ms 468 KB Output is correct
42 Correct 8 ms 656 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 42 ms 2128 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 5 ms 468 KB Output is correct
48 Correct 1 ms 360 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 140 ms 5536 KB Output is correct
52 Correct 84 ms 3168 KB Output is correct
53 Correct 108 ms 3168 KB Output is correct
54 Correct 47 ms 1948 KB Output is correct
55 Correct 130 ms 5032 KB Output is correct
56 Correct 26 ms 1364 KB Output is correct
57 Correct 246 ms 10780 KB Output is correct
58 Correct 257 ms 10820 KB Output is correct
59 Correct 257 ms 10824 KB Output is correct
60 Correct 257 ms 10776 KB Output is correct
61 Correct 293 ms 10768 KB Output is correct
62 Correct 365 ms 6196 KB Output is correct
63 Correct 258 ms 11464 KB Output is correct
64 Correct 372 ms 6200 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 374 ms 6200 KB Output is correct
67 Correct 277 ms 11408 KB Output is correct
68 Correct 247 ms 10820 KB Output is correct
69 Correct 30 ms 1364 KB Output is correct
70 Correct 8 ms 620 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 39 ms 1764 KB Output is correct
73 Correct 10 ms 688 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 261 ms 10896 KB Output is correct
76 Correct 251 ms 10828 KB Output is correct
77 Correct 274 ms 10832 KB Output is correct
78 Correct 288 ms 10832 KB Output is correct
79 Correct 300 ms 10772 KB Output is correct
80 Correct 279 ms 10836 KB Output is correct
81 Correct 244 ms 8724 KB Output is correct
82 Correct 277 ms 8844 KB Output is correct