oj.uz

답안 #529422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529422 2022-02-23T02:06:29 Z wiwiho Self Study (JOI22_ho_t2) C++14
0 / 100
 1 ms 452 KB 
#include <bits/stdc++.h>

#define iter(a) a.begin(), a.end()

using namespace std;

typedef long long ll;

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

int n;
ll m;
vector<ll> a, b;

ll tans;

bool check(ll mn){
    ll cnt = 0;
    for(int i = 1; i <= n; i++){
        ll need = iceil(mn, a[i]);
        if(need < m){
            cnt += m - need;
            assert(false);
            continue;
        }
        ll tmp = mn - m * a[i];
        cnt -= iceil(tmp, b[i]);
    }

    //if(cnt >= 0) assert(mn <= tans);
    return cnt >= 0;
}

mt19937 rnd(123123);
uniform_int_distribution<int> ud(48763, 123456);

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m;
    a.resize(n + 1);
    b.resize(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) cin >> b[i];

    //for(int i = 1; i <= n; i++) a[i] = ud(rnd);
    //for(int i = 1; i <= n; i++) b[i] = ud(rnd);
    
    for(int i = 1; i <= n; i++) a[i] = max(a[i], b[i]);

    //for(int i = 1; i <= 10; i++) cerr << check(i) << " ";
    //cerr << "\n";

    tans = *min_element(a.begin() + 1, a.end());
    //cout << *min_element(a.begin() + 1, a.end()) << "\n";
    //return 0;

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


    cout << l << "\n";

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 452 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 452 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -