Submission #536775

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536775	2022-03-14T02:45:19 Z	neon_paradox	Self Study (JOI22_ho_t2)	C++14	0 / 100	1000 ms	8888 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=9999999999999999999;
	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";
}

		

Compilation message

Main.cpp:21:8: warning: integer constant is so large that it is unsigned
   21 |  int r=9999999999999999999;
      |        ^~~~~~~~~~~~~~~~~~~

Subtask #1

0 / 10.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	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	0 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	248 ms	8732 KB	Output is correct
12	Correct	272 ms	8712 KB	Output is correct
13	Correct	240 ms	8800 KB	Output is correct
14	Correct	254 ms	8756 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Execution timed out	1088 ms	8888 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Execution timed out	1088 ms	8888 KB	Time limit exceeded
3	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	0 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	0 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	248 ms	8732 KB	Output is correct
12	Correct	272 ms	8712 KB	Output is correct
13	Correct	240 ms	8800 KB	Output is correct
14	Correct	254 ms	8756 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Execution timed out	1088 ms	8888 KB	Time limit exceeded
17	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	Execution timed out	1088 ms	8888 KB	Time limit exceeded
3	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	0 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	0 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	248 ms	8732 KB	Output is correct
12	Correct	272 ms	8712 KB	Output is correct
13	Correct	240 ms	8800 KB	Output is correct
14	Correct	254 ms	8756 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Execution timed out	1088 ms	8888 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-