Submission #1077701

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077701		Acanikolic	Self Study (JOI22_ho_t2)	C++14	62 / 100	127 ms	13892 KiB

Main

#include <bits/stdc++.h>  

#define int long long 

#define pb push_back
 
#define F first
 
#define S second
 
using namespace std;
 
const int N = 1e5 + 10;
 
const int mod = 1e9 + 7;
 
const int inf = 1e9;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 	
 	int n,m;
 	cin >> n >> m;
 	vector<int>a(n + 1),b(n + 1),c(n + 1);
 	for(int i = 1; i <= n; i++) cin >> a[i];
 	for(int i = 1; i <= n; i++) cin >> b[i];
 	for(int i = 1; i <= n; i++) c[i] = max(a[i],b[i]);
 	int l = 1,r = *max_element(c.begin(),c.end()) * m,ans = 0;
 	while(l <= r) {
 		int mid = (l + r) / 2,rest = 0;
 		for(int i = 1; i <= n; i++) {
 			if(b[i] >= a[i]) {
 				int need = (mid + b[i] - 1) / b[i];
 				rest += m - need;
 				continue;
 			}
 			int c = min(m,(mid + a[i] - 1) / a[i]);
 			int k = mid - a[i] * c;
 			if(k >= 1) {
 				rest -= (k + b[i] - 1) / b[i];
 			}else {
 				rest += m - c;
 			}
 		}
		if(rest >= 0) {
			ans = mid;
			l = mid + 1;
		}else {
			r = mid - 1;
		}
 	}
 	cout << ans;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9