oj.uz

답안 #966493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966493 2024-04-20T01:53:58 Z gaga999 자매 도시 (APIO20_swap) C++17
100 / 100
 336 ms 49564 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 __int128_t lll;
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 = 2e5 + 5;
int ds[N], vl[N], p1[N], p2[N], ac[20][N], in[N], ou[N], ctt, n, m, ct;
bool ok[N];
vector<int> pt[N], eg[N];

int f(int x)
{
    return ds[x] < 0 ? x : ds[x] = f(ds[x]);
}

inline void mg(int i, int j)
{
    i = f(i), j = f(j);
    if (i != j)
    {
        if (size(pt[i]) < size(pt[j]))
            swap(i, j);
        for (int p : pt[j])
            pt[i].pb(p);
        ds[i] += ds[j], ds[j] = i;
    }
}

void dfs(int u)
{
    in[u] = ++ctt;
    for (int v : eg[u])
    {
        ac[0][v] = u;
        for (int i = 1; i < 20; i++)
            ac[i][v] = ac[i - 1][ac[i - 1][v]];
        dfs(v);
    }
    ou[u] = ctt;
}

inline bool isa(int a, int p)
{
    return in[a] <= in[p] && ou[p] <= ou[a];
}

int lca(int u, int v)
{
    if (f(u) != f(v) || !ok[f(v)])
        return -1;
    if (isa(u, v))
        assert(0);
    for (int i = 19; i >= 0; i--)
        if (ac[i][u] && !isa(ac[i][u], v))
            u = ac[i][u];
    return vl[ac[0][u]];
}

void init(int _n, int _m, vector<int> U, vector<int> V, vector<int> W)
{
    n = ct = _n, m = _m, inin(ds, -1);
    for (int i = 1; i <= n; i++)
        pt[i].pb(i), p1[i] = p2[i] = i;
    vector<int> od(m);
    iota(iter(od), 0);
    sort(iter(od), [&](int a, int b)
         { return W[a] < W[b]; });
    for (int i : od)
    {
        int u = f(++U[i]), v = f(++V[i]);
        if (u == v)
        {
            if (ok[u])
                continue;
            vl[++ct] = W[i];
            for (int j : pt[v])
                eg[ct].pb(j);
            pt[v].clear();
            pt[ct].pb(ct);
            mg(ct, u);
            ok[f(ct)] = 1;
        }
        else
        {
            if (ok[u] || ok[v] || (U[i] != p1[u] && U[i] != p2[u]) ||
                (V[i] != p1[v] && V[i] != p2[v]))
            {
                vl[++ct] = W[i];
                for (int j : pt[v])
                    eg[ct].pb(j);
                pt[v].clear();
                for (int j : pt[u])
                    eg[ct].pb(j);
                pt[u].clear();
                pt[ct].pb(ct);
                mg(ct, u), mg(ct, v);
                ok[f(ct)] = 1;
            }
            else
            {
                int a = U[i] == p1[u] ? p2[u] : p1[u];
                int b = V[i] == p2[v] ? p1[v] : p2[v];
                mg(u, v);
                p1[f(u)] = a, p2[f(v)] = b;
            }
        }
    }
    for (int i = n + 1; i <= ct; i++)
        if (!pt[i].empty())
            dfs(i);
}

int getMinimumFuelCapacity(int X, int Y)
{
    return lca(++X, ++Y);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15704 KB Output is correct
2 Correct 3 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15796 KB Output is correct
5 Correct 4 ms 15704 KB Output is correct
6 Correct 4 ms 15708 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 41 ms 23184 KB Output is correct
10 Correct 50 ms 24780 KB Output is correct
11 Correct 50 ms 24648 KB Output is correct
12 Correct 66 ms 25548 KB Output is correct
13 Correct 44 ms 22412 KB Output is correct
14 Correct 46 ms 23500 KB Output is correct
15 Correct 92 ms 26628 KB Output is correct
16 Correct 93 ms 26456 KB Output is correct
17 Correct 107 ms 27012 KB Output is correct
18 Correct 82 ms 24016 KB Output is correct
19 Correct 54 ms 35072 KB Output is correct
20 Correct 121 ms 42072 KB Output is correct
21 Correct 112 ms 42496 KB Output is correct
22 Correct 116 ms 43120 KB Output is correct
23 Correct 104 ms 39680 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15704 KB Output is correct
2 Correct 3 ms 15708 KB Output is correct
3 Correct 251 ms 49084 KB Output is correct
4 Correct 336 ms 49564 KB Output is correct
5 Correct 251 ms 49184 KB Output is correct
6 Correct 217 ms 49376 KB Output is correct
7 Correct 227 ms 49364 KB Output is correct
8 Correct 212 ms 48628 KB Output is correct
9 Correct 229 ms 49232 KB Output is correct
10 Correct 225 ms 48544 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15704 KB Output is correct
2 Correct 3 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15796 KB Output is correct
5 Correct 4 ms 15704 KB Output is correct
6 Correct 4 ms 15708 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 5 ms 30040 KB Output is correct
10 Correct 5 ms 30044 KB Output is correct
11 Correct 5 ms 30044 KB Output is correct
12 Correct 6 ms 30044 KB Output is correct
13 Correct 6 ms 30044 KB Output is correct
14 Correct 5 ms 30040 KB Output is correct
15 Correct 6 ms 30044 KB Output is correct
16 Correct 6 ms 30044 KB Output is correct
17 Correct 5 ms 30044 KB Output is correct
18 Correct 5 ms 30212 KB Output is correct
19 Correct 5 ms 30044 KB Output is correct
20 Correct 5 ms 30176 KB Output is correct
21 Correct 7 ms 30040 KB Output is correct
22 Correct 5 ms 30040 KB Output is correct
23 Correct 6 ms 30040 KB Output is correct
24 Correct 6 ms 30044 KB Output is correct
25 Correct 6 ms 30012 KB Output is correct
26 Correct 6 ms 30040 KB Output is correct
27 Correct 5 ms 30044 KB Output is correct
28 Correct 6 ms 30044 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 30040 KB Output is correct
2 Correct 3 ms 15704 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15708 KB Output is correct
5 Correct 3 ms 15796 KB Output is correct
6 Correct 4 ms 15704 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 4 ms 15708 KB Output is correct
10 Correct 41 ms 23184 KB Output is correct
11 Correct 50 ms 24780 KB Output is correct
12 Correct 50 ms 24648 KB Output is correct
13 Correct 66 ms 25548 KB Output is correct
14 Correct 44 ms 22412 KB Output is correct
15 Correct 5 ms 30044 KB Output is correct
16 Correct 5 ms 30044 KB Output is correct
17 Correct 6 ms 30044 KB Output is correct
18 Correct 6 ms 30044 KB Output is correct
19 Correct 5 ms 30040 KB Output is correct
20 Correct 6 ms 30044 KB Output is correct
21 Correct 6 ms 30044 KB Output is correct
22 Correct 5 ms 30044 KB Output is correct
23 Correct 5 ms 30212 KB Output is correct
24 Correct 5 ms 30044 KB Output is correct
25 Correct 5 ms 30176 KB Output is correct
26 Correct 7 ms 30040 KB Output is correct
27 Correct 5 ms 30040 KB Output is correct
28 Correct 6 ms 30040 KB Output is correct
29 Correct 6 ms 30044 KB Output is correct
30 Correct 6 ms 30012 KB Output is correct
31 Correct 6 ms 30040 KB Output is correct
32 Correct 5 ms 30044 KB Output is correct
33 Correct 6 ms 30044 KB Output is correct
34 Correct 13 ms 31356 KB Output is correct
35 Correct 62 ms 39248 KB Output is correct
36 Correct 63 ms 38876 KB Output is correct
37 Correct 64 ms 38028 KB Output is correct
38 Correct 64 ms 37460 KB Output is correct
39 Correct 69 ms 37716 KB Output is correct
40 Correct 69 ms 37712 KB Output is correct
41 Correct 62 ms 39752 KB Output is correct
42 Correct 63 ms 39940 KB Output is correct
43 Correct 97 ms 45276 KB Output is correct
44 Correct 84 ms 38992 KB Output is correct
45 Correct 94 ms 40496 KB Output is correct
46 Correct 63 ms 38736 KB Output is correct
47 Correct 74 ms 37656 KB Output is correct
48 Correct 84 ms 40572 KB Output is correct
49 Correct 53 ms 34384 KB Output is correct
50 Correct 48 ms 34136 KB Output is correct
51 Correct 74 ms 38952 KB Output is correct
52 Correct 84 ms 40652 KB Output is correct
53 Correct 125 ms 43004 KB Output is correct
54 Correct 99 ms 42420 KB Output is correct
55 Correct 91 ms 44884 KB Output is correct
56 Correct 114 ms 42836 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15704 KB Output is correct
2 Correct 3 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15796 KB Output is correct
5 Correct 4 ms 15704 KB Output is correct
6 Correct 4 ms 15708 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 41 ms 23184 KB Output is correct
10 Correct 50 ms 24780 KB Output is correct
11 Correct 50 ms 24648 KB Output is correct
12 Correct 66 ms 25548 KB Output is correct
13 Correct 44 ms 22412 KB Output is correct
14 Correct 46 ms 23500 KB Output is correct
15 Correct 92 ms 26628 KB Output is correct
16 Correct 93 ms 26456 KB Output is correct
17 Correct 107 ms 27012 KB Output is correct
18 Correct 82 ms 24016 KB Output is correct
19 Correct 251 ms 49084 KB Output is correct
20 Correct 336 ms 49564 KB Output is correct
21 Correct 251 ms 49184 KB Output is correct
22 Correct 217 ms 49376 KB Output is correct
23 Correct 227 ms 49364 KB Output is correct
24 Correct 212 ms 48628 KB Output is correct
25 Correct 229 ms 49232 KB Output is correct
26 Correct 225 ms 48544 KB Output is correct
27 Correct 5 ms 30044 KB Output is correct
28 Correct 5 ms 30044 KB Output is correct
29 Correct 6 ms 30044 KB Output is correct
30 Correct 6 ms 30044 KB Output is correct
31 Correct 5 ms 30040 KB Output is correct
32 Correct 6 ms 30044 KB Output is correct
33 Correct 6 ms 30044 KB Output is correct
34 Correct 5 ms 30044 KB Output is correct
35 Correct 5 ms 30212 KB Output is correct
36 Correct 13 ms 31356 KB Output is correct
37 Correct 62 ms 39248 KB Output is correct
38 Correct 63 ms 38876 KB Output is correct
39 Correct 64 ms 38028 KB Output is correct
40 Correct 64 ms 37460 KB Output is correct
41 Correct 69 ms 37716 KB Output is correct
42 Correct 69 ms 37712 KB Output is correct
43 Correct 62 ms 39752 KB Output is correct
44 Correct 63 ms 39940 KB Output is correct
45 Correct 97 ms 45276 KB Output is correct
46 Correct 84 ms 38992 KB Output is correct
47 Correct 18 ms 31576 KB Output is correct
48 Correct 116 ms 41732 KB Output is correct
49 Correct 127 ms 40704 KB Output is correct
50 Correct 126 ms 40304 KB Output is correct
51 Correct 123 ms 39744 KB Output is correct
52 Correct 127 ms 39464 KB Output is correct
53 Correct 119 ms 39236 KB Output is correct
54 Correct 120 ms 42412 KB Output is correct
55 Correct 117 ms 41996 KB Output is correct
56 Correct 216 ms 46848 KB Output is correct
57 Correct 157 ms 42032 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 30040 KB Output is correct
2 Correct 3 ms 15704 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15708 KB Output is correct
5 Correct 3 ms 15796 KB Output is correct
6 Correct 4 ms 15704 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 4 ms 15708 KB Output is correct
10 Correct 41 ms 23184 KB Output is correct
11 Correct 50 ms 24780 KB Output is correct
12 Correct 50 ms 24648 KB Output is correct
13 Correct 66 ms 25548 KB Output is correct
14 Correct 44 ms 22412 KB Output is correct
15 Correct 46 ms 23500 KB Output is correct
16 Correct 92 ms 26628 KB Output is correct
17 Correct 93 ms 26456 KB Output is correct
18 Correct 107 ms 27012 KB Output is correct
19 Correct 82 ms 24016 KB Output is correct
20 Correct 251 ms 49084 KB Output is correct
21 Correct 336 ms 49564 KB Output is correct
22 Correct 251 ms 49184 KB Output is correct
23 Correct 217 ms 49376 KB Output is correct
24 Correct 227 ms 49364 KB Output is correct
25 Correct 212 ms 48628 KB Output is correct
26 Correct 229 ms 49232 KB Output is correct
27 Correct 225 ms 48544 KB Output is correct
28 Correct 5 ms 30044 KB Output is correct
29 Correct 5 ms 30044 KB Output is correct
30 Correct 6 ms 30044 KB Output is correct
31 Correct 6 ms 30044 KB Output is correct
32 Correct 5 ms 30040 KB Output is correct
33 Correct 6 ms 30044 KB Output is correct
34 Correct 6 ms 30044 KB Output is correct
35 Correct 5 ms 30044 KB Output is correct
36 Correct 5 ms 30212 KB Output is correct
37 Correct 13 ms 31356 KB Output is correct
38 Correct 62 ms 39248 KB Output is correct
39 Correct 63 ms 38876 KB Output is correct
40 Correct 64 ms 38028 KB Output is correct
41 Correct 64 ms 37460 KB Output is correct
42 Correct 69 ms 37716 KB Output is correct
43 Correct 69 ms 37712 KB Output is correct
44 Correct 62 ms 39752 KB Output is correct
45 Correct 63 ms 39940 KB Output is correct
46 Correct 97 ms 45276 KB Output is correct
47 Correct 84 ms 38992 KB Output is correct
48 Correct 18 ms 31576 KB Output is correct
49 Correct 116 ms 41732 KB Output is correct
50 Correct 127 ms 40704 KB Output is correct
51 Correct 126 ms 40304 KB Output is correct
52 Correct 123 ms 39744 KB Output is correct
53 Correct 127 ms 39464 KB Output is correct
54 Correct 119 ms 39236 KB Output is correct
55 Correct 120 ms 42412 KB Output is correct
56 Correct 117 ms 41996 KB Output is correct
57 Correct 216 ms 46848 KB Output is correct
58 Correct 157 ms 42032 KB Output is correct
59 Correct 54 ms 35072 KB Output is correct
60 Correct 121 ms 42072 KB Output is correct
61 Correct 112 ms 42496 KB Output is correct
62 Correct 116 ms 43120 KB Output is correct
63 Correct 104 ms 39680 KB Output is correct
64 Correct 5 ms 30044 KB Output is correct
65 Correct 5 ms 30176 KB Output is correct
66 Correct 7 ms 30040 KB Output is correct
67 Correct 5 ms 30040 KB Output is correct
68 Correct 6 ms 30040 KB Output is correct
69 Correct 6 ms 30044 KB Output is correct
70 Correct 6 ms 30012 KB Output is correct
71 Correct 6 ms 30040 KB Output is correct
72 Correct 5 ms 30044 KB Output is correct
73 Correct 6 ms 30044 KB Output is correct
74 Correct 94 ms 40496 KB Output is correct
75 Correct 63 ms 38736 KB Output is correct
76 Correct 74 ms 37656 KB Output is correct
77 Correct 84 ms 40572 KB Output is correct
78 Correct 53 ms 34384 KB Output is correct
79 Correct 48 ms 34136 KB Output is correct
80 Correct 74 ms 38952 KB Output is correct
81 Correct 84 ms 40652 KB Output is correct
82 Correct 125 ms 43004 KB Output is correct
83 Correct 99 ms 42420 KB Output is correct
84 Correct 91 ms 44884 KB Output is correct
85 Correct 114 ms 42836 KB Output is correct
86 Correct 54 ms 34124 KB Output is correct
87 Correct 129 ms 40708 KB Output is correct
88 Correct 123 ms 40492 KB Output is correct
89 Correct 176 ms 42184 KB Output is correct
90 Correct 128 ms 36180 KB Output is correct
91 Correct 133 ms 36912 KB Output is correct
92 Correct 166 ms 40908 KB Output is correct
93 Correct 166 ms 42024 KB Output is correct
94 Correct 234 ms 43388 KB Output is correct
95 Correct 152 ms 44236 KB Output is correct
96 Correct 293 ms 46912 KB Output is correct
97 Correct 217 ms 43876 KB Output is correct