Submission #995604

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
995604	2024-06-09T12:40:01 Z	vyshniak_n	Self Study (JOI22_ho_t2)	C++17	100 / 100	127 ms	5232 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 = 2e18;
    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	0 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	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	79 ms	4956 KB	Output is correct
12	Correct	80 ms	4952 KB	Output is correct
13	Correct	51 ms	4952 KB	Output is correct
14	Correct	50 ms	4956 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	23 ms	5172 KB	Output is correct
17	Correct	65 ms	5232 KB	Output is correct
18	Correct	62 ms	4956 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	23 ms	5172 KB	Output is correct
3	Correct	65 ms	5232 KB	Output is correct
4	Correct	62 ms	4956 KB	Output is correct
5	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	396 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	32 ms	2796 KB	Output is correct
14	Correct	21 ms	1884 KB	Output is correct
15	Correct	15 ms	1628 KB	Output is correct
16	Correct	12 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	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	1 ms	344 KB	Output is correct

Subtask #3
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	79 ms	4956 KB	Output is correct
12	Correct	80 ms	4952 KB	Output is correct
13	Correct	51 ms	4952 KB	Output is correct
14	Correct	50 ms	4956 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 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	1 ms	396 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	32 ms	2796 KB	Output is correct
24	Correct	21 ms	1884 KB	Output is correct
25	Correct	15 ms	1628 KB	Output is correct
26	Correct	12 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	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	1 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	23 ms	5172 KB	Output is correct
36	Correct	65 ms	5232 KB	Output is correct
37	Correct	62 ms	4956 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	1 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	344 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	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	15 ms	1280 KB	Output is correct
49	Correct	0 ms	344 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	40 ms	2800 KB	Output is correct
56	Correct	18 ms	1880 KB	Output is correct
57	Correct	15 ms	1884 KB	Output is correct

Subtask #4
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 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	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	396 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	32 ms	2796 KB	Output is correct
10	Correct	21 ms	1884 KB	Output is correct
11	Correct	15 ms	1628 KB	Output is correct
12	Correct	12 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	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	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	23 ms	5172 KB	Output is correct
22	Correct	65 ms	5232 KB	Output is correct
23	Correct	62 ms	4956 KB	Output is correct
24	Correct	12 ms	1112 KB	Output is correct
25	Correct	33 ms	2396 KB	Output is correct
26	Correct	7 ms	860 KB	Output is correct
27	Correct	58 ms	5140 KB	Output is correct
28	Correct	62 ms	4952 KB	Output is correct
29	Correct	62 ms	4956 KB	Output is correct
30	Correct	79 ms	4952 KB	Output is correct
31	Correct	76 ms	4952 KB	Output is correct
32	Correct	42 ms	4952 KB	Output is correct
33	Correct	84 ms	4956 KB	Output is correct
34	Correct	43 ms	4956 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	79 ms	4956 KB	Output is correct
12	Correct	80 ms	4952 KB	Output is correct
13	Correct	51 ms	4952 KB	Output is correct
14	Correct	50 ms	4956 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 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	1 ms	396 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	32 ms	2796 KB	Output is correct
24	Correct	21 ms	1884 KB	Output is correct
25	Correct	15 ms	1628 KB	Output is correct
26	Correct	12 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	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	1 ms	344 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	1 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	344 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	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	15 ms	1280 KB	Output is correct
45	Correct	0 ms	344 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	40 ms	2800 KB	Output is correct
52	Correct	18 ms	1880 KB	Output is correct
53	Correct	15 ms	1884 KB	Output is correct
54	Correct	12 ms	1112 KB	Output is correct
55	Correct	33 ms	2396 KB	Output is correct
56	Correct	7 ms	860 KB	Output is correct
57	Correct	58 ms	5140 KB	Output is correct
58	Correct	62 ms	4952 KB	Output is correct
59	Correct	62 ms	4956 KB	Output is correct
60	Correct	79 ms	4952 KB	Output is correct
61	Correct	76 ms	4952 KB	Output is correct
62	Correct	42 ms	4952 KB	Output is correct
63	Correct	84 ms	4956 KB	Output is correct
64	Correct	43 ms	4956 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	23 ms	5172 KB	Output is correct
67	Correct	65 ms	5232 KB	Output is correct
68	Correct	62 ms	4956 KB	Output is correct
69	Correct	12 ms	860 KB	Output is correct
70	Correct	2 ms	348 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	17 ms	1112 KB	Output is correct
73	Correct	3 ms	604 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	87 ms	5144 KB	Output is correct
76	Correct	109 ms	4952 KB	Output is correct
77	Correct	104 ms	4956 KB	Output is correct
78	Correct	126 ms	5164 KB	Output is correct
79	Correct	124 ms	5148 KB	Output is correct
80	Correct	127 ms	4952 KB	Output is correct
81	Correct	73 ms	4952 KB	Output is correct
82	Correct	52 ms	4952 KB	Output is correct

Submission #995604

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #5 9.0 / 9.0

Subtask #1
10.0 / 10.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0

Subtask #5
9.0 / 9.0