oj.uz

Submission #745326

# Submission time Handle Problem Language Result Execution time Memory
745326 2023-05-19T21:14:01 Z Lobo Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 17860 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 B = 500;

int n, m, gr[maxn], ds[maxn], dsz[maxn], mn[maxn];
vector<int> mn0[maxn];
vector<pair<int,pair<int,int>>> edgs;

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;
}

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));

    

}

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);
    }

    int ans = -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) && ans == -1) ans = i;
    }

    if(ans == -1 || mn[x] == -1 || mn[y] == -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 2 ms 4960 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 57 ms 13844 KB Output is correct
10 Correct 98 ms 15352 KB Output is correct
11 Correct 106 ms 15280 KB Output is correct
12 Correct 108 ms 15980 KB Output is correct
13 Correct 81 ms 13344 KB Output is correct
14 Execution timed out 2056 ms 13988 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4960 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Execution timed out 2016 ms 13900 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4960 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 4 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5052 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5080 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 4 ms 5076 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 4 ms 5076 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4960 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 57 ms 13844 KB Output is correct
11 Correct 98 ms 15352 KB Output is correct
12 Correct 106 ms 15280 KB Output is correct
13 Correct 108 ms 15980 KB Output is correct
14 Correct 81 ms 13344 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5080 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5052 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5080 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 4 ms 5076 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 4 ms 5076 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 9 ms 5908 KB Output is correct
35 Correct 122 ms 14860 KB Output is correct
36 Correct 113 ms 14656 KB Output is correct
37 Correct 102 ms 13636 KB Output is correct
38 Correct 95 ms 13108 KB Output is correct
39 Correct 106 ms 12428 KB Output is correct
40 Correct 85 ms 11608 KB Output is correct
41 Correct 109 ms 15756 KB Output is correct
42 Correct 113 ms 15612 KB Output is correct
43 Correct 123 ms 12140 KB Output is correct
44 Correct 107 ms 12200 KB Output is correct
45 Correct 114 ms 12176 KB Output is correct
46 Correct 116 ms 14500 KB Output is correct
47 Correct 117 ms 13112 KB Output is correct
48 Correct 102 ms 12284 KB Output is correct
49 Correct 69 ms 11844 KB Output is correct
50 Correct 69 ms 9412 KB Output is correct
51 Correct 117 ms 11104 KB Output is correct
52 Correct 168 ms 16080 KB Output is correct
53 Correct 172 ms 13908 KB Output is correct
54 Correct 196 ms 17860 KB Output is correct
55 Correct 109 ms 12084 KB Output is correct
56 Correct 176 ms 13876 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4960 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 57 ms 13844 KB Output is correct
10 Correct 98 ms 15352 KB Output is correct
11 Correct 106 ms 15280 KB Output is correct
12 Correct 108 ms 15980 KB Output is correct
13 Correct 81 ms 13344 KB Output is correct
14 Execution timed out 2056 ms 13988 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4960 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 57 ms 13844 KB Output is correct
11 Correct 98 ms 15352 KB Output is correct
12 Correct 106 ms 15280 KB Output is correct
13 Correct 108 ms 15980 KB Output is correct
14 Correct 81 ms 13344 KB Output is correct
15 Execution timed out 2056 ms 13988 KB Time limit exceeded
16 Halted 0 ms 0 KB -