oj.uz

Submission #875091

# Submission time Handle Problem Language Result Execution time Memory
875091 2023-11-18T16:29:01 Z makrav Self Study (JOI22_ho_t2) C++17
62 / 100
 206 ms 5208 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 (need > m * n) break;
            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;
}

Subtask #1
10.0 / 10.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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 2 ms 348 KB Output is correct
11 Correct 85 ms 4952 KB Output is correct
12 Correct 88 ms 4952 KB Output is correct
13 Correct 74 ms 4952 KB Output is correct
14 Correct 61 ms 4956 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 28 ms 4956 KB Output is correct
17 Correct 92 ms 5208 KB Output is correct
18 Correct 81 ms 4952 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 28 ms 4956 KB Output is correct
3 Correct 92 ms 5208 KB Output is correct
4 Correct 81 ms 4952 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 44 ms 2652 KB Output is correct
14 Correct 29 ms 1884 KB Output is correct
15 Correct 20 ms 1628 KB Output is correct
16 Correct 19 ms 1372 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 3 ms 348 KB Output is correct

Subtask #3
27.0 / 27.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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 2 ms 348 KB Output is correct
11 Correct 85 ms 4952 KB Output is correct
12 Correct 88 ms 4952 KB Output is correct
13 Correct 74 ms 4952 KB Output is correct
14 Correct 61 ms 4956 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 44 ms 2652 KB Output is correct
24 Correct 29 ms 1884 KB Output is correct
25 Correct 20 ms 1628 KB Output is correct
26 Correct 19 ms 1372 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 28 ms 4956 KB Output is correct
36 Correct 92 ms 5208 KB Output is correct
37 Correct 81 ms 4952 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 3 ms 344 KB Output is correct
46 Correct 4 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 17 ms 1276 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 49 ms 2652 KB Output is correct
56 Correct 25 ms 1884 KB Output is correct
57 Correct 20 ms 1880 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 44 ms 2652 KB Output is correct
10 Correct 29 ms 1884 KB Output is correct
11 Correct 20 ms 1628 KB Output is correct
12 Correct 19 ms 1372 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 28 ms 4956 KB Output is correct
22 Correct 92 ms 5208 KB Output is correct
23 Correct 81 ms 4952 KB Output is correct
24 Correct 28 ms 1116 KB Output is correct
25 Correct 69 ms 2396 KB Output is correct
26 Correct 11 ms 860 KB Output is correct
27 Correct 82 ms 4956 KB Output is correct
28 Correct 91 ms 4956 KB Output is correct
29 Correct 97 ms 5140 KB Output is correct
30 Correct 120 ms 5148 KB Output is correct
31 Correct 199 ms 4952 KB Output is correct
32 Correct 135 ms 5136 KB Output is correct
33 Incorrect 206 ms 5140 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 9.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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 2 ms 348 KB Output is correct
11 Correct 85 ms 4952 KB Output is correct
12 Correct 88 ms 4952 KB Output is correct
13 Correct 74 ms 4952 KB Output is correct
14 Correct 61 ms 4956 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 44 ms 2652 KB Output is correct
24 Correct 29 ms 1884 KB Output is correct
25 Correct 20 ms 1628 KB Output is correct
26 Correct 19 ms 1372 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 3 ms 344 KB Output is correct
42 Correct 4 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 17 ms 1276 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 49 ms 2652 KB Output is correct
52 Correct 25 ms 1884 KB Output is correct
53 Correct 20 ms 1880 KB Output is correct
54 Correct 28 ms 1116 KB Output is correct
55 Correct 69 ms 2396 KB Output is correct
56 Correct 11 ms 860 KB Output is correct
57 Correct 82 ms 4956 KB Output is correct
58 Correct 91 ms 4956 KB Output is correct
59 Correct 97 ms 5140 KB Output is correct
60 Correct 120 ms 5148 KB Output is correct
61 Correct 199 ms 4952 KB Output is correct
62 Correct 135 ms 5136 KB Output is correct
63 Incorrect 206 ms 5140 KB Output isn't correct
64 Halted 0 ms 0 KB -