oj.uz

Submission #995582

# Submission time Handle Problem Language Result Execution time Memory
995582 2024-06-09T12:07:50 Z vyshniak_n Self Study (JOI22_ho_t2) C++17
62 / 100
 89 ms 11604 KB 
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 20;
const ll K = 1e3 + 20;

void solve() {
    ll n, m;
    cin >> n >> m;

    vector <ll> a(n), b(n);
    for (ll i = 0; i < n; i++)
        cin >> a[i];
    for (ll i = 0; i < n; i++)
        cin >> b[i];

    ll l = 0, r = INF;
    while (l + 1 < r) {
        ll mid = (l + r) >> 1;

        ll cnt = 0;
        bool ok = 1;
        for (ll i = 0; i < n; i++) {
            if (a[i] > b[i]) {
                if (a[i] * m >= mid)
                    cnt += (mid + a[i] - 1) / a[i];
                else
                    cnt += m + (mid + b[i] - 1 - a[i] * m) / b[i];
            } else {
                cnt += (mid + b[i] - 1) / b[i];
            }

            if (cnt > n * m) {
                ok = 0;
                break;
            }
        }

        if (ok)
            l = mid;
        else 
            r = mid;
    }

    cout << l << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 79 ms 4988 KB Output is correct
12 Correct 79 ms 4956 KB Output is correct
13 Correct 48 ms 5144 KB Output is correct
14 Correct 43 ms 4956 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 25 ms 6300 KB Output is correct
17 Correct 62 ms 11604 KB Output is correct
18 Correct 66 ms 10832 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 25 ms 6300 KB Output is correct
3 Correct 62 ms 11604 KB Output is correct
4 Correct 66 ms 10832 KB Output is correct
5 Correct 1 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 1 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 31 ms 2820 KB Output is correct
14 Correct 21 ms 1880 KB Output is correct
15 Correct 15 ms 1624 KB Output is correct
16 Correct 14 ms 1368 KB Output is correct
17 Correct 1 ms 344 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 1 ms 348 KB Output is correct
23 Correct 2 ms 636 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 79 ms 4988 KB Output is correct
12 Correct 79 ms 4956 KB Output is correct
13 Correct 48 ms 5144 KB Output is correct
14 Correct 43 ms 4956 KB Output is correct
15 Correct 1 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 1 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 31 ms 2820 KB Output is correct
24 Correct 21 ms 1880 KB Output is correct
25 Correct 15 ms 1624 KB Output is correct
26 Correct 14 ms 1368 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 636 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 25 ms 6300 KB Output is correct
36 Correct 62 ms 11604 KB Output is correct
37 Correct 66 ms 10832 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 592 KB Output is correct
46 Correct 3 ms 620 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 15 ms 2164 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 2 ms 604 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 42 ms 5600 KB Output is correct
56 Correct 19 ms 3164 KB Output is correct
57 Correct 16 ms 3164 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 31 ms 2820 KB Output is correct
10 Correct 21 ms 1880 KB Output is correct
11 Correct 15 ms 1624 KB Output is correct
12 Correct 14 ms 1368 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 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 1 ms 348 KB Output is correct
19 Correct 2 ms 636 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 25 ms 6300 KB Output is correct
22 Correct 62 ms 11604 KB Output is correct
23 Correct 66 ms 10832 KB Output is correct
24 Correct 13 ms 2080 KB Output is correct
25 Correct 35 ms 5124 KB Output is correct
26 Correct 7 ms 1336 KB Output is correct
27 Correct 63 ms 10964 KB Output is correct
28 Correct 73 ms 11088 KB Output is correct
29 Correct 71 ms 10832 KB Output is correct
30 Correct 74 ms 10832 KB Output is correct
31 Correct 85 ms 10904 KB Output is correct
32 Correct 43 ms 6232 KB Output is correct
33 Incorrect 89 ms 11604 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 79 ms 4988 KB Output is correct
12 Correct 79 ms 4956 KB Output is correct
13 Correct 48 ms 5144 KB Output is correct
14 Correct 43 ms 4956 KB Output is correct
15 Correct 1 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 1 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 31 ms 2820 KB Output is correct
24 Correct 21 ms 1880 KB Output is correct
25 Correct 15 ms 1624 KB Output is correct
26 Correct 14 ms 1368 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 636 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 592 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 15 ms 2164 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 42 ms 5600 KB Output is correct
52 Correct 19 ms 3164 KB Output is correct
53 Correct 16 ms 3164 KB Output is correct
54 Correct 13 ms 2080 KB Output is correct
55 Correct 35 ms 5124 KB Output is correct
56 Correct 7 ms 1336 KB Output is correct
57 Correct 63 ms 10964 KB Output is correct
58 Correct 73 ms 11088 KB Output is correct
59 Correct 71 ms 10832 KB Output is correct
60 Correct 74 ms 10832 KB Output is correct
61 Correct 85 ms 10904 KB Output is correct
62 Correct 43 ms 6232 KB Output is correct
63 Incorrect 89 ms 11604 KB Output isn't correct
64 Halted 0 ms 0 KB -