Submission #940284

#	Time	Username	Problem	Language	Result	Execution time	Memory
940284		TAhmed33	Self Study (JOI22_ho_t2)	C++98	0 / 100	305 ms	13772 KiB

Main

    #include <bits/stdc++.h>
    using namespace std;
#pragma GCC optimize ("trapv")
    typedef long long ll;
    const int MAXN = 3e5 + 25;
    ll n, m;
    pair <ll, ll> a[MAXN];
    void solve () {
    	cin >> n >> m;
    	for (int i = 1; i <= n; i++) cin >> a[i].first;
    	for (int i = 1; i <= n; i++) cin >> a[i].second;
    	ll l = 0, r = 1e18, ans = 0;
    	while (l <= r) {
    		ll mid = (l + r) / 2;
    		ll sum = 0;
    		for (int i = 1; i <= n; i++) {
    			ll x = (mid + max(a[i].first, a[i].second) - 1) / max(a[i].second, a[i].first);
    			if (x <= m) {
    				sum += x;
    			} else {
    				sum += ((mid - max(a[i].second, a[i].first) * m + a[i].second - 1) / a[i].second) + m;
    			}
    		}
    		if (sum <= n * m) {
    			l = mid + 1; ans = mid;
    		} else {
    			r = mid - 1;
    		}
    	}
    	cout << ans << '\n';
    }	
    int main () {
    	ios::sync_with_stdio(0); cin.tie(0);
    	int t = 1; //cin >> t;
    	while (t--) solve();
    }

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