Submission #923453

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
923453	2024-02-07T09:08:17 Z	goodspeed0208	Self Study (JOI22_ho_t2)	C++14	0 / 100	73 ms	5596 KB

Main

#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int>a(n), b(n);
	for (auto &i : a) cin >> i;
	for (auto &i : b) cin >> i;
	
	int l = 1, r = 1000000000000000005ll, mid;
	while (l + 1 < r) {
		mid = (l + r) / 2;
		int need = 0;
		for (int i = 0 ; i < n ; i++) {
			need += (mid / b[i]);
			if (mid - (mid / b[i] ) * b[i] > 0) need++;
			/*if (a[i] > b[i]) {
				if (mid > a[i] * m) {
					need += m + (mid - a[i] * m) / b[i];
					if ((mid - a[i] * m ) % b[i] != 0) need++;
				}
				else {
					need += mid / a[i];
					if (mid % a[i] != 0) need++;
				}
			} else {
				need += (mid / b[i]);
				if (mid % b[i] != 0) need++;
			}*/
		}
		if (need <= n * m) {
			l = mid;
			//cout << l << " " << need << "\n";
		} else {
			r = mid;
			//cout << r << " " << need << "\n";
		}
	}
	cout << l << "\n";
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 ms	348 KB	Output is correct
9	Correct	73 ms	5596 KB	Output is correct
10	Correct	50 ms	3792 KB	Output is correct
11	Correct	36 ms	2908 KB	Output is correct
12	Correct	29 ms	2548 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	5 ms	348 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 ms	348 KB	Output is correct
9	Correct	73 ms	5596 KB	Output is correct
10	Correct	50 ms	3792 KB	Output is correct
11	Correct	36 ms	2908 KB	Output is correct
12	Correct	29 ms	2548 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	5 ms	348 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-