Submission #885849

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
885849	2023-12-10T21:23:50 Z	NintsiChkhaidze	Self Study (JOI22_ho_t2)	C++17	0 / 100	270 ms	7572 KB

Main

#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define pii pair<int,int>
#define ll long long
#define int ll
using namespace std;

const int N = 3e5 + 3;

int a[N],b[N],n,m,cur[N];

bool check(int x){

	int need=0,have=0;
	for (int i = 1; i <= n; i++){
		cur[i] = max(a[i],b[i]) * m;
		if (cur[i] > x){
			have += (cur[i] - x) / max(a[i],b[i]);
		}else if (cur[i] < x){
			need += (x - cur[i] + b[i] - 1)/b[i];
		}
	}

	return (have >= need);
}
signed main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	cin>>n>>m;

	for (int i = 1; i <= n; i++) 
		cin >> a[i];
	
	for (int i = 1; i <= n; i++)
		cin >> b[i];

	int l = 0,r = 1e18,res=0;
	while (l <= r){
		int mid = (l + r)/2;
		if (check(mid)){
			res=mid;
			l=mid+1;
		}else{
			r=mid-1;
		}
	}
	cout<<res;
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4560 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	4 ms	4444 KB	Output is correct
11	Correct	141 ms	7400 KB	Output is correct
12	Correct	139 ms	7476 KB	Output is correct
13	Correct	134 ms	7508 KB	Output is correct
14	Incorrect	270 ms	7572 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4596 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	70 ms	6748 KB	Output is correct
10	Correct	48 ms	6776 KB	Output is correct
11	Correct	36 ms	6992 KB	Output is correct
12	Correct	29 ms	6748 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Incorrect	5 ms	4444 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4560 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	4 ms	4444 KB	Output is correct
11	Correct	141 ms	7400 KB	Output is correct
12	Correct	139 ms	7476 KB	Output is correct
13	Correct	134 ms	7508 KB	Output is correct
14	Incorrect	270 ms	7572 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4596 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	70 ms	6748 KB	Output is correct
10	Correct	48 ms	6776 KB	Output is correct
11	Correct	36 ms	6992 KB	Output is correct
12	Correct	29 ms	6748 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Incorrect	5 ms	4444 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4560 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	4 ms	4444 KB	Output is correct
11	Correct	141 ms	7400 KB	Output is correct
12	Correct	139 ms	7476 KB	Output is correct
13	Correct	134 ms	7508 KB	Output is correct
14	Incorrect	270 ms	7572 KB	Output isn't correct
15	Halted	0 ms	0 KB	-