Submission #1000513

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1000513	2024-06-17T16:20:15 Z	LCJLY	Self Study (JOI22_ho_t2)	C++14	0 / 100	110 ms	10876 KB

Main

#include <bits/stdc++.h>
using namespace std;
	
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef array<int,3>pi2;

void solve(){	
	int n,m;
	cin >> n >> m;
	pii arr[n];
	for(int x=0;x<n;x++){
		cin >> arr[x].first;
	}	
	
	for(int x=0;x<n;x++){
		cin >> arr[x].second;
		arr[x].first=max(arr[x].first,arr[x].second);
	}
	
	int l=0;
	int r=1e15;
	int mid;
	int best=0;
	while(l<=r){
		mid=(l+r)/2;
		int counter=0;
		for(int x=0;x<n;x++){
			int hold=(mid+arr[x].first-1)/arr[x].first;
			if(hold<=m){
				counter+=hold;
			}
			else{
				counter+=m;
				int hold2=(mid-arr[x].first*m);
				counter+=(hold2+arr[x].second-1)/arr[x].second;
			}
		}
		
		if(counter<=n*m){
			best=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	cout << best;
}	
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	//freopen("in.txt","r",stdin);
	while(t--){
		solve();
	}
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	97 ms	10876 KB	Output is correct
12	Correct	94 ms	10832 KB	Output is correct
13	Correct	90 ms	8784 KB	Output is correct
14	Incorrect	110 ms	8944 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	436 KB	Output is correct
9	Correct	50 ms	5476 KB	Output is correct
10	Correct	33 ms	3928 KB	Output is correct
11	Correct	23 ms	2908 KB	Output is correct
12	Correct	20 ms	2396 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	604 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Incorrect	105 ms	6280 KB	Output isn't correct
22	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	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	97 ms	10876 KB	Output is correct
12	Correct	94 ms	10832 KB	Output is correct
13	Correct	90 ms	8784 KB	Output is correct
14	Incorrect	110 ms	8944 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	436 KB	Output is correct
9	Correct	50 ms	5476 KB	Output is correct
10	Correct	33 ms	3928 KB	Output is correct
11	Correct	23 ms	2908 KB	Output is correct
12	Correct	20 ms	2396 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	604 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Incorrect	105 ms	6280 KB	Output isn't correct
22	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	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	97 ms	10876 KB	Output is correct
12	Correct	94 ms	10832 KB	Output is correct
13	Correct	90 ms	8784 KB	Output is correct
14	Incorrect	110 ms	8944 KB	Output isn't correct
15	Halted	0 ms	0 KB	-