oj.uz

답안 #966482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966482 2024-04-20T01:39:05 Z gaga999 자매 도시 (APIO20_swap) C++17
6 / 100
 119 ms 45476 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], 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))
        return vl[u]; // 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);
    vector<int> od(m);
    iota(iter(od), 0);
    sort(iter(od), [&](int a, int b)
         { return W[a] < W[b]; });
    for (int i : od)
    {
        U[i] = f(++U[i]), V[i] = f(++V[i]);
        if (U[i] == V[i])
        {
            if (ok[U[i]])
                continue;
            vl[++ct] = W[i];
            for (int v : pt[V[i]])
                eg[ct].pb(v);
            pt[V[i]].clear();
            pt[ct].pb(ct);
            mg(ct, U[i]);
            ok[f(ct)] = 1;
        }
        else
        {
            if (ok[U[i]] || ok[V[i]])
            {
                vl[++ct] = W[i];
                for (int v : pt[V[i]])
                    eg[ct].pb(v);
                pt[V[i]].clear();
                for (int v : pt[U[i]])
                    eg[ct].pb(v);
                pt[U[i]].clear();
                pt[ct].pb(ct);
                mg(ct, U[i]), mg(ct, V[i]);
                ok[f(ct)] = 1;
            }
            else
                mg(U[i], V[i]);
        }
    }
    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 2 ms 11612 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 3 ms 11612 KB Output is correct
4 Correct 3 ms 11608 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 4 ms 11612 KB Output is correct
7 Correct 3 ms 11612 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 39 ms 19288 KB Output is correct
10 Correct 48 ms 20572 KB Output is correct
11 Correct 47 ms 20552 KB Output is correct
12 Correct 65 ms 21132 KB Output is correct
13 Correct 42 ms 18320 KB Output is correct
14 Correct 48 ms 19404 KB Output is correct
15 Correct 96 ms 22348 KB Output is correct
16 Correct 91 ms 22168 KB Output is correct
17 Correct 108 ms 22688 KB Output is correct
18 Correct 88 ms 19920 KB Output is correct
19 Correct 59 ms 32852 KB Output is correct
20 Correct 115 ms 44224 KB Output is correct
21 Correct 116 ms 44708 KB Output is correct
22 Correct 119 ms 45476 KB Output is correct
23 Correct 114 ms 42048 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Incorrect 81 ms 19340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 3 ms 11612 KB Output is correct
4 Correct 3 ms 11608 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 4 ms 11612 KB Output is correct
7 Correct 3 ms 11612 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 5 ms 27992 KB Output is correct
10 Incorrect 3 ms 11612 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27992 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 3 ms 11612 KB Output is correct
5 Correct 3 ms 11608 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 4 ms 11612 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 39 ms 19288 KB Output is correct
11 Correct 48 ms 20572 KB Output is correct
12 Correct 47 ms 20552 KB Output is correct
13 Correct 65 ms 21132 KB Output is correct
14 Correct 42 ms 18320 KB Output is correct
15 Incorrect 3 ms 11612 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 3 ms 11612 KB Output is correct
4 Correct 3 ms 11608 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 4 ms 11612 KB Output is correct
7 Correct 3 ms 11612 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 39 ms 19288 KB Output is correct
10 Correct 48 ms 20572 KB Output is correct
11 Correct 47 ms 20552 KB Output is correct
12 Correct 65 ms 21132 KB Output is correct
13 Correct 42 ms 18320 KB Output is correct
14 Correct 48 ms 19404 KB Output is correct
15 Correct 96 ms 22348 KB Output is correct
16 Correct 91 ms 22168 KB Output is correct
17 Correct 108 ms 22688 KB Output is correct
18 Correct 88 ms 19920 KB Output is correct
19 Incorrect 81 ms 19340 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27992 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 3 ms 11612 KB Output is correct
5 Correct 3 ms 11608 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 4 ms 11612 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 39 ms 19288 KB Output is correct
11 Correct 48 ms 20572 KB Output is correct
12 Correct 47 ms 20552 KB Output is correct
13 Correct 65 ms 21132 KB Output is correct
14 Correct 42 ms 18320 KB Output is correct
15 Correct 48 ms 19404 KB Output is correct
16 Correct 96 ms 22348 KB Output is correct
17 Correct 91 ms 22168 KB Output is correct
18 Correct 108 ms 22688 KB Output is correct
19 Correct 88 ms 19920 KB Output is correct
20 Incorrect 81 ms 19340 KB Output isn't correct
21 Halted 0 ms 0 KB -