oj.uz

Submission #1094454

# Submission time Handle Problem Language Result Execution time Memory
1094454 2024-09-29T16:24:59 Z stefanopulos Self Study (JOI22_ho_t2) C++17
0 / 100
 135 ms 10904 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const ll inf = 1e18 + 5;
const int mxN = 300005; 

int n, m;
ll A[mxN];
ll B[mxN];

bool check(ll X){

    ll uk = 0;
    ff(i,1,n){
        if(A[i] >= B[i]){
            ll a = min((ll)m, (X + A[i] - 1) / A[i]);
            
            ll Y = X - 1ll * a * A[i];
            ll b = max(0ll, (Y + B[i] - 1) / B[i]);

            uk += a + b;

        }
        else{
            ll b = (X + B[i] - 1) / B[i];
            uk += b;
        }
    }

    return uk <= 1ll * n * m;

}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m;
    ff(i,1,n)cin >> A[i];
    ff(i,1,n)cin >> B[i];

    ll l = 1, r = inf, ans = 0;
    while(l <= r){
        ll mid = l + (r - l) / 2;
        if(check(mid)){
            ans = mid;
            l = mid + 1;
        }
        else r = mid - 1;
    }

    cout << ans << '\n';

    return 0;
}
/*

3 3
19 4 5
2 6 2

2 1
9 7
2 6

5 60000
630510219 369411957 874325200 990002527 567203997
438920902 634940661 593780254 315929832 420627496

4 25
1 2 3 4
1 2 3 4

// probati bojenje sahovski
*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 131 ms 10904 KB Output is correct
12 Correct 126 ms 10848 KB Output is correct
13 Correct 75 ms 8788 KB Output is correct
14 Incorrect 135 ms 8784 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 64 ms 5720 KB Output is correct
10 Correct 42 ms 3928 KB Output is correct
11 Correct 32 ms 4444 KB Output is correct
12 Correct 25 ms 2396 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Incorrect 2 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 131 ms 10904 KB Output is correct
12 Correct 126 ms 10848 KB Output is correct
13 Correct 75 ms 8788 KB Output is correct
14 Incorrect 135 ms 8784 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 64 ms 5720 KB Output is correct
10 Correct 42 ms 3928 KB Output is correct
11 Correct 32 ms 4444 KB Output is correct
12 Correct 25 ms 2396 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Incorrect 2 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 131 ms 10904 KB Output is correct
12 Correct 126 ms 10848 KB Output is correct
13 Correct 75 ms 8788 KB Output is correct
14 Incorrect 135 ms 8784 KB Output isn't correct
15 Halted 0 ms 0 KB -