oj.uz

답안 #907654

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907654 2024-01-16T01:29:21 Z gaga999 Self Study (JOI22_ho_t2) C++17
10 / 100
 55 ms 4700 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, l = 1ll << 60, r = 1;
    rd(n, m);
    for (int i = 0; i < n; i++)
        rd(ar[i]), tmin(l, (llt)ar[i]), tmax(r, (llt)ar[i]);
    for (int i = 0; i < n; i++)
        rd(br[i]), tmin(l, (llt)br[i]), tmax(r, (llt)br[i]);
    l *= m, r *= m, n *= m;
    auto ck = [&](llt lm) -> bool
    {
        llt ret = n;
        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;
    };
    while (l < r)
    {
        llt md = (l + r + 1) >> 1;
        if (ck(md))
            l = md;
        else
            r = md - 1;
    }
    prt(r), putchar('\n');
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 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 2 ms 2396 KB Output is correct
11 Correct 54 ms 2812 KB Output is correct
12 Correct 55 ms 2652 KB Output is correct
13 Correct 46 ms 2648 KB Output is correct
14 Correct 47 ms 2648 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 4 ms 2652 KB Output is correct
17 Correct 12 ms 2848 KB Output is correct
18 Correct 45 ms 2652 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct
3 Correct 12 ms 2848 KB Output is correct
4 Correct 45 ms 2652 KB Output is correct
5 Runtime error 3 ms 4700 KB Execution killed with signal 8
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 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 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 2 ms 2396 KB Output is correct
11 Correct 54 ms 2812 KB Output is correct
12 Correct 55 ms 2652 KB Output is correct
13 Correct 46 ms 2648 KB Output is correct
14 Correct 47 ms 2648 KB Output is correct
15 Runtime error 3 ms 4700 KB Execution killed with signal 8
16 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 4700 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 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 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 2 ms 2396 KB Output is correct
11 Correct 54 ms 2812 KB Output is correct
12 Correct 55 ms 2652 KB Output is correct
13 Correct 46 ms 2648 KB Output is correct
14 Correct 47 ms 2648 KB Output is correct
15 Runtime error 3 ms 4700 KB Execution killed with signal 8
16 Halted 0 ms 0 KB -