제출 #1181150

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181150		nekolie	Self Study (JOI22_ho_t2)	C++20	10 / 100	63 ms	4936 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int n;
long long m, risa[300000][2];
bool czy(long long x) {
    long long a = 0, b = 0;
    for (int i = 0; i < n; i++) {
        if (risa[i][0] <= risa[i][1])
            a += m, b += (x+risa[i][1]-1)/risa[i][1];
        else {
            if (m >= (x+risa[i][0]-1)/risa[i][0])
                a += m-(x+risa[i][0]-1)/risa[i][0];
            else
                b += (x-m*risa[i][0]+risa[i][1]-1)/risa[i][1];
        }
    }
    return (a >= b);
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    long long odp = 1000000000000000007;
    for (int i = 0; i < n; i++)
        cin >> risa[i][0];
    for (int i = 0; i < n; i++)
        cin >> risa[i][1], odp = min(odp,max(risa[i][0],risa[i][1]));
    /*
    long long l = 0, r = 1000000000000000007;
    while (l < r) {
        long long s = (l+r+1)/2;
        if (czy(s))
            l = s;
        else
            r = s-1;
    }
    cout << l << endl;
    */
    cout << odp << endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9