Submission #995583

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
995583	2024-06-09T12:09:40 Z	vyshniak_n	Self Study (JOI22_ho_t2)	C++17	62 / 100	89 ms	5144 KB

Main

//#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;

        __int128 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	89 ms	4956 KB	Output is correct
12	Correct	84 ms	4952 KB	Output is correct
13	Correct	50 ms	4952 KB	Output is correct
14	Correct	47 ms	4956 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	24 ms	4956 KB	Output is correct
17	Correct	63 ms	4956 KB	Output is correct
18	Correct	60 ms	4956 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	24 ms	4956 KB	Output is correct
3	Correct	63 ms	4956 KB	Output is correct
4	Correct	60 ms	4956 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	30 ms	2652 KB	Output is correct
14	Correct	21 ms	1884 KB	Output is correct
15	Correct	15 ms	1628 KB	Output is correct
16	Correct	17 ms	1416 KB	Output is correct
17	Correct	1 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	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	1 ms	348 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	89 ms	4956 KB	Output is correct
12	Correct	84 ms	4952 KB	Output is correct
13	Correct	50 ms	4952 KB	Output is correct
14	Correct	47 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	30 ms	2652 KB	Output is correct
24	Correct	21 ms	1884 KB	Output is correct
25	Correct	15 ms	1628 KB	Output is correct
26	Correct	17 ms	1416 KB	Output is correct
27	Correct	1 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	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	1 ms	348 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	24 ms	4956 KB	Output is correct
36	Correct	63 ms	4956 KB	Output is correct
37	Correct	60 ms	4956 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	348 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	1 ms	348 KB	Output is correct
46	Correct	2 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	14 ms	1284 KB	Output is correct
49	Correct	0 ms	344 KB	Output is correct
50	Correct	0 ms	344 KB	Output is correct
51	Correct	2 ms	344 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	43 ms	2652 KB	Output is correct
56	Correct	18 ms	1880 KB	Output is correct
57	Correct	16 ms	1884 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	30 ms	2652 KB	Output is correct
10	Correct	21 ms	1884 KB	Output is correct
11	Correct	15 ms	1628 KB	Output is correct
12	Correct	17 ms	1416 KB	Output is correct
13	Correct	1 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	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	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	24 ms	4956 KB	Output is correct
22	Correct	63 ms	4956 KB	Output is correct
23	Correct	60 ms	4956 KB	Output is correct
24	Correct	12 ms	1112 KB	Output is correct
25	Correct	36 ms	2396 KB	Output is correct
26	Correct	8 ms	860 KB	Output is correct
27	Correct	68 ms	4956 KB	Output is correct
28	Correct	62 ms	5144 KB	Output is correct
29	Correct	66 ms	4956 KB	Output is correct
30	Correct	70 ms	4956 KB	Output is correct
31	Correct	81 ms	4952 KB	Output is correct
32	Correct	45 ms	4956 KB	Output is correct
33	Incorrect	84 ms	4956 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	89 ms	4956 KB	Output is correct
12	Correct	84 ms	4952 KB	Output is correct
13	Correct	50 ms	4952 KB	Output is correct
14	Correct	47 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	30 ms	2652 KB	Output is correct
24	Correct	21 ms	1884 KB	Output is correct
25	Correct	15 ms	1628 KB	Output is correct
26	Correct	17 ms	1416 KB	Output is correct
27	Correct	1 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	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	1 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	348 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	1 ms	348 KB	Output is correct
42	Correct	2 ms	344 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	14 ms	1284 KB	Output is correct
45	Correct	0 ms	344 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	2 ms	344 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	43 ms	2652 KB	Output is correct
52	Correct	18 ms	1880 KB	Output is correct
53	Correct	16 ms	1884 KB	Output is correct
54	Correct	12 ms	1112 KB	Output is correct
55	Correct	36 ms	2396 KB	Output is correct
56	Correct	8 ms	860 KB	Output is correct
57	Correct	68 ms	4956 KB	Output is correct
58	Correct	62 ms	5144 KB	Output is correct
59	Correct	66 ms	4956 KB	Output is correct
60	Correct	70 ms	4956 KB	Output is correct
61	Correct	81 ms	4952 KB	Output is correct
62	Correct	45 ms	4956 KB	Output is correct
63	Incorrect	84 ms	4956 KB	Output isn't correct
64	Halted	0 ms	0 KB	-