# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528054 | 2022-02-19T05:09:20 Z | amukkalir | Self Study (JOI22_ho_t2) | C++17 | 98 ms | 6220 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define prn printf #define scn scanf const int nax = 3e5; int n, m; ll a[nax+5], b[nax+5]; unsigned long long updiv(ll a, ll b) { ll ret = a/b; if(ret*b < a) ret++; return ret; } bool ok (ll x) { unsigned long long cnt = 0; for(int i=0; i<n; i++) { cnt += updiv(x, a[i]); if(cnt > n*m) return false; } return cnt <= n*m; } signed main () { scn("%d%d", &n,&m); for(int i=0; i<n; i++) scn("%lld", &a[i]); for(int i=0; i<n; i++) scn("%lld", &b[i]); ll ans = 0; ll lo = 0, hi = 1e18; while(lo <= hi) { ll mid = (lo+hi)>>1; if(ok(mid)) { ans = mid; lo = mid+1; } else hi = mid-1; } prn("%lld", ans); } /* dari 3e5 slot buat setiap mapel mau study berapa kali */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 280 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 284 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 62 ms | 4120 KB | Output is correct |
10 | Correct | 39 ms | 2628 KB | Output is correct |
11 | Correct | 26 ms | 2036 KB | Output is correct |
12 | Correct | 22 ms | 1732 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 1 ms | 304 KB | Output is correct |
16 | Correct | 0 ms | 204 KB | Output is correct |
17 | Correct | 0 ms | 204 KB | Output is correct |
18 | Correct | 1 ms | 332 KB | Output is correct |
19 | Correct | 3 ms | 436 KB | Output is correct |
20 | Correct | 1 ms | 204 KB | Output is correct |
21 | Correct | 59 ms | 5292 KB | Output is correct |
22 | Correct | 93 ms | 5680 KB | Output is correct |
23 | Correct | 98 ms | 6220 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 280 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 284 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 62 ms | 4120 KB | Output is correct |
10 | Correct | 39 ms | 2628 KB | Output is correct |
11 | Correct | 26 ms | 2036 KB | Output is correct |
12 | Correct | 22 ms | 1732 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 1 ms | 304 KB | Output is correct |
16 | Correct | 0 ms | 204 KB | Output is correct |
17 | Correct | 0 ms | 204 KB | Output is correct |
18 | Correct | 1 ms | 332 KB | Output is correct |
19 | Correct | 3 ms | 436 KB | Output is correct |
20 | Correct | 1 ms | 204 KB | Output is correct |
21 | Correct | 59 ms | 5292 KB | Output is correct |
22 | Correct | 93 ms | 5680 KB | Output is correct |
23 | Correct | 98 ms | 6220 KB | Output is correct |
24 | Incorrect | 22 ms | 1356 KB | Output isn't correct |
25 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 280 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |