| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 875088 |
2023-11-18T16:24:53 Z |
makrav |
Self Study (JOI22_ho_t2) |
C++14 |
|
420 ms |
5152 KB |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vei;
typedef vector<vei> vevei;
#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define con cout << "NO\n"
#define coe cout << "YES\n";
#define str string
#define pb push_back
#define ff first
#define sc second
#define ss second
#define pii pair<int, int>
#define mxe max_element
#define mne min_element
#define stf shrink_to_fit
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld
#define int ll
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll n, m; cin >> n >> m;
vector<int> a(n), b(n);
f(i, 0, n) { ll x; cin >> x; a[i] = (int)x; }
f(i, 0, n) { ll x; cin >> x; b[i] = (int)x; }
int L = -1, R = 1e18 + 1;
while (R - L > 1) {
int M = (L + R) / 2;
int need = 0;
f(i, 0, n) {
if (b[i] > a[i]) {
need += (M + b[i] - 1) / b[i];
}
else {
if ((M + a[i] - 1) / a[i] <= m) {
need += (M + a[i] - 1) / a[i];
}
else {
need += m + (M - a[i] * (int)m + b[i] - 1) / b[i];
}
}
}
if (need > (int)m * (int)n) R = M;
else L = M;
}
cout << (ll)L << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 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 |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
348 KB |
Output is correct |
| 11 |
Correct |
178 ms |
4956 KB |
Output is correct |
| 12 |
Correct |
191 ms |
5152 KB |
Output is correct |
| 13 |
Correct |
131 ms |
4952 KB |
Output is correct |
| 14 |
Incorrect |
420 ms |
5140 KB |
Output isn't correct |
| 15 |
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 |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
103 ms |
2904 KB |
Output is correct |
| 10 |
Correct |
73 ms |
1884 KB |
Output is correct |
| 11 |
Correct |
52 ms |
1628 KB |
Output is correct |
| 12 |
Correct |
43 ms |
1372 KB |
Output is correct |
| 13 |
Correct |
1 ms |
544 KB |
Output is correct |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Incorrect |
8 ms |
348 KB |
Output isn't correct |
| 19 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 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 |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
348 KB |
Output is correct |
| 11 |
Correct |
178 ms |
4956 KB |
Output is correct |
| 12 |
Correct |
191 ms |
5152 KB |
Output is correct |
| 13 |
Correct |
131 ms |
4952 KB |
Output is correct |
| 14 |
Incorrect |
420 ms |
5140 KB |
Output isn't correct |
| 15 |
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 |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
103 ms |
2904 KB |
Output is correct |
| 10 |
Correct |
73 ms |
1884 KB |
Output is correct |
| 11 |
Correct |
52 ms |
1628 KB |
Output is correct |
| 12 |
Correct |
43 ms |
1372 KB |
Output is correct |
| 13 |
Correct |
1 ms |
544 KB |
Output is correct |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Incorrect |
8 ms |
348 KB |
Output isn't correct |
| 19 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 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 |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
348 KB |
Output is correct |
| 11 |
Correct |
178 ms |
4956 KB |
Output is correct |
| 12 |
Correct |
191 ms |
5152 KB |
Output is correct |
| 13 |
Correct |
131 ms |
4952 KB |
Output is correct |
| 14 |
Incorrect |
420 ms |
5140 KB |
Output isn't correct |
| 15 |
Halted |
0 ms |
0 KB |
- |
