Submission #907527

# Submission time Handle Problem Language Result Execution time Memory
907527 2024-01-15T20:03:45 Z AlphaMale06 Self Study (JOI22_ho_t2) C++17
0 / 100
430 ms 5132 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define int long long


void solve(){
	int n, m;
	cin >> n >> m;
	int a[n], b[n];
	for(int i=0; i< n; i++)cin >> a[i];
	for(int i=0; i< n; i++)cin >> b[i];
	int l=1; int r=1e18+1;
	int ans=1;
	while(l<=r){
		int s=l+r>>1;
		int save=0;
		for(int i=0; i< n; i++){
			int mx=max(a[i], b[i]);
			int cnt=(s+mx-1)/mx;
			if(cnt<=m){
				save+=m-cnt;
			}
			else save-=(s-mx*m+b[i]-1)/b[i];
		}
		if(save>=0){ 
			ans=s;
			l=s+1;
		}
		else r=s-1;
	}
	cout << ans << '\n';
}


signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:24:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |   int s=l+r>>1;
      |         ~^~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 202 ms 5120 KB Output is correct
12 Correct 204 ms 5124 KB Output is correct
13 Correct 211 ms 4952 KB Output is correct
14 Incorrect 430 ms 5132 KB Output isn't correct
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 111 ms 2652 KB Output is correct
10 Correct 70 ms 1988 KB Output is correct
11 Correct 51 ms 1368 KB Output is correct
12 Correct 43 ms 1624 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Incorrect 8 ms 372 KB Output isn't correct
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 202 ms 5120 KB Output is correct
12 Correct 204 ms 5124 KB Output is correct
13 Correct 211 ms 4952 KB Output is correct
14 Incorrect 430 ms 5132 KB Output isn't correct
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 111 ms 2652 KB Output is correct
10 Correct 70 ms 1988 KB Output is correct
11 Correct 51 ms 1368 KB Output is correct
12 Correct 43 ms 1624 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Incorrect 8 ms 372 KB Output isn't correct
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 202 ms 5120 KB Output is correct
12 Correct 204 ms 5124 KB Output is correct
13 Correct 211 ms 4952 KB Output is correct
14 Incorrect 430 ms 5132 KB Output isn't correct
15 Halted 0 ms 0 KB -