oj.uz

답안 #983833

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983833 2024-05-16T07:07:33 Z gaga999 게임 (APIO22_game) C++17
100 / 100
 1582 ms 125684 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#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 inin(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 size(x) (int)x.size()
#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 unsigned long long ull;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef pair<llt, int> pli;
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 n, k, ll[N], rr[N];
vector<int> e1[N], e2[N];
void init(int _n, int _k)
{
    n = _n, k = _k;
    fill(ll, ll + n, -1), fill(rr, rr + n, k);
    for (int i = 0; i < k; i++)
        ll[i] = rr[i] = i;
}

bool add(int u, int v);

bool add(int u)
{
    for (int v : e1[u])
        if (add(u, v))
            return 1;
    for (int v : e2[u])
        if (add(v, u))
            return 1;
    return 0;
}

bool add(int u, int v)
{
    if (ll[u] >= rr[v])
        return 1;
    int m = (ll[u] + rr[u]) >> 1;
    if (rr[v] <= m)
    {
        rr[u] = m;
        return add(u);
    }
    m = (ll[v] + rr[v]) >> 1;
    if (ll[u] > m)
    {
        ll[v] = m + 1;
        return add(v);
    }
    return 0;
}

int add_teleporter(int u, int v)
{
    if (max(u, v) < k)
        return u >= v;
    e1[u].pb(v), e2[v].pb(u);
    return add(u, v);
}

// signed main()
// {
//     int n, k, q;
//     rd(n, q, k);
//     init(n, k);
//     for (int i = 0; i < q; i++)
//     {
//         int x, y;
//         rd(x, y);
//         if (add_teleporter(x, y))
//         {
//             // for (int i = 0; i < n; i++)
//             //     db(mx[i], mn[i]);
//             // db(i, x, y);
//             db(i);
//             exit(0);
//         }
//     }
//     db(q);
// }

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 14936 KB Output is correct
3 Correct 4 ms 14936 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 14936 KB Output is correct
3 Correct 4 ms 14936 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14936 KB Output is correct
13 Correct 3 ms 14936 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 4 ms 15188 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 5 ms 15192 KB Output is correct
19 Correct 3 ms 14936 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 14936 KB Output is correct
3 Correct 4 ms 14936 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14936 KB Output is correct
13 Correct 3 ms 14936 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 4 ms 15188 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 5 ms 15192 KB Output is correct
19 Correct 3 ms 14936 KB Output is correct
20 Correct 4 ms 15192 KB Output is correct
21 Correct 3 ms 14936 KB Output is correct
22 Correct 4 ms 15444 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 5 ms 15264 KB Output is correct
26 Correct 5 ms 14936 KB Output is correct
27 Correct 5 ms 15188 KB Output is correct
28 Correct 5 ms 15192 KB Output is correct
29 Correct 4 ms 14936 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 14936 KB Output is correct
3 Correct 4 ms 14936 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14936 KB Output is correct
13 Correct 3 ms 14936 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 4 ms 15188 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 5 ms 15192 KB Output is correct
19 Correct 3 ms 14936 KB Output is correct
20 Correct 4 ms 15192 KB Output is correct
21 Correct 3 ms 14936 KB Output is correct
22 Correct 4 ms 15444 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 5 ms 15264 KB Output is correct
26 Correct 5 ms 14936 KB Output is correct
27 Correct 5 ms 15188 KB Output is correct
28 Correct 5 ms 15192 KB Output is correct
29 Correct 4 ms 14936 KB Output is correct
30 Correct 17 ms 16224 KB Output is correct
31 Correct 8 ms 15448 KB Output is correct
32 Correct 23 ms 23948 KB Output is correct
33 Correct 20 ms 17544 KB Output is correct
34 Correct 34 ms 30420 KB Output is correct
35 Correct 38 ms 18848 KB Output is correct
36 Correct 38 ms 17304 KB Output is correct
37 Correct 44 ms 17608 KB Output is correct
38 Correct 27 ms 17348 KB Output is correct
39 Correct 30 ms 17536 KB Output is correct
40 Correct 25 ms 19564 KB Output is correct
41 Correct 32 ms 18516 KB Output is correct
42 Correct 33 ms 19860 KB Output is correct
43 Correct 32 ms 18264 KB Output is correct
44 Correct 37 ms 18380 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 14936 KB Output is correct
3 Correct 4 ms 14936 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14936 KB Output is correct
13 Correct 3 ms 14936 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 4 ms 15188 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 5 ms 15192 KB Output is correct
19 Correct 3 ms 14936 KB Output is correct
20 Correct 4 ms 15192 KB Output is correct
21 Correct 3 ms 14936 KB Output is correct
22 Correct 4 ms 15444 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 5 ms 15264 KB Output is correct
26 Correct 5 ms 14936 KB Output is correct
27 Correct 5 ms 15188 KB Output is correct
28 Correct 5 ms 15192 KB Output is correct
29 Correct 4 ms 14936 KB Output is correct
30 Correct 17 ms 16224 KB Output is correct
31 Correct 8 ms 15448 KB Output is correct
32 Correct 23 ms 23948 KB Output is correct
33 Correct 20 ms 17544 KB Output is correct
34 Correct 34 ms 30420 KB Output is correct
35 Correct 38 ms 18848 KB Output is correct
36 Correct 38 ms 17304 KB Output is correct
37 Correct 44 ms 17608 KB Output is correct
38 Correct 27 ms 17348 KB Output is correct
39 Correct 30 ms 17536 KB Output is correct
40 Correct 25 ms 19564 KB Output is correct
41 Correct 32 ms 18516 KB Output is correct
42 Correct 33 ms 19860 KB Output is correct
43 Correct 32 ms 18264 KB Output is correct
44 Correct 37 ms 18380 KB Output is correct
45 Correct 196 ms 28692 KB Output is correct
46 Correct 10 ms 17496 KB Output is correct
47 Correct 7 ms 17240 KB Output is correct
48 Correct 308 ms 45792 KB Output is correct
49 Correct 202 ms 36280 KB Output is correct
50 Correct 536 ms 125684 KB Output is correct
51 Correct 799 ms 64456 KB Output is correct
52 Correct 589 ms 35736 KB Output is correct
53 Correct 760 ms 36328 KB Output is correct
54 Correct 763 ms 35576 KB Output is correct
55 Correct 1051 ms 37172 KB Output is correct
56 Correct 1299 ms 36072 KB Output is correct
57 Correct 357 ms 29772 KB Output is correct
58 Correct 415 ms 30228 KB Output is correct
59 Correct 405 ms 30708 KB Output is correct
60 Correct 473 ms 29912 KB Output is correct
61 Correct 614 ms 29748 KB Output is correct
62 Correct 420 ms 42024 KB Output is correct
63 Correct 355 ms 38924 KB Output is correct
64 Correct 1122 ms 69744 KB Output is correct
65 Correct 469 ms 46508 KB Output is correct
66 Correct 355 ms 33616 KB Output is correct
67 Correct 876 ms 65164 KB Output is correct
68 Correct 201 ms 26840 KB Output is correct
69 Correct 48 ms 20760 KB Output is correct
70 Correct 837 ms 43200 KB Output is correct
71 Correct 245 ms 28788 KB Output is correct
72 Correct 187 ms 24240 KB Output is correct
73 Correct 645 ms 42416 KB Output is correct
74 Correct 1582 ms 35676 KB Output is correct
75 Correct 1102 ms 47808 KB Output is correct
76 Correct 1146 ms 54336 KB Output is correct