oj.uz

Submission #1043815

# Submission time Handle Problem Language Result Execution time Memory
1043815 2024-08-04T19:34:41 Z VMaksimoski008 Swapping Cities (APIO20_swap) C++17
44 / 100
 2000 ms 64192 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 3e5 + 5;
const int LOG = 20;

int par[maxn+5], cycle[maxn+5], deg[maxn+5], P[maxn+5], pref[maxn+5], good[maxn+5], d[maxn+5], n, m, N, up[maxn+5][LOG];
vector<int> graph[maxn+5];
vector<array<int, 3> > edges;

int find(int u) {
    if(u == par[u]) return u;
    return par[u] = find(par[u]);
}

void uni(int a, int b) {
    a = find(a); b = find(b); n++;
    if(a == b) cycle[n] = 1;
    par[n] = par[a] = par[b] = n;
    if(good[a] || good[b]) good[n] = 1;
    if(cycle[a] || cycle[b]) cycle[n] = 1;
    graph[n].push_back(a);
    if(a != b) graph[n].push_back(b);
}

void dfs(int u) {
    for(int i=1; i<LOG; i++) up[u][i] = up[up[u][i-1]][i-1];

    for(int &v : graph[u]) {
        d[v] = d[u] + 1;
        up[v][0] = u;
        P[v] = u;
        pref[v] = pref[u] + (good[v] || cycle[v]);
        dfs(v);
    }
}

int get_lca(int a, int b) {
    if(d[a] < d[b]) swap(a, b);
    int D = d[a] - d[b];
    for(int j=LOG-1; j>=0; j--)
        if(D & (1 << j)) a = up[a][j];

    if(a == b) return a;

    for(int j=LOG-1; j>=0; j--)
        if(up[a][j] != up[b][j]) a = up[a][j], b = up[b][j];
    return up[a][0];
}

void init(int _N, int _M, vector<int> U, vector<int> V, vector<int> W) {
    n = _N;
    N = _N;
    m = _M;

    for(int i=1; i<=_N+_M; i++) {
        par[i] = i;
        cycle[i] = deg[i] = good[i] = 0;
    }

    for(int i=0; i<m; i++) edges.push_back({ W[i], U[i] + 1, V[i] + 1});
    sort(edges.begin(), edges.end());
    for(auto &[w, u, v] : edges) {
        deg[u]++; deg[v]++;
        if(deg[u] >= 3) good[n+1] = 1;
        if(deg[v] >= 3) good[n+1] = 1;
        uni(u, v);
    }

    dfs(n);
}

int getMinimumFuelCapacity(int X, int Y) {
    X++; Y++;
    int lca = get_lca(X, Y);
    
    while(true) {
        if(!lca) return -1;
        if(good[lca] || cycle[lca]) return edges[lca-N-1][0];
        lca = up[lca][0];
    }

    return -1;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 2 ms 16988 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 43 ms 33620 KB Output is correct
10 Correct 55 ms 37828 KB Output is correct
11 Correct 54 ms 37320 KB Output is correct
12 Correct 61 ms 39132 KB Output is correct
13 Correct 58 ms 42552 KB Output is correct
14 Correct 52 ms 33732 KB Output is correct
15 Correct 117 ms 39760 KB Output is correct
16 Correct 104 ms 39284 KB Output is correct
17 Correct 113 ms 40468 KB Output is correct
18 Execution timed out 2075 ms 44232 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 109 ms 47980 KB Output is correct
4 Correct 107 ms 49388 KB Output is correct
5 Correct 110 ms 48472 KB Output is correct
6 Correct 107 ms 49196 KB Output is correct
7 Correct 121 ms 48968 KB Output is correct
8 Correct 117 ms 47736 KB Output is correct
9 Correct 107 ms 48616 KB Output is correct
10 Correct 103 ms 47488 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 2 ms 16988 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 2 ms 16988 KB Output is correct
10 Correct 2 ms 16988 KB Output is correct
11 Correct 2 ms 16988 KB Output is correct
12 Correct 2 ms 16988 KB Output is correct
13 Correct 2 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 2 ms 16988 KB Output is correct
16 Correct 2 ms 16988 KB Output is correct
17 Correct 2 ms 16988 KB Output is correct
18 Correct 2 ms 16988 KB Output is correct
19 Correct 2 ms 16988 KB Output is correct
20 Correct 2 ms 16988 KB Output is correct
21 Correct 2 ms 16988 KB Output is correct
22 Correct 3 ms 17240 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 3 ms 17244 KB Output is correct
25 Correct 2 ms 17256 KB Output is correct
26 Correct 3 ms 17288 KB Output is correct
27 Correct 2 ms 17144 KB Output is correct
28 Correct 3 ms 17240 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 2 ms 16984 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 16988 KB Output is correct
5 Correct 2 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 2 ms 16988 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 43 ms 33620 KB Output is correct
11 Correct 55 ms 37828 KB Output is correct
12 Correct 54 ms 37320 KB Output is correct
13 Correct 61 ms 39132 KB Output is correct
14 Correct 58 ms 42552 KB Output is correct
15 Correct 2 ms 16988 KB Output is correct
16 Correct 2 ms 16988 KB Output is correct
17 Correct 2 ms 16988 KB Output is correct
18 Correct 2 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 2 ms 16988 KB Output is correct
21 Correct 2 ms 16988 KB Output is correct
22 Correct 2 ms 16988 KB Output is correct
23 Correct 2 ms 16988 KB Output is correct
24 Correct 2 ms 16988 KB Output is correct
25 Correct 2 ms 16988 KB Output is correct
26 Correct 2 ms 16988 KB Output is correct
27 Correct 3 ms 17240 KB Output is correct
28 Correct 3 ms 16988 KB Output is correct
29 Correct 3 ms 17244 KB Output is correct
30 Correct 2 ms 17256 KB Output is correct
31 Correct 3 ms 17288 KB Output is correct
32 Correct 2 ms 17144 KB Output is correct
33 Correct 3 ms 17240 KB Output is correct
34 Correct 8 ms 18968 KB Output is correct
35 Correct 58 ms 40688 KB Output is correct
36 Correct 66 ms 40644 KB Output is correct
37 Correct 61 ms 40900 KB Output is correct
38 Correct 66 ms 40236 KB Output is correct
39 Correct 63 ms 40144 KB Output is correct
40 Correct 51 ms 38084 KB Output is correct
41 Correct 60 ms 40900 KB Output is correct
42 Correct 82 ms 40648 KB Output is correct
43 Correct 60 ms 45720 KB Output is correct
44 Correct 64 ms 40900 KB Output is correct
45 Correct 97 ms 54464 KB Output is correct
46 Correct 57 ms 40520 KB Output is correct
47 Correct 64 ms 40644 KB Output is correct
48 Correct 64 ms 45256 KB Output is correct
49 Correct 65 ms 54952 KB Output is correct
50 Correct 67 ms 45512 KB Output is correct
51 Correct 73 ms 49224 KB Output is correct
52 Correct 97 ms 56768 KB Output is correct
53 Correct 113 ms 59328 KB Output is correct
54 Correct 108 ms 64192 KB Output is correct
55 Correct 57 ms 45252 KB Output is correct
56 Correct 105 ms 62144 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 2 ms 16988 KB Output is correct
8 Correct 2 ms 16984 KB Output is correct
9 Correct 43 ms 33620 KB Output is correct
10 Correct 55 ms 37828 KB Output is correct
11 Correct 54 ms 37320 KB Output is correct
12 Correct 61 ms 39132 KB Output is correct
13 Correct 58 ms 42552 KB Output is correct
14 Correct 52 ms 33732 KB Output is correct
15 Correct 117 ms 39760 KB Output is correct
16 Correct 104 ms 39284 KB Output is correct
17 Correct 113 ms 40468 KB Output is correct
18 Execution timed out 2075 ms 44232 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 2 ms 16984 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 2 ms 16988 KB Output is correct
5 Correct 2 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 2 ms 16988 KB Output is correct
9 Correct 2 ms 16984 KB Output is correct
10 Correct 43 ms 33620 KB Output is correct
11 Correct 55 ms 37828 KB Output is correct
12 Correct 54 ms 37320 KB Output is correct
13 Correct 61 ms 39132 KB Output is correct
14 Correct 58 ms 42552 KB Output is correct
15 Correct 52 ms 33732 KB Output is correct
16 Correct 117 ms 39760 KB Output is correct
17 Correct 104 ms 39284 KB Output is correct
18 Correct 113 ms 40468 KB Output is correct
19 Execution timed out 2075 ms 44232 KB Time limit exceeded
20 Halted 0 ms 0 KB -