Submission #932518

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
932518	2024-02-23T15:01:18 Z	koukirocks	Self Study (JOI22_ho_t2)	C++17	0 / 100	207 ms	11188 KB

Main

#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
 
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=3e5+10,P=998244353;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;

ll n,m;
ll a[MAX],b[MAX];

bool ok(ll low) {
	ll need=0;
	for (int i=1;i<=n;i++) {
		ll org=max(a[i],b[i])*m;
		if (org>=low) need-=(org-low)/max(a[i],b[i]);
		else need+=(low-org-1)/b[i]+1;
	}
//	cout<<need<<"\n";
	return (need<=0);
}

int main() {
	speed;
	cin>>n>>m;
	for (int i=1;i<=n;i++) {
		cin>>a[i];
	}
	for (int i=1;i<=n;i++) {
		cin>>b[i];
	}
	ll l=1,r=1e15;
	while (l<r) {
		ll mid=(l+r+1)/2;
//		cout<<l<<" "<<mid<<" "<<r<<"\n";
		if (ok(mid)) l=mid;
		else r=mid-1;
	}
	cout<<l<<"\n";
	return 0;
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	360 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	1 ms	360 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	504 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	1 ms	360 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Correct	1 ms	756 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	133 ms	11188 KB	Output is correct
12	Correct	123 ms	10772 KB	Output is correct
13	Correct	109 ms	8796 KB	Output is correct
14	Incorrect	207 ms	8800 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	360 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	1 ms	360 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	360 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	61 ms	5476 KB	Output is correct
10	Correct	40 ms	3784 KB	Output is correct
11	Correct	32 ms	3176 KB	Output is correct
12	Correct	25 ms	2392 KB	Output is correct
13	Correct	1 ms	352 KB	Output is correct
14	Correct	0 ms	352 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	352 KB	Output is correct
17	Correct	0 ms	352 KB	Output is correct
18	Correct	3 ms	352 KB	Output is correct
19	Correct	2 ms	624 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Incorrect	192 ms	6316 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	360 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	1 ms	360 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	504 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	1 ms	360 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Correct	1 ms	756 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	133 ms	11188 KB	Output is correct
12	Correct	123 ms	10772 KB	Output is correct
13	Correct	109 ms	8796 KB	Output is correct
14	Incorrect	207 ms	8800 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	360 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	1 ms	360 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	360 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	61 ms	5476 KB	Output is correct
10	Correct	40 ms	3784 KB	Output is correct
11	Correct	32 ms	3176 KB	Output is correct
12	Correct	25 ms	2392 KB	Output is correct
13	Correct	1 ms	352 KB	Output is correct
14	Correct	0 ms	352 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	352 KB	Output is correct
17	Correct	0 ms	352 KB	Output is correct
18	Correct	3 ms	352 KB	Output is correct
19	Correct	2 ms	624 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Incorrect	192 ms	6316 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	360 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	1 ms	360 KB	Output is correct
4	Correct	1 ms	368 KB	Output is correct
5	Correct	1 ms	504 KB	Output is correct
6	Correct	1 ms	360 KB	Output is correct
7	Correct	1 ms	360 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Correct	1 ms	756 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	133 ms	11188 KB	Output is correct
12	Correct	123 ms	10772 KB	Output is correct
13	Correct	109 ms	8796 KB	Output is correct
14	Incorrect	207 ms	8800 KB	Output isn't correct
15	Halted	0 ms	0 KB	-