답안 #907650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907650 2024-01-16T01:24:32 Z gaga999 Self Study (JOI22_ho_t2) C++17
100 / 100
170 ms 2908 KB
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 3e5 + 5;
int ar[N], br[N];

signed main()
{
    int n;
    llt m;
    rd(n, m);
    for (int i = 0; i < n; i++)
        rd(ar[i]);
    for (int i = 0; i < n; i++)
        rd(br[i]);
    auto ck = [&](llt lm) -> bool
    {
        llt ret = n * m;
        for (int i = 0; i < n; i++)
        {
            if (ar[i] > br[i])
            {
                if (ar[i] * m >= lm)
                    ret -= (lm - 1) / ar[i] + 1;
                else
                    ret -= m, ret -= (lm - ar[i] * m - 1) / br[i] + 1;
            }
            else
                ret -= (lm - 1) / br[i] + 1;
            if (ret < 0)
                return 0;
        }
        return 1;
    };
    llt l = 1, r = 1ll << 60;
    while (l < r)
    {
        llt md = (l + r + 1) >> 1;
        if (ck(md))
            l = md;
        else
            r = md - 1;
    }
    prt(r), putchar('\n');
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 56 ms 2812 KB Output is correct
12 Correct 56 ms 2652 KB Output is correct
13 Correct 41 ms 2648 KB Output is correct
14 Correct 34 ms 2652 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 5 ms 2652 KB Output is correct
17 Correct 45 ms 2824 KB Output is correct
18 Correct 45 ms 2648 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 5 ms 2652 KB Output is correct
3 Correct 45 ms 2824 KB Output is correct
4 Correct 45 ms 2648 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 24 ms 2652 KB Output is correct
14 Correct 17 ms 2728 KB Output is correct
15 Correct 12 ms 2652 KB Output is correct
16 Correct 11 ms 2652 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 56 ms 2812 KB Output is correct
12 Correct 56 ms 2652 KB Output is correct
13 Correct 41 ms 2648 KB Output is correct
14 Correct 34 ms 2652 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 24 ms 2652 KB Output is correct
24 Correct 17 ms 2728 KB Output is correct
25 Correct 12 ms 2652 KB Output is correct
26 Correct 11 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 2 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 5 ms 2652 KB Output is correct
36 Correct 45 ms 2824 KB Output is correct
37 Correct 45 ms 2648 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2392 KB Output is correct
45 Correct 2 ms 2396 KB Output is correct
46 Correct 2 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 11 ms 2736 KB Output is correct
49 Correct 1 ms 2392 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 2 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 30 ms 2652 KB Output is correct
56 Correct 17 ms 2908 KB Output is correct
57 Correct 14 ms 2904 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 24 ms 2652 KB Output is correct
10 Correct 17 ms 2728 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 5 ms 2652 KB Output is correct
22 Correct 45 ms 2824 KB Output is correct
23 Correct 45 ms 2648 KB Output is correct
24 Correct 21 ms 2732 KB Output is correct
25 Correct 47 ms 2648 KB Output is correct
26 Correct 7 ms 2904 KB Output is correct
27 Correct 43 ms 2652 KB Output is correct
28 Correct 48 ms 2648 KB Output is correct
29 Correct 50 ms 2652 KB Output is correct
30 Correct 72 ms 2828 KB Output is correct
31 Correct 148 ms 2820 KB Output is correct
32 Correct 85 ms 2820 KB Output is correct
33 Correct 170 ms 2836 KB Output is correct
34 Correct 86 ms 2648 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 56 ms 2812 KB Output is correct
12 Correct 56 ms 2652 KB Output is correct
13 Correct 41 ms 2648 KB Output is correct
14 Correct 34 ms 2652 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 24 ms 2652 KB Output is correct
24 Correct 17 ms 2728 KB Output is correct
25 Correct 12 ms 2652 KB Output is correct
26 Correct 11 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 2 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 2 ms 2396 KB Output is correct
42 Correct 2 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 11 ms 2736 KB Output is correct
45 Correct 1 ms 2392 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 30 ms 2652 KB Output is correct
52 Correct 17 ms 2908 KB Output is correct
53 Correct 14 ms 2904 KB Output is correct
54 Correct 21 ms 2732 KB Output is correct
55 Correct 47 ms 2648 KB Output is correct
56 Correct 7 ms 2904 KB Output is correct
57 Correct 43 ms 2652 KB Output is correct
58 Correct 48 ms 2648 KB Output is correct
59 Correct 50 ms 2652 KB Output is correct
60 Correct 72 ms 2828 KB Output is correct
61 Correct 148 ms 2820 KB Output is correct
62 Correct 85 ms 2820 KB Output is correct
63 Correct 170 ms 2836 KB Output is correct
64 Correct 86 ms 2648 KB Output is correct
65 Correct 1 ms 2392 KB Output is correct
66 Correct 5 ms 2652 KB Output is correct
67 Correct 45 ms 2824 KB Output is correct
68 Correct 45 ms 2648 KB Output is correct
69 Correct 15 ms 2648 KB Output is correct
70 Correct 5 ms 2396 KB Output is correct
71 Correct 1 ms 2396 KB Output is correct
72 Correct 23 ms 2724 KB Output is correct
73 Correct 5 ms 2396 KB Output is correct
74 Correct 1 ms 2396 KB Output is correct
75 Correct 61 ms 2824 KB Output is correct
76 Correct 69 ms 2824 KB Output is correct
77 Correct 75 ms 2824 KB Output is correct
78 Correct 101 ms 2660 KB Output is correct
79 Correct 150 ms 2824 KB Output is correct
80 Correct 161 ms 2904 KB Output is correct
81 Correct 169 ms 2820 KB Output is correct
82 Correct 132 ms 2824 KB Output is correct