답안 #595207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
595207	2022-07-13T12:40:27 Z	PoPularPlusPlus	Self Study (JOI22_ho_t2)	C++17	0 / 100	313 ms	10788 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

void solve(){
	ll n , m;
	cin >> n >> m;
	ll arr[n] , b[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	for(int i = 0; i < n; i++)cin >> b[i];
	ll l = 1,  r = 1e18 , ans;
	while(l <= r){
		ll mid = (l + r)/2;
		ll chance = 0;
		for(int i = 0; i < n; i++){
			ll sum = max(arr[i] , b[i]) * m;
			if(sum <= mid){
				ll x = mid - sum;
				chance -= x / b[i] + remender(x , b[i]);
			}
			else {
				ll need = mid / max(arr[i] , b[i]) + remender(mid , max(arr[i] , b[i]));
				chance += m - need;
			}
		}
		if(chance >= 0){
			ans = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	182 ms	10752 KB	Output is correct
12	Correct	164 ms	10788 KB	Output is correct
13	Correct	151 ms	8804 KB	Output is correct
14	Incorrect	313 ms	8808 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	320 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	82 ms	5448 KB	Output is correct
10	Correct	62 ms	3772 KB	Output is correct
11	Correct	43 ms	2924 KB	Output is correct
12	Correct	35 ms	2396 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	324 KB	Output is correct
18	Incorrect	5 ms	340 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	182 ms	10752 KB	Output is correct
12	Correct	164 ms	10788 KB	Output is correct
13	Correct	151 ms	8804 KB	Output is correct
14	Incorrect	313 ms	8808 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	320 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	82 ms	5448 KB	Output is correct
10	Correct	62 ms	3772 KB	Output is correct
11	Correct	43 ms	2924 KB	Output is correct
12	Correct	35 ms	2396 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	324 KB	Output is correct
18	Incorrect	5 ms	340 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	182 ms	10752 KB	Output is correct
12	Correct	164 ms	10788 KB	Output is correct
13	Correct	151 ms	8804 KB	Output is correct
14	Incorrect	313 ms	8808 KB	Output isn't correct
15	Halted	0 ms	0 KB	-