#include <bits/stdc++.h>
using ll = long long;
// #define int ll
using namespace std;
#define sz(x) (int)(x).size()
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, l, r) for(int i = l; i >= r; i--)
#define fi first
#define se second
#define mod 998244353
#define db(x) cerr << __LINE__ << " " << #x << " " << x << "\n"
using vi = vector<int>;
using pi = pair<int, int>;
const ll N = 500005;
const ll inf = 1e18;
ll n, m, a[N], b[N];
bool chk(ll x){
ll res = 0;
foru(i, 1, n){
if(a[i] > b[i]){
ll z = (x + a[i] - 1) / a[i];
z = min(z, m);
ll nw = inf;
foru(j, max(z - 2, 0ll), z){
ll rem = max(x - a[i] * j, 0ll);
nw = min(nw, j + (rem + b[i] - 1) / b[i]);
}
res += nw;
}
else{
res += (x + b[i] - 1) / b[i];
}
if(res > m * n) return false;
}
return true;
}
void solve(){
cin >> n >> m;
foru(i, 1, n) cin >> a[i];
foru(i, 1, n) cin >> b[i];
ll l = 0, r = inf;
while(l != r){
ll mid = l + r >> 1;
if(chk(mid)) l = mid;
else r = mid - 1;
}
cout << l << "\n";
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int t = 1;
while(t--){
solve();
}
}
Compilation message
Main.cpp: In function 'void solve()':
Main.cpp:49:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
49 | ll mid = l + r >> 1;
| ~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1088 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1098 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1088 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1098 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1088 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |