oj.uz

Submission #579467

# Submission time Handle Problem Language Result Execution time Memory
579467 2022-06-19T08:18:26 Z slime Self Study (JOI22_ho_t2) C++14
100 / 100
 373 ms 10836 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);
}
// I don't know geometry.
// Teaming is unfair.

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 340 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 484 KB Output is correct
11 Correct 236 ms 10768 KB Output is correct
12 Correct 251 ms 10824 KB Output is correct
13 Correct 263 ms 8844 KB Output is correct
14 Correct 294 ms 8852 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 372 ms 5036 KB Output is correct
17 Correct 282 ms 5020 KB Output is correct
18 Correct 234 ms 5020 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 372 ms 5036 KB Output is correct
3 Correct 282 ms 5020 KB Output is correct
4 Correct 234 ms 5020 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 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 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 120 ms 2672 KB Output is correct
14 Correct 88 ms 1908 KB Output is correct
15 Correct 59 ms 1492 KB Output is correct
16 Correct 49 ms 1236 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 5 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 340 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 484 KB Output is correct
11 Correct 236 ms 10768 KB Output is correct
12 Correct 251 ms 10824 KB Output is correct
13 Correct 263 ms 8844 KB Output is correct
14 Correct 294 ms 8852 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 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 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 120 ms 2672 KB Output is correct
24 Correct 88 ms 1908 KB Output is correct
25 Correct 59 ms 1492 KB Output is correct
26 Correct 49 ms 1236 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 5 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 372 ms 5036 KB Output is correct
36 Correct 282 ms 5020 KB Output is correct
37 Correct 234 ms 5020 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 344 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 0 ms 340 KB Output is correct
45 Correct 5 ms 468 KB Output is correct
46 Correct 8 ms 660 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 46 ms 2148 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 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 131 ms 5464 KB Output is correct
56 Correct 86 ms 3156 KB Output is correct
57 Correct 100 ms 3044 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 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 0 ms 340 KB Output is correct
9 Correct 120 ms 2672 KB Output is correct
10 Correct 88 ms 1908 KB Output is correct
11 Correct 59 ms 1492 KB Output is correct
12 Correct 49 ms 1236 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 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 6 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 372 ms 5036 KB Output is correct
22 Correct 282 ms 5020 KB Output is correct
23 Correct 234 ms 5020 KB Output is correct
24 Correct 39 ms 1048 KB Output is correct
25 Correct 117 ms 2432 KB Output is correct
26 Correct 29 ms 724 KB Output is correct
27 Correct 243 ms 5024 KB Output is correct
28 Correct 254 ms 4948 KB Output is correct
29 Correct 249 ms 5020 KB Output is correct
30 Correct 240 ms 5068 KB Output is correct
31 Correct 235 ms 5020 KB Output is correct
32 Correct 356 ms 4948 KB Output is correct
33 Correct 244 ms 5016 KB Output is correct
34 Correct 373 ms 5032 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 340 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 484 KB Output is correct
11 Correct 236 ms 10768 KB Output is correct
12 Correct 251 ms 10824 KB Output is correct
13 Correct 263 ms 8844 KB Output is correct
14 Correct 294 ms 8852 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 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 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 120 ms 2672 KB Output is correct
24 Correct 88 ms 1908 KB Output is correct
25 Correct 59 ms 1492 KB Output is correct
26 Correct 49 ms 1236 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 5 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 344 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 0 ms 340 KB Output is correct
41 Correct 5 ms 468 KB Output is correct
42 Correct 8 ms 660 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 46 ms 2148 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 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 131 ms 5464 KB Output is correct
52 Correct 86 ms 3156 KB Output is correct
53 Correct 100 ms 3044 KB Output is correct
54 Correct 39 ms 1048 KB Output is correct
55 Correct 117 ms 2432 KB Output is correct
56 Correct 29 ms 724 KB Output is correct
57 Correct 243 ms 5024 KB Output is correct
58 Correct 254 ms 4948 KB Output is correct
59 Correct 249 ms 5020 KB Output is correct
60 Correct 240 ms 5068 KB Output is correct
61 Correct 235 ms 5020 KB Output is correct
62 Correct 356 ms 4948 KB Output is correct
63 Correct 244 ms 5016 KB Output is correct
64 Correct 373 ms 5032 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 372 ms 5036 KB Output is correct
67 Correct 282 ms 5020 KB Output is correct
68 Correct 234 ms 5020 KB Output is correct
69 Correct 30 ms 1364 KB Output is correct
70 Correct 8 ms 596 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 41 ms 1764 KB Output is correct
73 Correct 10 ms 688 KB Output is correct
74 Correct 2 ms 340 KB Output is correct
75 Correct 249 ms 10764 KB Output is correct
76 Correct 254 ms 10828 KB Output is correct
77 Correct 246 ms 10776 KB Output is correct
78 Correct 260 ms 10776 KB Output is correct
79 Correct 268 ms 10776 KB Output is correct
80 Correct 258 ms 10836 KB Output is correct
81 Correct 229 ms 8840 KB Output is correct
82 Correct 239 ms 8840 KB Output is correct