oj.uz

Submission #745341

# Submission time Handle Problem Language Result Execution time Memory
745341 2023-05-19T21:48:21 Z Lobo Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 17792 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);
    }
 
    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) && mn[x] != -1 && mn[y] != -1) return edgs[i].fr;
    }
    return -1;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 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 61 ms 14100 KB Output is correct
10 Correct 95 ms 15292 KB Output is correct
11 Correct 101 ms 15240 KB Output is correct
12 Correct 108 ms 15956 KB Output is correct
13 Correct 83 ms 13224 KB Output is correct
14 Execution timed out 2064 ms 13972 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 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Execution timed out 2067 ms 13796 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 4948 KB Output is correct
2 Correct 3 ms 4948 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 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 5076 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 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 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 4 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 5012 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 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 61 ms 14100 KB Output is correct
11 Correct 95 ms 15292 KB Output is correct
12 Correct 101 ms 15240 KB Output is correct
13 Correct 108 ms 15956 KB Output is correct
14 Correct 83 ms 13224 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 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 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 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 4 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 5012 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 9 ms 5908 KB Output is correct
35 Correct 106 ms 14972 KB Output is correct
36 Correct 109 ms 14500 KB Output is correct
37 Correct 115 ms 13860 KB Output is correct
38 Correct 104 ms 13064 KB Output is correct
39 Correct 93 ms 12416 KB Output is correct
40 Correct 82 ms 11612 KB Output is correct
41 Correct 110 ms 15540 KB Output is correct
42 Correct 112 ms 15608 KB Output is correct
43 Correct 79 ms 12072 KB Output is correct
44 Correct 100 ms 12168 KB Output is correct
45 Correct 92 ms 12260 KB Output is correct
46 Correct 100 ms 14536 KB Output is correct
47 Correct 100 ms 12988 KB Output is correct
48 Correct 89 ms 12260 KB Output is correct
49 Correct 58 ms 11840 KB Output is correct
50 Correct 50 ms 9412 KB Output is correct
51 Correct 72 ms 11096 KB Output is correct
52 Correct 133 ms 16240 KB Output is correct
53 Correct 109 ms 13832 KB Output is correct
54 Correct 142 ms 17792 KB Output is correct
55 Correct 89 ms 12072 KB Output is correct
56 Correct 131 ms 13832 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 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 61 ms 14100 KB Output is correct
10 Correct 95 ms 15292 KB Output is correct
11 Correct 101 ms 15240 KB Output is correct
12 Correct 108 ms 15956 KB Output is correct
13 Correct 83 ms 13224 KB Output is correct
14 Execution timed out 2064 ms 13972 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 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 61 ms 14100 KB Output is correct
11 Correct 95 ms 15292 KB Output is correct
12 Correct 101 ms 15240 KB Output is correct
13 Correct 108 ms 15956 KB Output is correct
14 Correct 83 ms 13224 KB Output is correct
15 Execution timed out 2064 ms 13972 KB Time limit exceeded
16 Halted 0 ms 0 KB -