Submission #536767

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536767	2022-03-14T02:35:55 Z	neon_paradox	Self Study (JOI22_ho_t2)	C++14	10 / 100	201 ms	8880 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
	ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
	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);
		if(y[i] > x[i]) x[i] = max(y[i],x[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(((long double)mid-m*x[i])/y[i]);
			}
			else{
				c-=ceil((long 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	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	6 ms	340 KB	Output is correct
11	Correct	189 ms	8788 KB	Output is correct
12	Correct	193 ms	8748 KB	Output is correct
13	Correct	169 ms	8756 KB	Output is correct
14	Correct	165 ms	8880 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	169 ms	8740 KB	Output is correct
17	Correct	201 ms	8756 KB	Output is correct
18	Correct	180 ms	8812 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	169 ms	8740 KB	Output is correct
3	Correct	201 ms	8756 KB	Output is correct
4	Correct	180 ms	8812 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	94 ms	4520 KB	Output is correct
14	Correct	65 ms	2640 KB	Output is correct
15	Correct	47 ms	2384 KB	Output is correct
16	Correct	54 ms	1684 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Incorrect	0 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	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	6 ms	340 KB	Output is correct
11	Correct	189 ms	8788 KB	Output is correct
12	Correct	193 ms	8748 KB	Output is correct
13	Correct	169 ms	8756 KB	Output is correct
14	Correct	165 ms	8880 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	94 ms	4520 KB	Output is correct
24	Correct	65 ms	2640 KB	Output is correct
25	Correct	47 ms	2384 KB	Output is correct
26	Correct	54 ms	1684 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Incorrect	0 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	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	94 ms	4520 KB	Output is correct
10	Correct	65 ms	2640 KB	Output is correct
11	Correct	47 ms	2384 KB	Output is correct
12	Correct	54 ms	1684 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Incorrect	0 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	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	6 ms	340 KB	Output is correct
11	Correct	189 ms	8788 KB	Output is correct
12	Correct	193 ms	8748 KB	Output is correct
13	Correct	169 ms	8756 KB	Output is correct
14	Correct	165 ms	8880 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	94 ms	4520 KB	Output is correct
24	Correct	65 ms	2640 KB	Output is correct
25	Correct	47 ms	2384 KB	Output is correct
26	Correct	54 ms	1684 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Incorrect	0 ms	212 KB	Output isn't correct
30	Halted	0 ms	0 KB	-