oj.uz

답안 #996758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996758 2024-06-11T07:20:21 Z faqinyeager Self Study (JOI22_ho_t2) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

bool F(ll x){
    int r = 0;
    for(int i = 0; i < n; i++){
        if(x / a[i] >= m){
            r += m - (x / a[i]) / m;
        }
    }
    for(int i = 0; i < n; i++){
        if(x / a[i] < m){
            if(r >= m - x / a[i]){
                r -= m - x / a[i];
            }else{
                return 0;
            }
        }
    }
    return 1;
}

int main(){
    cin >> n >> m;
    
    a.resize(n);
    b.resize(n);
    
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    
    for(int i = 0; i < n; i++) a[i] = max(a[i], b[i]);
    
    ll lx = 0, rx = 1LL << 60;
    while(rx - lx > 1){
        ll mid = (rx + lx) / 2;
        if(F(mid)) rx = mid;
        else lx = mid;
    }
    cout << rx;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 9.0

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