Submission #863824

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
863824	2023-10-21T07:56:10 Z	phoenix0423	Self Study (JOI22_ho_t2)	C++17	10 / 100	55 ms	8528 KB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 2e5 + 5;
const ll INF = 8e18;

int main(void){
	fastio;
	ll n, m;
	cin>>n>>m;
	vector<ll> a(n), b(n);
	for(int i = 0; i < n; i++) cin>>a[i];
	for(int i = 0; i < n; i++) cin>>b[i];
	ll ans = INF;
	for(int i = 0; i < n; i++) ans = min(ans, max(a[i], b[i]));
	cout<<ans<<"\n";
	
	/*
	ll l = 0, r = INF;
	while(l + 1 < r){
		ll mid = (l + r) / 2;
		vector<ll> have(n, 0);
		ll nd = 0;
		for(int i = 0; i < n; i++){
			if(a[i] <= b[i]){
				nd += (mid - 1) / b[i] + 1;
				continue;
			}
			if(a[i] * m >= mid){
				nd += (mid - 1) / a[i] + 1;
				continue;
			}
			else{
				nd += m + (mid - a[i] * m - 1) / b[i] + 1;
			}
		}
		if(nd > n * m) r = mid;
		else l = mid;
	}
	cout<<l<<"\n";*/
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	55 ms	5140 KB	Output is correct
12	Correct	44 ms	4956 KB	Output is correct
13	Correct	35 ms	4956 KB	Output is correct
14	Correct	35 ms	4956 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	29 ms	5924 KB	Output is correct
17	Correct	48 ms	8528 KB	Output is correct
18	Correct	46 ms	8212 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	29 ms	5924 KB	Output is correct
3	Correct	48 ms	8528 KB	Output is correct
4	Correct	46 ms	8212 KB	Output is correct
5	Incorrect	0 ms	344 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	55 ms	5140 KB	Output is correct
12	Correct	44 ms	4956 KB	Output is correct
13	Correct	35 ms	4956 KB	Output is correct
14	Correct	35 ms	4956 KB	Output is correct
15	Incorrect	0 ms	344 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	55 ms	5140 KB	Output is correct
12	Correct	44 ms	4956 KB	Output is correct
13	Correct	35 ms	4956 KB	Output is correct
14	Correct	35 ms	4956 KB	Output is correct
15	Incorrect	0 ms	344 KB	Output isn't correct
16	Halted	0 ms	0 KB	-