oj.uz

Submission #824383

# Submission time Handle Problem Language Result Execution time Memory
824383 2023-08-14T05:05:51 Z PoonYaPat Self Study (JOI22_ho_t2) C++14
0 / 100
 0 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long double ll;

ll n,m,a[300005],b[300005];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for (int i=1; i<=n; ++i) cin>>a[i];
    for (int i=1; i<=n; ++i) cin>>b[i], a[i]=max(a[i],b[i]);

    ll l=0,r=1e18;
    while (l<r) {
        ll mid=(l+r+1)/2;
        ll fre=0,want=0;
        for (int i=1; i<=n; ++i) {
            ll use=(mid+a[i]-1)/a[i];
            if (use<=m) fre+=(m-use);
            else want+=(mid-m*a[i]+b[i]-1)/b[i];
        }
        if (fre>=want) l=mid;
        else r=mid-1;
    }
    cout<<l;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -