oj.uz

Submission #745362

# Submission time Handle Problem Language Result Execution time Memory
745362 2023-05-19T22:02:00 Z Lobo Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 194852 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;
}

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);
    }
    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;
        if(find(u) != find(v)) {
            g[u].pb(mp(v,i));
            g[v].pb(mp(u,i));
        }
        join(u,v,i);
        if(find(x) == find(y) && mn[x] != -1 && mn[y] != -1 && ans1 == -1) ans1 = i;
    }
    if(ans1 != -1 && mn[x] != -1 && mn[y] != -1) return edgs[max({ans1,mn[x],mn[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 9652 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 7 ms 9964 KB Output is correct
5 Correct 7 ms 10196 KB Output is correct
6 Correct 10 ms 10128 KB Output is correct
7 Correct 6 ms 10196 KB Output is correct
8 Correct 8 ms 10196 KB Output is correct
9 Correct 237 ms 41644 KB Output is correct
10 Correct 363 ms 56316 KB Output is correct
11 Correct 386 ms 55132 KB Output is correct
12 Correct 393 ms 58116 KB Output is correct
13 Correct 269 ms 55228 KB Output is correct
14 Execution timed out 2086 ms 194852 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 9652 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Execution timed out 2068 ms 191916 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 9652 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 7 ms 9964 KB Output is correct
5 Correct 7 ms 10196 KB Output is correct
6 Correct 10 ms 10128 KB Output is correct
7 Correct 6 ms 10196 KB Output is correct
8 Correct 8 ms 10196 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 9 ms 10068 KB Output is correct
11 Correct 7 ms 10196 KB Output is correct
12 Correct 6 ms 10192 KB Output is correct
13 Correct 6 ms 10072 KB Output is correct
14 Correct 6 ms 9992 KB Output is correct
15 Correct 7 ms 10196 KB Output is correct
16 Correct 6 ms 10240 KB Output is correct
17 Correct 7 ms 10196 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 6 ms 10196 KB Output is correct
21 Correct 10 ms 10076 KB Output is correct
22 Correct 6 ms 9812 KB Output is correct
23 Correct 6 ms 10068 KB Output is correct
24 Correct 8 ms 10256 KB Output is correct
25 Correct 7 ms 10196 KB Output is correct
26 Correct 7 ms 10196 KB Output is correct
27 Correct 6 ms 10196 KB Output is correct
28 Correct 7 ms 10204 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9652 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 7 ms 9964 KB Output is correct
6 Correct 7 ms 10196 KB Output is correct
7 Correct 10 ms 10128 KB Output is correct
8 Correct 6 ms 10196 KB Output is correct
9 Correct 8 ms 10196 KB Output is correct
10 Correct 237 ms 41644 KB Output is correct
11 Correct 363 ms 56316 KB Output is correct
12 Correct 386 ms 55132 KB Output is correct
13 Correct 393 ms 58116 KB Output is correct
14 Correct 269 ms 55228 KB Output is correct
15 Correct 9 ms 10068 KB Output is correct
16 Correct 7 ms 10196 KB Output is correct
17 Correct 6 ms 10192 KB Output is correct
18 Correct 6 ms 10072 KB Output is correct
19 Correct 6 ms 9992 KB Output is correct
20 Correct 7 ms 10196 KB Output is correct
21 Correct 6 ms 10240 KB Output is correct
22 Correct 7 ms 10196 KB Output is correct
23 Correct 6 ms 10068 KB Output is correct
24 Correct 6 ms 9940 KB Output is correct
25 Correct 6 ms 10196 KB Output is correct
26 Correct 10 ms 10076 KB Output is correct
27 Correct 6 ms 9812 KB Output is correct
28 Correct 6 ms 10068 KB Output is correct
29 Correct 8 ms 10256 KB Output is correct
30 Correct 7 ms 10196 KB Output is correct
31 Correct 7 ms 10196 KB Output is correct
32 Correct 6 ms 10196 KB Output is correct
33 Correct 7 ms 10204 KB Output is correct
34 Correct 19 ms 13972 KB Output is correct
35 Correct 399 ms 57116 KB Output is correct
36 Correct 376 ms 54932 KB Output is correct
37 Correct 363 ms 52524 KB Output is correct
38 Correct 361 ms 51232 KB Output is correct
39 Correct 317 ms 50828 KB Output is correct
40 Correct 281 ms 48360 KB Output is correct
41 Correct 413 ms 55976 KB Output is correct
42 Correct 398 ms 57056 KB Output is correct
43 Correct 348 ms 53460 KB Output is correct
44 Correct 370 ms 52456 KB Output is correct
45 Correct 287 ms 44512 KB Output is correct
46 Correct 384 ms 54032 KB Output is correct
47 Correct 352 ms 51332 KB Output is correct
48 Correct 388 ms 50596 KB Output is correct
49 Correct 77 ms 16556 KB Output is correct
50 Correct 69 ms 15848 KB Output is correct
51 Correct 291 ms 38252 KB Output is correct
52 Correct 428 ms 55576 KB Output is correct
53 Correct 444 ms 54568 KB Output is correct
54 Correct 490 ms 58308 KB Output is correct
55 Correct 362 ms 54648 KB Output is correct
56 Correct 452 ms 53716 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9652 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 7 ms 9964 KB Output is correct
5 Correct 7 ms 10196 KB Output is correct
6 Correct 10 ms 10128 KB Output is correct
7 Correct 6 ms 10196 KB Output is correct
8 Correct 8 ms 10196 KB Output is correct
9 Correct 237 ms 41644 KB Output is correct
10 Correct 363 ms 56316 KB Output is correct
11 Correct 386 ms 55132 KB Output is correct
12 Correct 393 ms 58116 KB Output is correct
13 Correct 269 ms 55228 KB Output is correct
14 Execution timed out 2086 ms 194852 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9652 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 7 ms 9964 KB Output is correct
6 Correct 7 ms 10196 KB Output is correct
7 Correct 10 ms 10128 KB Output is correct
8 Correct 6 ms 10196 KB Output is correct
9 Correct 8 ms 10196 KB Output is correct
10 Correct 237 ms 41644 KB Output is correct
11 Correct 363 ms 56316 KB Output is correct
12 Correct 386 ms 55132 KB Output is correct
13 Correct 393 ms 58116 KB Output is correct
14 Correct 269 ms 55228 KB Output is correct
15 Execution timed out 2086 ms 194852 KB Time limit exceeded
16 Halted 0 ms 0 KB -