답안 #529411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529411 2022-02-23T01:53:47 Z wiwiho Self Study (JOI22_ho_t2) C++14
10 / 100
71 ms 6840 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;

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;
            continue;
        }
        ll tmp = mn - m * a[i];
        cnt -= iceil(tmp, b[i]);
    }

    return cnt >= 0;
}

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], a[i] = max(a[i], b[i]);

    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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 53 ms 5000 KB Output is correct
12 Correct 59 ms 4940 KB Output is correct
13 Correct 50 ms 4940 KB Output is correct
14 Correct 60 ms 4996 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 27 ms 4940 KB Output is correct
17 Correct 70 ms 6208 KB Output is correct
18 Correct 71 ms 6840 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 27 ms 4940 KB Output is correct
3 Correct 70 ms 6208 KB Output is correct
4 Correct 71 ms 6840 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 53 ms 5000 KB Output is correct
12 Correct 59 ms 4940 KB Output is correct
13 Correct 50 ms 4940 KB Output is correct
14 Correct 60 ms 4996 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 53 ms 5000 KB Output is correct
12 Correct 59 ms 4940 KB Output is correct
13 Correct 50 ms 4940 KB Output is correct
14 Correct 60 ms 4996 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -