oj.uz

Submission #745366

# Submission time Handle Problem Language Result Execution time Memory
745366 2023-05-19T22:05:15 Z Lobo Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 48596 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
const int maxn = 2e5+10;
const int lg = 20;

int n, m, gr[maxn], ds[maxn], dsz[maxn], mn[maxn];
vector<int> mn0[maxn];
vector<pair<int,pair<int,int>>> edgs;
int p[maxn][lg+2], w[maxn][lg+2], h[maxn];
vector<pair<int,int>> g[maxn];

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

void join(int u, int v, int id) {
    gr[u]++;
    gr[v]++;
    int mxgr = max(gr[u],gr[v]);

    u = find(u);
    v = find(v);

    if(u == v || mxgr >= 3 || mn[u] != -1 || mn[v] != -1) {
        if(mn0[u].size()) {
            for(auto x : mn0[u]) {
                mn[x] = id;
            }
            mn0[u].clear();
        }
        if(mn0[v].size()) {
            for(auto x : mn0[v]) {
                mn[x] = id;
            }
            mn0[v].clear();
        }
    }
    if(u == v) return;

    if(dsz[u] < dsz[v]) swap(u,v);

    for(auto x : mn0[v]) {
        mn0[u].pb(x);
    }

    dsz[u]+= dsz[v];
    ds[v] = u;
}


int ds1[maxn], dsz1[maxn];
int find1(int u) {
    if(ds1[u] == u) return u;
    return ds1[u] = find(ds1[u]);
}

void join1(int u, int v) {
    u = find1(u);
    v = find1(v);
    if(u == v) return;

    if(dsz1[u] < dsz1[v]) swap(u,v);
    dsz1[u]+= dsz1[v];
    ds1[v] = u;
}

void dfs(int u, int ant, int antw) {
    p[u][0] = ant;
    w[u][0] = antw;

    for(int i = 1; i <= lg; i++) {
        p[u][i] = p[p[u][i-1]][i-1];
        w[u][i] = max(w[u][i-1],w[p[u][i-1]][i-1]);
    }

    for(auto V : g[u]) if(V.fr != ant) {
        h[V.fr] = h[u]+1;
        dfs(V.fr,u,V.sc);
    }
}

int lca(int u, int v) {
    int ans = 0;
    if(h[u] < h[v]) swap(u,v);

    for(int i = lg; i >= 0; i--) {
        if(h[p[u][i]] >= h[v]) {
            ans = max(ans, w[u][i]);
            u = p[u][i];
        }
    }
    if(u == v) return ans;

    for(int i = lg; i >= 0; i--) {
        if(p[u][i] != p[v][i]) {
            ans = max(ans,w[u][i]);
            u = p[u][i];
            ans = max(ans,w[v][i]);
            v = p[v][i];
        }
    }
    ans = max(ans, w[u][0]);
    return ans;
}

int cu[maxn];
void init(int N, int M, vector<int> U, std::vector<int> V, std::vector<int> W) {
    n = N;
    m = M;

    for(auto i = 0; i < m; i++) {
        edgs.pb(mp(W[i],mp(U[i],V[i])));
    }

    sort(all(edgs));

    for(int i = 0; i < n; i++) {
        gr[i] = 0;
        mn[i] = -1;
        ds[i] = i;
        dsz[i] = 1;
        mn0[i].clear();
        mn0[i].pb(i);
        p[i][0] = -1;
    }

    for(int i = 0; i < m; i++) {
        int u = edgs[i].sc.fr;
        int v = edgs[i].sc.sc;
        if(find(u) != find(v)) {
            g[u].pb(mp(v,i));
            g[v].pb(mp(u,i));
        }
        join(u,v,i);
    }
    for(int i = 0; i < n; i++) cu[i] = mn[i];
    dfs(0,0,-1);
}

int getMinimumFuelCapacity(int x, int y) {
    for(int i = 0; i < n; i++) {
        gr[i] = 0;
        mn[i] = -1;
        ds[i] = i;
        dsz[i] = 1;
        mn0[i].clear();
        mn0[i].pb(i);
        p[i][0] = -1;
    }

    int ans1 = -1;
    for(int i = 0; i < m; i++) {
        int u = edgs[i].sc.fr;
        int v = edgs[i].sc.sc;
        join(u,v,i);
        if(find(x) == find(y) && ans1 == -1) ans1 = i;
    }
    if(ans1 != -1 && cu[x] != -1 && cu[y] != -1) return edgs[max({ans1,cu[x],cu[y]})].fr;
    return -1;





    if(mn[x] == -1 || mn[y] == -1) return -1;

    int ans = -1;
    for(int i = 0; i < m; i++) {
        int u = edgs[i].sc.fr;
        int v = edgs[i].sc.sc;
        join1(u,v);
        if(find1(x) == find1(y) && ans == -1) ans = i;
    }
    if(ans == -1) return -1;
    return edgs[max({ans,mn[x],mn[y]})].fr;

}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9800 KB Output is correct
5 Correct 6 ms 10056 KB Output is correct
6 Correct 6 ms 9940 KB Output is correct
7 Correct 6 ms 10080 KB Output is correct
8 Correct 6 ms 10068 KB Output is correct
9 Correct 155 ms 38792 KB Output is correct
10 Correct 225 ms 45852 KB Output is correct
11 Correct 235 ms 45016 KB Output is correct
12 Correct 244 ms 47296 KB Output is correct
13 Correct 198 ms 46108 KB Output is correct
14 Execution timed out 2075 ms 38280 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Execution timed out 2060 ms 39824 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9800 KB Output is correct
5 Correct 6 ms 10056 KB Output is correct
6 Correct 6 ms 9940 KB Output is correct
7 Correct 6 ms 10080 KB Output is correct
8 Correct 6 ms 10068 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 6 ms 9940 KB Output is correct
11 Correct 6 ms 9996 KB Output is correct
12 Correct 6 ms 9940 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 9940 KB Output is correct
15 Correct 6 ms 10068 KB Output is correct
16 Correct 6 ms 10068 KB Output is correct
17 Correct 6 ms 10068 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 8 ms 9960 KB Output is correct
20 Correct 7 ms 10068 KB Output is correct
21 Correct 6 ms 9940 KB Output is correct
22 Correct 6 ms 9812 KB Output is correct
23 Correct 6 ms 9908 KB Output is correct
24 Correct 6 ms 10060 KB Output is correct
25 Correct 7 ms 10068 KB Output is correct
26 Correct 6 ms 10068 KB Output is correct
27 Correct 6 ms 10068 KB Output is correct
28 Correct 7 ms 10076 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9800 KB Output is correct
6 Correct 6 ms 10056 KB Output is correct
7 Correct 6 ms 9940 KB Output is correct
8 Correct 6 ms 10080 KB Output is correct
9 Correct 6 ms 10068 KB Output is correct
10 Correct 155 ms 38792 KB Output is correct
11 Correct 225 ms 45852 KB Output is correct
12 Correct 235 ms 45016 KB Output is correct
13 Correct 244 ms 47296 KB Output is correct
14 Correct 198 ms 46108 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 6 ms 9996 KB Output is correct
17 Correct 6 ms 9940 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 6 ms 10068 KB Output is correct
21 Correct 6 ms 10068 KB Output is correct
22 Correct 6 ms 10068 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 8 ms 9960 KB Output is correct
25 Correct 7 ms 10068 KB Output is correct
26 Correct 6 ms 9940 KB Output is correct
27 Correct 6 ms 9812 KB Output is correct
28 Correct 6 ms 9908 KB Output is correct
29 Correct 6 ms 10060 KB Output is correct
30 Correct 7 ms 10068 KB Output is correct
31 Correct 6 ms 10068 KB Output is correct
32 Correct 6 ms 10068 KB Output is correct
33 Correct 7 ms 10076 KB Output is correct
34 Correct 18 ms 13716 KB Output is correct
35 Correct 262 ms 45960 KB Output is correct
36 Correct 299 ms 43576 KB Output is correct
37 Correct 277 ms 41180 KB Output is correct
38 Correct 248 ms 39804 KB Output is correct
39 Correct 231 ms 38976 KB Output is correct
40 Correct 172 ms 36516 KB Output is correct
41 Correct 244 ms 45120 KB Output is correct
42 Correct 254 ms 46132 KB Output is correct
43 Correct 218 ms 43884 KB Output is correct
44 Correct 200 ms 39740 KB Output is correct
45 Correct 190 ms 35592 KB Output is correct
46 Correct 242 ms 42640 KB Output is correct
47 Correct 214 ms 39744 KB Output is correct
48 Correct 223 ms 39176 KB Output is correct
49 Correct 69 ms 16572 KB Output is correct
50 Correct 60 ms 15848 KB Output is correct
51 Correct 145 ms 31080 KB Output is correct
52 Correct 282 ms 45152 KB Output is correct
53 Correct 248 ms 42936 KB Output is correct
54 Correct 301 ms 48596 KB Output is correct
55 Correct 219 ms 44936 KB Output is correct
56 Correct 248 ms 42168 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9800 KB Output is correct
5 Correct 6 ms 10056 KB Output is correct
6 Correct 6 ms 9940 KB Output is correct
7 Correct 6 ms 10080 KB Output is correct
8 Correct 6 ms 10068 KB Output is correct
9 Correct 155 ms 38792 KB Output is correct
10 Correct 225 ms 45852 KB Output is correct
11 Correct 235 ms 45016 KB Output is correct
12 Correct 244 ms 47296 KB Output is correct
13 Correct 198 ms 46108 KB Output is correct
14 Execution timed out 2075 ms 38280 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9800 KB Output is correct
6 Correct 6 ms 10056 KB Output is correct
7 Correct 6 ms 9940 KB Output is correct
8 Correct 6 ms 10080 KB Output is correct
9 Correct 6 ms 10068 KB Output is correct
10 Correct 155 ms 38792 KB Output is correct
11 Correct 225 ms 45852 KB Output is correct
12 Correct 235 ms 45016 KB Output is correct
13 Correct 244 ms 47296 KB Output is correct
14 Correct 198 ms 46108 KB Output is correct
15 Execution timed out 2075 ms 38280 KB Time limit exceeded
16 Halted 0 ms 0 KB -