oj.uz

답안 #1065219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065219 2024-08-19T03:45:46 Z vjudge1 자매 도시 (APIO20_swap) C++17
0 / 100
 255 ms 40692 KB 
#include <bits/stdc++.h>
#include "swap.h"
#include <vector>
using namespace std;
const int Z = 3e5 + 17;
int n, m, q, lg, c[Z], ans[Z];
int r[Z], d[Z], p[20][Z];
tuple <int, int, int> e[Z];
vector <int> adj[Z];
bool ex[Z];
int root (int u)
{
    if (u == r[u])
    {
        return u;
    }
    return r[u] = root(r[u]);
}
void join (int x, int y, int z)
{
    x = root(x);
    y = root(y);
    ++n, r[n] = n;
    if (x == y)
    {
        ex[n] = 1, r[x] = n;
        adj[n].push_back(x);
    }
    else
    {
        ex[n] = ex[x] | ex[y] | z;
        r[x] = r[y] = n;
        adj[n].push_back(x);
        adj[n].push_back(y);
    }
}
int lca (int u, int v)
{
    if (d[u] < d[v])
    {
        swap (u, v);
    }
    for (int i = lg; i >= 0; --i)
    {
        if (d[p[i][u]] >= d[v])
        {
            u = p[i][u];
        }
    }
    if (u == v)
    {
        return u;
    }
    for (int i = lg; i >= 0; --i)
    {
        if (p[i][u] != p[i][v])
        {
            u = p[i][u], v = p[i][v];
        }
    }
    return p[0][u];
}
void dfs (int u, int pr)
{
    d[u] = d[pr] + 1, p[0][u] = pr;
    for (int i = 1; i <= lg; ++i)
    {
        p[i][u] = p[i - 1][p[i - 1][u]];
    }
    for (int v: adj[u])
    {
        if (v != pr)
        {
            dfs (v, u);
        }
    }
}
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W)
{
    n = N, m = M;
    lg = __lg(n + m);
    for (int i = 0; i < m; ++i)
    {
        int u = U[i], v = V[i], w = W[i];
        ++u, ++v;
        e[i] = {w, u, v};
    }
    for (int i = 1; i <= n; ++i)
    {
        r[i] = i;
    }
    sort (e + 1, e + m + 1);
    for (int i = 1; i <= m; ++i)
    {
        auto [w, u, v] = e[i];
        ++c[u], ++c[v];
        int z = (c[u] > 2) | (c[v] > 2);
        join (u, v, z);
        ans[n] = w;
    }
    for (int i = n; i >= 0; --i)
    {
        if (!d[i])
        {
            dfs (i, 0);
        }
    }
}
int getMinimumFuelCapacity(int u, int v)
{
    ++u, ++v;
    int z = lca (u, v);
    if (ex[z])
    {
        return ans[z];
    }
    for (int i = lg; i >= 0; --i)
    {
        if (p[i][z] && !ex[p[i][z]])
        {
            z = p[i][z];
        }
    }
    z = p[0][z];
    if (!z)
    {
        return -1;
    }
    return ans[z];
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7516 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7676 KB Output is correct
5 Correct 3 ms 7772 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 53 ms 27396 KB Output is correct
10 Correct 66 ms 31828 KB Output is correct
11 Correct 75 ms 31316 KB Output is correct
12 Correct 69 ms 32848 KB Output is correct
13 Correct 66 ms 35024 KB Output is correct
14 Correct 63 ms 27736 KB Output is correct
15 Correct 178 ms 36156 KB Output is correct
16 Correct 188 ms 35496 KB Output is correct
17 Correct 182 ms 36792 KB Output is correct
18 Correct 255 ms 39100 KB Output is correct
19 Incorrect 83 ms 15200 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7516 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7676 KB Output is correct
5 Correct 3 ms 7772 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 3 ms 7512 KB Output is correct
10 Correct 4 ms 7772 KB Output is correct
11 Correct 3 ms 7772 KB Output is correct
12 Correct 4 ms 7772 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 4 ms 7756 KB Output is correct
15 Correct 3 ms 7772 KB Output is correct
16 Incorrect 3 ms 7772 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 4 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7676 KB Output is correct
6 Correct 3 ms 7772 KB Output is correct
7 Correct 4 ms 7516 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 3 ms 7772 KB Output is correct
10 Correct 53 ms 27396 KB Output is correct
11 Correct 66 ms 31828 KB Output is correct
12 Correct 75 ms 31316 KB Output is correct
13 Correct 69 ms 32848 KB Output is correct
14 Correct 66 ms 35024 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct
16 Correct 3 ms 7772 KB Output is correct
17 Correct 4 ms 7772 KB Output is correct
18 Correct 3 ms 7516 KB Output is correct
19 Correct 4 ms 7756 KB Output is correct
20 Correct 3 ms 7772 KB Output is correct
21 Incorrect 3 ms 7772 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7516 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7676 KB Output is correct
5 Correct 3 ms 7772 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 53 ms 27396 KB Output is correct
10 Correct 66 ms 31828 KB Output is correct
11 Correct 75 ms 31316 KB Output is correct
12 Correct 69 ms 32848 KB Output is correct
13 Correct 66 ms 35024 KB Output is correct
14 Correct 63 ms 27736 KB Output is correct
15 Correct 178 ms 36156 KB Output is correct
16 Correct 188 ms 35496 KB Output is correct
17 Correct 182 ms 36792 KB Output is correct
18 Correct 255 ms 39100 KB Output is correct
19 Incorrect 217 ms 40692 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 4 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7676 KB Output is correct
6 Correct 3 ms 7772 KB Output is correct
7 Correct 4 ms 7516 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 3 ms 7772 KB Output is correct
10 Correct 53 ms 27396 KB Output is correct
11 Correct 66 ms 31828 KB Output is correct
12 Correct 75 ms 31316 KB Output is correct
13 Correct 69 ms 32848 KB Output is correct
14 Correct 66 ms 35024 KB Output is correct
15 Correct 63 ms 27736 KB Output is correct
16 Correct 178 ms 36156 KB Output is correct
17 Correct 188 ms 35496 KB Output is correct
18 Correct 182 ms 36792 KB Output is correct
19 Correct 255 ms 39100 KB Output is correct
20 Incorrect 217 ms 40692 KB Output isn't correct
21 Halted 0 ms 0 KB -