# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
703600 |
2023-02-27T18:33:01 Z |
niter |
Self Study (JOI22_ho_t2) |
C++14 |
|
0 ms |
212 KB |
#include <iostream>
#include <vector>
#define loop(i,a,b) for(int i=a;i<b;i++)
using namespace std;
long long A[300050], B[300050];
int main(){
ios::sync_with_stdio(false); cin.tie(0);
long long N, M;
cin >> N >> M;
loop(i,0,N) cin >> A[i];
loop(i,0,N) cin >> B[i];
loop(i,0,N) A[i] = max(A[i], B[i]);
long long ok = 0, ng = 1LL << 60;
auto check = [&](long long x) -> bool {
long long day = 0, cost;
loop(i,0,N){
cost = x;
cost -= min<long long>(((cost-1) / A[i] + 1), M) * A[i];
if(cost > 0)
day += ((cost-1) / B[i] + 1);
if(day > N * M) return 0;
}
return 1;
};
while(ng - ok > 1){
long long mid = (ng + ok) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
cout << ok << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |