답안 #1028946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028946	2024-07-20T10:41:15 Z	tvladm2009	Self Study (JOI22_ho_t2)	C++17	10 / 100	67 ms	11348 KB

Main

#include <bits/stdc++.h>
 
using namespace std;
#define int long long
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1), b(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] = max(a[i], b[i]);
 
    int l = 1, r = 1e9, sol = 0;
    while (l <= r) {
        int mid = (l + r) / 2;
        int days = 0;
        int need = 0;
        for (int i = 1; i <= n; ++i) {
            if (a[i] * m >= mid) {
                days += m - (mid + a[i] - 1) / a[i];
            } else {
                need += (mid - a[i] * m + b[i] - 1) / b[i];
            }
        }
        if (need <= days) {
            sol = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    cout << sol << "\n";
    return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	67 ms	10756 KB	Output is correct
12	Correct	62 ms	10832 KB	Output is correct
13	Correct	54 ms	8708 KB	Output is correct
14	Correct	52 ms	8784 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	40 ms	6236 KB	Output is correct
17	Correct	66 ms	11348 KB	Output is correct
18	Correct	63 ms	10784 KB	Output is correct

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	40 ms	6236 KB	Output is correct
3	Correct	66 ms	11348 KB	Output is correct
4	Correct	63 ms	10784 KB	Output is correct
5	Incorrect	0 ms	348 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	67 ms	10756 KB	Output is correct
12	Correct	62 ms	10832 KB	Output is correct
13	Correct	54 ms	8708 KB	Output is correct
14	Correct	52 ms	8784 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

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

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	67 ms	10756 KB	Output is correct
12	Correct	62 ms	10832 KB	Output is correct
13	Correct	54 ms	8708 KB	Output is correct
14	Correct	52 ms	8784 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-