oj.uz

Submission #1059801

# Submission time Handle Problem Language Result Execution time Memory
1059801 2024-08-15T08:18:31 Z mispertion Swapping Cities (APIO20_swap) C++17
50 / 100
 2000 ms 54468 KB 
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

const int N = 1e5 + 5;
const int infi = INT_MAX;

typedef pair<int, int> pii;

#define mp make_pair
#define pb push_back
#define F first
#define S second

struct dsu{
    int pw[N];
    vector<pii> p[N], cnt1[N], cnt2[N], sz[N];

    dsu(int n){
        for(int i = 1; i <= n; i++){
            p[i] = {{-1, i}};
            sz[i] = {{-1, 1}};
            cnt1[i] = {{-1, 0}};
            cnt2[i] = {{-1, 0}};
            pw[i] = 0;
        }
    }
    dsu(){

    }

    int getp(int v, int t){
        int pr = (--upper_bound(p[v].begin(), p[v].end(),mp(t, infi)))->S;
        if(pr == v)
            return v;
        return getp(pr, t);
    }

    int getpch(int v, int t){
        int pr = p[v].back().S;
        if(pr == v)
            return v;
        p[v].pb({t, getpch(pr, t)});
        return p[v].back().S;
    }

    void upd(int v, int nw, int t){
        if(nw == 1)
            cnt1[v].pb({t, cnt1[v].back().S - 1});
        if(nw == 2)
            cnt2[v].pb({t, cnt2[v].back().S - 1});
        if(nw == 0)
            cnt1[v].pb({t, cnt1[v].back().S + 1});
        if(nw == 1)
            cnt2[v].pb({t, cnt2[v].back().S + 1});
    }

    void uni(int a, int b, int t){
        int n1 = pw[a];
        int n2 = pw[b];
        //cout << n1 << ' ' << n2 << '\n';
        pw[a]++;
        pw[b]++;
        a = getpch(a, t);
        b = getpch(b, t);
        if(a == b){
            upd(a, n1, t);
            upd(a, n2, t);
            return;
        }
        if(sz[a] > sz[b])
            swap(a, b);
        p[a].pb({t, b});
        sz[b].pb({t, sz[a].back().S + sz[b].back().S});
        cnt1[b].pb({t, cnt1[a].back().S + cnt1[b].back().S});
        cnt2[b].pb({t, cnt2[a].back().S + cnt2[b].back().S});
        upd(b, n1, t);
        upd(b, n2, t);
    }
};

int n, m;
vector<pair<int, pair<int, int>>> edges;
dsu ds;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    n = N;
    m = M;
    for(int i = 0; i < m; i++){
        U[i]++;
        V[i]++;
        edges.pb({W[i], {V[i], U[i]}});
    }
    sort(edges.begin(), edges.end());
    ds = dsu(n);
    for(int i = 0; i < m; i++){
        ds.uni(edges[i].S.F, edges[i].S.S, i);
        /*cout << "comp: ";
        for(int j = 1; j <= n; j++){
            cout << ds.getp(j, infi) << ' ';
        }
        cout << '\n';
        cout << "cnt1: ";
        for(int i = 1; i <= n; i++){
            cout << ds.cnt1[ds.getp(i, infi)].back().S << ' ';
        }
        cout << '\n';
        cout << "cnt2: ";
        for(int i = 1; i <= n; i++){
            cout << ds.cnt2[ds.getp(i, infi)].back().S << ' ';
        }
        cout << '\n';*/
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    X++;
    Y++;
    int lo = -1, hi = m;
    while(lo + 1 < hi){
        int m = (lo + hi) / 2;
        int x = ds.getp(X, m), y = ds.getp(Y, m);
        if(x != y){
            lo = m;
            continue;
        }
        int c1 = (--upper_bound(ds.cnt1[x].begin(), ds.cnt1[x].end(),mp(m, infi)))->S;
        int c2 = (--upper_bound(ds.cnt2[x].begin(), ds.cnt2[x].end(),mp(m, infi)))->S;
        int sz = (--upper_bound(ds.sz[x].begin(), ds.sz[x].end(),mp(m, infi)))->S;
        if(c1 == 2 && c2 == sz - 2){
            lo = m;
            continue;
        }
        hi = m;
    }
    if(hi == m)
        return -1;
    return edges[hi].F;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19800 KB Output is correct
2 Correct 10 ms 19804 KB Output is correct
3 Correct 10 ms 19988 KB Output is correct
4 Correct 10 ms 20060 KB Output is correct
5 Correct 11 ms 20136 KB Output is correct
6 Correct 11 ms 20060 KB Output is correct
7 Correct 10 ms 20292 KB Output is correct
8 Correct 10 ms 20232 KB Output is correct
9 Correct 86 ms 40160 KB Output is correct
10 Correct 113 ms 44956 KB Output is correct
11 Correct 116 ms 44484 KB Output is correct
12 Correct 132 ms 45980 KB Output is correct
13 Correct 92 ms 45692 KB Output is correct
14 Correct 131 ms 40404 KB Output is correct
15 Correct 458 ms 46924 KB Output is correct
16 Correct 450 ms 46172 KB Output is correct
17 Correct 467 ms 47664 KB Output is correct
18 Correct 304 ms 47348 KB Output is correct
19 Correct 229 ms 27552 KB Output is correct
20 Correct 442 ms 48148 KB Output is correct
21 Correct 470 ms 47352 KB Output is correct
22 Correct 469 ms 49200 KB Output is correct
23 Correct 301 ms 48676 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19800 KB Output is correct
2 Correct 10 ms 19804 KB Output is correct
3 Correct 423 ms 41576 KB Output is correct
4 Correct 433 ms 42508 KB Output is correct
5 Correct 448 ms 42072 KB Output is correct
6 Correct 424 ms 42276 KB Output is correct
7 Correct 501 ms 42308 KB Output is correct
8 Correct 420 ms 41588 KB Output is correct
9 Correct 418 ms 42048 KB Output is correct
10 Correct 426 ms 41420 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19800 KB Output is correct
2 Correct 10 ms 19804 KB Output is correct
3 Correct 10 ms 19988 KB Output is correct
4 Correct 10 ms 20060 KB Output is correct
5 Correct 11 ms 20136 KB Output is correct
6 Correct 11 ms 20060 KB Output is correct
7 Correct 10 ms 20292 KB Output is correct
8 Correct 10 ms 20232 KB Output is correct
9 Correct 11 ms 19800 KB Output is correct
10 Correct 10 ms 20160 KB Output is correct
11 Correct 10 ms 20208 KB Output is correct
12 Correct 11 ms 20060 KB Output is correct
13 Correct 10 ms 20060 KB Output is correct
14 Correct 12 ms 20060 KB Output is correct
15 Correct 12 ms 20172 KB Output is correct
16 Correct 11 ms 20056 KB Output is correct
17 Correct 11 ms 20056 KB Output is correct
18 Correct 11 ms 20056 KB Output is correct
19 Correct 11 ms 20092 KB Output is correct
20 Correct 10 ms 20056 KB Output is correct
21 Correct 11 ms 20060 KB Output is correct
22 Correct 13 ms 20096 KB Output is correct
23 Correct 11 ms 20056 KB Output is correct
24 Correct 11 ms 20312 KB Output is correct
25 Correct 11 ms 20316 KB Output is correct
26 Correct 11 ms 20188 KB Output is correct
27 Correct 11 ms 20160 KB Output is correct
28 Correct 11 ms 20316 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19800 KB Output is correct
2 Correct 13 ms 19800 KB Output is correct
3 Correct 10 ms 19804 KB Output is correct
4 Correct 10 ms 19988 KB Output is correct
5 Correct 10 ms 20060 KB Output is correct
6 Correct 11 ms 20136 KB Output is correct
7 Correct 11 ms 20060 KB Output is correct
8 Correct 10 ms 20292 KB Output is correct
9 Correct 10 ms 20232 KB Output is correct
10 Correct 86 ms 40160 KB Output is correct
11 Correct 113 ms 44956 KB Output is correct
12 Correct 116 ms 44484 KB Output is correct
13 Correct 132 ms 45980 KB Output is correct
14 Correct 92 ms 45692 KB Output is correct
15 Correct 10 ms 20160 KB Output is correct
16 Correct 10 ms 20208 KB Output is correct
17 Correct 11 ms 20060 KB Output is correct
18 Correct 10 ms 20060 KB Output is correct
19 Correct 12 ms 20060 KB Output is correct
20 Correct 12 ms 20172 KB Output is correct
21 Correct 11 ms 20056 KB Output is correct
22 Correct 11 ms 20056 KB Output is correct
23 Correct 11 ms 20056 KB Output is correct
24 Correct 11 ms 20092 KB Output is correct
25 Correct 10 ms 20056 KB Output is correct
26 Correct 11 ms 20060 KB Output is correct
27 Correct 13 ms 20096 KB Output is correct
28 Correct 11 ms 20056 KB Output is correct
29 Correct 11 ms 20312 KB Output is correct
30 Correct 11 ms 20316 KB Output is correct
31 Correct 11 ms 20188 KB Output is correct
32 Correct 11 ms 20160 KB Output is correct
33 Correct 11 ms 20316 KB Output is correct
34 Correct 20 ms 23324 KB Output is correct
35 Correct 116 ms 45768 KB Output is correct
36 Correct 115 ms 45784 KB Output is correct
37 Correct 128 ms 45764 KB Output is correct
38 Correct 121 ms 45556 KB Output is correct
39 Correct 111 ms 45080 KB Output is correct
40 Correct 97 ms 42696 KB Output is correct
41 Correct 119 ms 45768 KB Output is correct
42 Correct 112 ms 45764 KB Output is correct
43 Correct 84 ms 47160 KB Output is correct
44 Correct 111 ms 45000 KB Output is correct
45 Correct 120 ms 46780 KB Output is correct
46 Correct 121 ms 45948 KB Output is correct
47 Correct 123 ms 45872 KB Output is correct
48 Correct 114 ms 46536 KB Output is correct
49 Correct 55 ms 30660 KB Output is correct
50 Correct 49 ms 29648 KB Output is correct
51 Correct 102 ms 42440 KB Output is correct
52 Correct 152 ms 52044 KB Output is correct
53 Correct 166 ms 53180 KB Output is correct
54 Correct 190 ms 54468 KB Output is correct
55 Correct 81 ms 47300 KB Output is correct
56 Correct 152 ms 52676 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19800 KB Output is correct
2 Correct 10 ms 19804 KB Output is correct
3 Correct 10 ms 19988 KB Output is correct
4 Correct 10 ms 20060 KB Output is correct
5 Correct 11 ms 20136 KB Output is correct
6 Correct 11 ms 20060 KB Output is correct
7 Correct 10 ms 20292 KB Output is correct
8 Correct 10 ms 20232 KB Output is correct
9 Correct 86 ms 40160 KB Output is correct
10 Correct 113 ms 44956 KB Output is correct
11 Correct 116 ms 44484 KB Output is correct
12 Correct 132 ms 45980 KB Output is correct
13 Correct 92 ms 45692 KB Output is correct
14 Correct 131 ms 40404 KB Output is correct
15 Correct 458 ms 46924 KB Output is correct
16 Correct 450 ms 46172 KB Output is correct
17 Correct 467 ms 47664 KB Output is correct
18 Correct 304 ms 47348 KB Output is correct
19 Correct 423 ms 41576 KB Output is correct
20 Correct 433 ms 42508 KB Output is correct
21 Correct 448 ms 42072 KB Output is correct
22 Correct 424 ms 42276 KB Output is correct
23 Correct 501 ms 42308 KB Output is correct
24 Correct 420 ms 41588 KB Output is correct
25 Correct 418 ms 42048 KB Output is correct
26 Correct 426 ms 41420 KB Output is correct
27 Correct 10 ms 20160 KB Output is correct
28 Correct 10 ms 20208 KB Output is correct
29 Correct 11 ms 20060 KB Output is correct
30 Correct 10 ms 20060 KB Output is correct
31 Correct 12 ms 20060 KB Output is correct
32 Correct 12 ms 20172 KB Output is correct
33 Correct 11 ms 20056 KB Output is correct
34 Correct 11 ms 20056 KB Output is correct
35 Correct 11 ms 20056 KB Output is correct
36 Correct 20 ms 23324 KB Output is correct
37 Correct 116 ms 45768 KB Output is correct
38 Correct 115 ms 45784 KB Output is correct
39 Correct 128 ms 45764 KB Output is correct
40 Correct 121 ms 45556 KB Output is correct
41 Correct 111 ms 45080 KB Output is correct
42 Correct 97 ms 42696 KB Output is correct
43 Correct 119 ms 45768 KB Output is correct
44 Correct 112 ms 45764 KB Output is correct
45 Correct 84 ms 47160 KB Output is correct
46 Correct 111 ms 45000 KB Output is correct
47 Correct 53 ms 23352 KB Output is correct
48 Correct 480 ms 48436 KB Output is correct
49 Correct 467 ms 48424 KB Output is correct
50 Correct 498 ms 48240 KB Output is correct
51 Correct 510 ms 48184 KB Output is correct
52 Correct 529 ms 46600 KB Output is correct
53 Correct 547 ms 39948 KB Output is correct
54 Correct 473 ms 49192 KB Output is correct
55 Correct 478 ms 48392 KB Output is correct
56 Execution timed out 2063 ms 48844 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19800 KB Output is correct
2 Correct 13 ms 19800 KB Output is correct
3 Correct 10 ms 19804 KB Output is correct
4 Correct 10 ms 19988 KB Output is correct
5 Correct 10 ms 20060 KB Output is correct
6 Correct 11 ms 20136 KB Output is correct
7 Correct 11 ms 20060 KB Output is correct
8 Correct 10 ms 20292 KB Output is correct
9 Correct 10 ms 20232 KB Output is correct
10 Correct 86 ms 40160 KB Output is correct
11 Correct 113 ms 44956 KB Output is correct
12 Correct 116 ms 44484 KB Output is correct
13 Correct 132 ms 45980 KB Output is correct
14 Correct 92 ms 45692 KB Output is correct
15 Correct 131 ms 40404 KB Output is correct
16 Correct 458 ms 46924 KB Output is correct
17 Correct 450 ms 46172 KB Output is correct
18 Correct 467 ms 47664 KB Output is correct
19 Correct 304 ms 47348 KB Output is correct
20 Correct 423 ms 41576 KB Output is correct
21 Correct 433 ms 42508 KB Output is correct
22 Correct 448 ms 42072 KB Output is correct
23 Correct 424 ms 42276 KB Output is correct
24 Correct 501 ms 42308 KB Output is correct
25 Correct 420 ms 41588 KB Output is correct
26 Correct 418 ms 42048 KB Output is correct
27 Correct 426 ms 41420 KB Output is correct
28 Correct 10 ms 20160 KB Output is correct
29 Correct 10 ms 20208 KB Output is correct
30 Correct 11 ms 20060 KB Output is correct
31 Correct 10 ms 20060 KB Output is correct
32 Correct 12 ms 20060 KB Output is correct
33 Correct 12 ms 20172 KB Output is correct
34 Correct 11 ms 20056 KB Output is correct
35 Correct 11 ms 20056 KB Output is correct
36 Correct 11 ms 20056 KB Output is correct
37 Correct 20 ms 23324 KB Output is correct
38 Correct 116 ms 45768 KB Output is correct
39 Correct 115 ms 45784 KB Output is correct
40 Correct 128 ms 45764 KB Output is correct
41 Correct 121 ms 45556 KB Output is correct
42 Correct 111 ms 45080 KB Output is correct
43 Correct 97 ms 42696 KB Output is correct
44 Correct 119 ms 45768 KB Output is correct
45 Correct 112 ms 45764 KB Output is correct
46 Correct 84 ms 47160 KB Output is correct
47 Correct 111 ms 45000 KB Output is correct
48 Correct 53 ms 23352 KB Output is correct
49 Correct 480 ms 48436 KB Output is correct
50 Correct 467 ms 48424 KB Output is correct
51 Correct 498 ms 48240 KB Output is correct
52 Correct 510 ms 48184 KB Output is correct
53 Correct 529 ms 46600 KB Output is correct
54 Correct 547 ms 39948 KB Output is correct
55 Correct 473 ms 49192 KB Output is correct
56 Correct 478 ms 48392 KB Output is correct
57 Execution timed out 2063 ms 48844 KB Time limit exceeded
58 Halted 0 ms 0 KB -