답안 #750697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750697 2023-05-30T07:21:51 Z Kihihihi Self Study (JOI22_ho_t2) C++17
100 / 100
256 ms 10804 KB
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
#include <ctime>
#include <chrono>
#include <cstdio>
#include <random>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <fstream>
#include <functional>
#include <complex>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

short skip_cin = 0;
const unsigned long long INF = 1e18, MOD = 1e9 + 7, MOD2 = 998244353, LOG = 19;
const long double EPS = 1e-9, PI = acos(-1);

bool check(unsigned long long n, unsigned long long m, vector<unsigned long long>& a, vector<unsigned long long>& b, unsigned long long nd)
{
    unsigned long long lw = 0, gt = 0;
    for (unsigned long long i = 0; i < n; i++)
    {
        if (a[i] * m > nd)
        {
            unsigned long long del = (a[i] * m - nd) / a[i];
            gt += del;
        }
    }
    for (unsigned long long i = 0; i < n; i++)
    {
        if (a[i] * m <= nd)
        {
            unsigned long long add = ((nd - a[i] * m) + b[i] - 1) / b[i];
            if (add > n * m)
            {
                return false;
            }
            lw += add;
            if (lw > gt)
            {
                return false;
            }
        }
    }
    return gt >= lw;
}

void solve()
{
    unsigned long long n, m;
    vector<unsigned long long> a, b;
    cin >> n >> m;
    a.resize(n);
    b.resize(n);
    for (unsigned long long i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for (unsigned long long i = 0; i < n; i++)
    {
        cin >> b[i];
        a[i] = max(a[i], b[i]);
    }

    unsigned long long left = 0, right = (1ll << 60);
    while (right - left > 1)
    {
        unsigned long long mid = (left + right) / 2;
        if (check(n, m, a, b, mid))
        {
            left = mid;
        }
        else
        {
            right = mid;
        }
    }
    cout << left << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    srand(time(NULL));

    int tst = 1;
    //cin >> tst;
    while (tst--)
    {
        solve();
    }

    return 0;
}

/*
<3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⠤⠖⠚⢉⣩⣭⡭⠛⠓⠲⠦⣄⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢀⡴⠋⠁⠀⠀⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠳⢦⡀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⡴⠃⢀⡴⢳⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⣆⠀⠀⠀
⠀⠀⠀⠀⡾⠁⣠⠋⠀⠈⢧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢧⠀⠀
⠀⠀⠀⣸⠁⢰⠃⠀⠀⠀⠈⢣⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣇⠀
⠀⠀⠀⡇⠀⡾⡀⠀⠀⠀⠀⣀⣹⣆⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⠀
⠀⠀⢸⠃⢀⣇⡈⠀⠀⠀⠀⠀⠀⢀⡑⢄⡀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇
⠀⠀⢸⠀⢻⡟⡻⢶⡆⠀⠀⠀⠀⡼⠟⡳⢿⣦⡑⢄⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇
⠀⠀⣸⠀⢸⠃⡇⢀⠇⠀⠀⠀⠀⠀⡼⠀⠀⠈⣿⡗⠂⠀⠀⠀⠀⠀⠀⠀⢸⠁
⠀⠀⡏⠀⣼⠀⢳⠊⠀⠀⠀⠀⠀⠀⠱⣀⣀⠔⣸⠁⠀⠀⠀⠀⠀⠀⠀⢠⡟⠀
⠀⠀⡇⢀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⡇⠀⠀⠀⠀⠀⠀⠀⠀⢸⠃⠀
⠀⢸⠃⠘⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠁⠀⠀⢀⠀⠀⠀⠀⠀⣾⠀⠀
⠀⣸⠀⠀⠹⡄⠀⠀⠈⠁⠀⠀⠀⠀⠀⠀⠀⡞⠀⠀⠀⠸⠀⠀⠀⠀⠀⡇⠀⠀
⠀⡏⠀⠀⠀⠙⣆⠀⠀⠀⠀⠀⠀⠀⢀⣠⢶⡇⠀⠀⢰⡀⠀⠀⠀⠀⠀⡇⠀⠀
⢰⠇⡄⠀⠀⠀⡿⢣⣀⣀⣀⡤⠴⡞⠉⠀⢸⠀⠀⠀⣿⡇⠀⠀⠀⠀⠀⣧⠀⠀
⣸⠀⡇⠀⠀⠀⠀⠀⠀⠉⠀⠀⠀⢹⠀⠀⢸⠀⠀⢀⣿⠇⠀⠀⠀⠁⠀⢸⠀⠀
⣿⠀⡇⠀⠀⠀⠀⠀⢀⡤⠤⠶⠶⠾⠤⠄⢸⠀⡀⠸⣿⣀⠀⠀⠀⠀⠀⠈⣇⠀
⡇⠀⡇⠀⠀⡀⠀⡴⠋⠀⠀⠀⠀⠀⠀⠀⠸⡌⣵⡀⢳⡇⠀⠀⠀⠀⠀⠀⢹⡀
⡇⠀⠇⠀⠀⡇⡸⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⠮⢧⣀⣻⢂⠀⠀⠀⠀⠀⠀⢧
⣇⠀⢠⠀⠀⢳⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⡎⣆⠀⠀⠀⠀⠀⠘
⢻⠀⠈⠰⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠰⠘⢮⣧⡀⠀⠀⠀⠀
⠸⡆⠀⠀⠇⣾⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠆⠀⠀⠀⠀⠀⠀⠀⠙⠳⣄⡀⢢⡀
<3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 108 ms 5268 KB Output is correct
12 Correct 104 ms 5204 KB Output is correct
13 Correct 74 ms 5212 KB Output is correct
14 Correct 78 ms 5204 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 40 ms 5072 KB Output is correct
17 Correct 97 ms 5076 KB Output is correct
18 Correct 98 ms 5140 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 40 ms 5072 KB Output is correct
3 Correct 97 ms 5076 KB Output is correct
4 Correct 98 ms 5140 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 61 ms 2920 KB Output is correct
14 Correct 40 ms 2128 KB Output is correct
15 Correct 29 ms 1740 KB Output is correct
16 Correct 27 ms 1612 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 416 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 108 ms 5268 KB Output is correct
12 Correct 104 ms 5204 KB Output is correct
13 Correct 74 ms 5212 KB Output is correct
14 Correct 78 ms 5204 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 61 ms 2920 KB Output is correct
24 Correct 40 ms 2128 KB Output is correct
25 Correct 29 ms 1740 KB Output is correct
26 Correct 27 ms 1612 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 416 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 40 ms 5072 KB Output is correct
36 Correct 97 ms 5076 KB Output is correct
37 Correct 98 ms 5140 KB Output is correct
38 Correct 0 ms 320 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 320 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 3 ms 468 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 20 ms 1228 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 320 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 320 KB Output is correct
55 Correct 55 ms 2788 KB Output is correct
56 Correct 28 ms 2004 KB Output is correct
57 Correct 28 ms 2004 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 61 ms 2920 KB Output is correct
10 Correct 40 ms 2128 KB Output is correct
11 Correct 29 ms 1740 KB Output is correct
12 Correct 27 ms 1612 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 416 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 40 ms 5072 KB Output is correct
22 Correct 97 ms 5076 KB Output is correct
23 Correct 98 ms 5140 KB Output is correct
24 Correct 33 ms 1108 KB Output is correct
25 Correct 78 ms 2556 KB Output is correct
26 Correct 15 ms 844 KB Output is correct
27 Correct 126 ms 5076 KB Output is correct
28 Correct 119 ms 5196 KB Output is correct
29 Correct 121 ms 5140 KB Output is correct
30 Correct 148 ms 5144 KB Output is correct
31 Correct 256 ms 5140 KB Output is correct
32 Correct 69 ms 5076 KB Output is correct
33 Correct 128 ms 5076 KB Output is correct
34 Correct 97 ms 6164 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 108 ms 5268 KB Output is correct
12 Correct 104 ms 5204 KB Output is correct
13 Correct 74 ms 5212 KB Output is correct
14 Correct 78 ms 5204 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 61 ms 2920 KB Output is correct
24 Correct 40 ms 2128 KB Output is correct
25 Correct 29 ms 1740 KB Output is correct
26 Correct 27 ms 1612 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 416 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 0 ms 320 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 320 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 4 ms 468 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 20 ms 1228 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 320 KB Output is correct
51 Correct 55 ms 2788 KB Output is correct
52 Correct 28 ms 2004 KB Output is correct
53 Correct 28 ms 2004 KB Output is correct
54 Correct 33 ms 1108 KB Output is correct
55 Correct 78 ms 2556 KB Output is correct
56 Correct 15 ms 844 KB Output is correct
57 Correct 126 ms 5076 KB Output is correct
58 Correct 119 ms 5196 KB Output is correct
59 Correct 121 ms 5140 KB Output is correct
60 Correct 148 ms 5144 KB Output is correct
61 Correct 256 ms 5140 KB Output is correct
62 Correct 69 ms 5076 KB Output is correct
63 Correct 128 ms 5076 KB Output is correct
64 Correct 97 ms 6164 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 40 ms 5072 KB Output is correct
67 Correct 97 ms 5076 KB Output is correct
68 Correct 98 ms 5140 KB Output is correct
69 Correct 26 ms 1476 KB Output is correct
70 Correct 7 ms 596 KB Output is correct
71 Correct 1 ms 324 KB Output is correct
72 Correct 33 ms 1740 KB Output is correct
73 Correct 7 ms 596 KB Output is correct
74 Correct 1 ms 332 KB Output is correct
75 Correct 152 ms 10804 KB Output is correct
76 Correct 133 ms 10756 KB Output is correct
77 Correct 140 ms 10700 KB Output is correct
78 Correct 174 ms 10700 KB Output is correct
79 Correct 228 ms 10752 KB Output is correct
80 Correct 240 ms 10804 KB Output is correct
81 Correct 114 ms 8712 KB Output is correct
82 Correct 102 ms 8820 KB Output is correct