oj.uz

Submission #805366

# Submission time Handle Problem Language Result Execution time Memory
805366 2023-08-03T15:49:22 Z vjudge1 Self Study (JOI22_ho_t2) C++17
0 / 100
 316 ms 6172 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 3e5 + 10;
ll n, m;
ll A[N], B[N];

ll divi(ll a, ll b) {
    return (a + b - 1) / b;
}

bool check(ll x) {
    ll s = 0;
    for(int i = 0; i < n; i++) {
        if(B[i] >= A[i]) {
            s += divi(x, B[i]);
        } else {
            ll t = min(m, divi(x, A[i]));
            s += t + divi(max(x - t * A[i], 0ll), B[i]);
        }
    }
    return (s <= n * m);
}
const ll INF = 1000000000000000;
ll solve() {
    ll l = 0, r = INF;
    while(r - l > 1) {
        ll mid = (l + r) / 2;
        if(check(mid)) l = mid;
        else r = mid;
    }
    return l;
}

mt19937 rnd(14941);
void gen() {
    for(int i = 0; i < n; i++)  
        A[i] = rnd();
    for(int i = 0; i < n; i++)  
        B[i] = rnd();
}
ll stupid() {
    ll mx = (ll)1e16;
    for(int i = 0; i < n; i++)
        mx = min(mx, max(A[i], B[i]));
    return mx;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0; i < n; i++) 
        cin >> A[i];
    for(int i = 0; i < n; i++) 
        cin >> B[i];
    cout << solve();
    // int t = 1000;
    // do {
    //     gen();
    //     t--;
    // }
    // while(stupid() == solve() && t);
    // for(int i = 0; i < n; i++) 
    //     cout << A[i] << ' ';
    // cout << '\n';
    // for(int i = 0; i < n; i++) 
    //     cout << B[i] << ' ';
    // cout << '\n';
    // cout << "slow: " << stupid() << '\n';
    // cout << "fast: " << solve() << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 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 1 ms 336 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 159 ms 5128 KB Output is correct
12 Correct 156 ms 5128 KB Output is correct
13 Correct 110 ms 5132 KB Output is correct
14 Incorrect 316 ms 5136 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 60 ms 2764 KB Output is correct
10 Correct 40 ms 2012 KB Output is correct
11 Correct 31 ms 1616 KB Output is correct
12 Correct 25 ms 1384 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Incorrect 205 ms 6172 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 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 1 ms 336 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 159 ms 5128 KB Output is correct
12 Correct 156 ms 5128 KB Output is correct
13 Correct 110 ms 5132 KB Output is correct
14 Incorrect 316 ms 5136 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 60 ms 2764 KB Output is correct
10 Correct 40 ms 2012 KB Output is correct
11 Correct 31 ms 1616 KB Output is correct
12 Correct 25 ms 1384 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Incorrect 205 ms 6172 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 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 1 ms 336 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 159 ms 5128 KB Output is correct
12 Correct 156 ms 5128 KB Output is correct
13 Correct 110 ms 5132 KB Output is correct
14 Incorrect 316 ms 5136 KB Output isn't correct
15 Halted 0 ms 0 KB -