Submission #536759

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536759	2022-03-14T02:17:22 Z	neon_paradox	Self Study (JOI22_ho_t2)	C++14	10 / 100	380 ms	13808 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
	int n,m;
	cin>>n>>m;
	vector<int> x;
	vector<int> y;
	int p;
	for (int i = 0; i < n; i++){
		cin>>p;
		x.push_back(p);
	}
	for (int i = 0; i < n; i++){
		cin>>p;
		y.push_back(p);
		x[i]=max(x[i],y[i]);
	}
	int l=0;
	int r=9999999999999;
	int mid,c;
	while(l!=r-1){
		mid=(l+r)/2;
		c=0;
		for (int i = 0 ;i < n; i++){
			
			if(m*x[i]<mid){
				c-=ceil(((double)mid-m*x[i])/y[i]);
			}
			else{
				c-=ceil((double)mid/x[i]);
				c+=m;
			}
			
		}
		
		if (c<0)r=mid;
		else l=mid;
	}
	cout << l << "\n";
}

		
		

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	8 ms	340 KB	Output is correct
11	Correct	380 ms	13808 KB	Output is correct
12	Correct	316 ms	13768 KB	Output is correct
13	Correct	275 ms	11752 KB	Output is correct
14	Correct	250 ms	12044 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	185 ms	8676 KB	Output is correct
17	Correct	327 ms	8696 KB	Output is correct
18	Correct	362 ms	8688 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	185 ms	8676 KB	Output is correct
3	Correct	327 ms	8696 KB	Output is correct
4	Correct	362 ms	8688 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	300 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	300 KB	Output is correct
13	Correct	166 ms	7416 KB	Output is correct
14	Correct	108 ms	4440 KB	Output is correct
15	Correct	77 ms	3816 KB	Output is correct
16	Correct	65 ms	2540 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	260 KB	Output is correct
19	Incorrect	1 ms	212 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	8 ms	340 KB	Output is correct
11	Correct	380 ms	13808 KB	Output is correct
12	Correct	316 ms	13768 KB	Output is correct
13	Correct	275 ms	11752 KB	Output is correct
14	Correct	250 ms	12044 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	300 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	300 KB	Output is correct
23	Correct	166 ms	7416 KB	Output is correct
24	Correct	108 ms	4440 KB	Output is correct
25	Correct	77 ms	3816 KB	Output is correct
26	Correct	65 ms	2540 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	260 KB	Output is correct
29	Incorrect	1 ms	212 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	300 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	300 KB	Output is correct
9	Correct	166 ms	7416 KB	Output is correct
10	Correct	108 ms	4440 KB	Output is correct
11	Correct	77 ms	3816 KB	Output is correct
12	Correct	65 ms	2540 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	260 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	8 ms	340 KB	Output is correct
11	Correct	380 ms	13808 KB	Output is correct
12	Correct	316 ms	13768 KB	Output is correct
13	Correct	275 ms	11752 KB	Output is correct
14	Correct	250 ms	12044 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	300 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	300 KB	Output is correct
23	Correct	166 ms	7416 KB	Output is correct
24	Correct	108 ms	4440 KB	Output is correct
25	Correct	77 ms	3816 KB	Output is correct
26	Correct	65 ms	2540 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	260 KB	Output is correct
29	Incorrect	1 ms	212 KB	Output isn't correct
30	Halted	0 ms	0 KB	-