oj.uz

Submission #1059967

# Submission time Handle Problem Language Result Execution time Memory
1059967 2024-08-15T09:43:52 Z mispertion Swapping Cities (APIO20_swap) C++17
30 / 100
 871 ms 524288 KB 
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>

#pragma gcc optimize("unroll-loops")
#pragma gcc optimize("o3")
#pragma gcc optimize("Ofast")

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];
    vector<int> st[N];

    dsu(int n){
        for(int i = 1; i <= n; i++){
            st[i] = {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 pos = (--upper_bound(p[v].begin(), p[v].end(),mp(t, infi))) - p[v].begin();
        return p[v][pos].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 = getp(a, t);
        b = getp(b, t);
        if(a == b){
            upd(a, n1, t);
            upd(a, n2, t);
            return;
        }
        if(sz[a] > sz[b])
            swap(a, b);
        sz[b].pb({t, sz[b].back().S + sz[a].back().S});
        for(auto e : st[a]){
            st[b].pb(e);
            p[e].pb({t, b});
        }
        st[a].clear();
        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;
}

Compilation message

swap.cpp:5: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    5 | #pragma gcc optimize("unroll-loops")
      | 
swap.cpp:6: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    6 | #pragma gcc optimize("o3")
      | 
swap.cpp:7: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    7 | #pragma gcc optimize("Ofast")
      |

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24668 KB Output is correct
2 Correct 11 ms 24568 KB Output is correct
3 Correct 13 ms 24512 KB Output is correct
4 Correct 11 ms 24668 KB Output is correct
5 Correct 12 ms 24924 KB Output is correct
6 Correct 11 ms 24936 KB Output is correct
7 Correct 11 ms 24936 KB Output is correct
8 Correct 12 ms 24924 KB Output is correct
9 Correct 117 ms 57120 KB Output is correct
10 Correct 155 ms 63816 KB Output is correct
11 Correct 151 ms 63536 KB Output is correct
12 Correct 183 ms 66756 KB Output is correct
13 Correct 107 ms 54468 KB Output is correct
14 Correct 141 ms 57280 KB Output is correct
15 Correct 281 ms 66384 KB Output is correct
16 Correct 266 ms 64632 KB Output is correct
17 Correct 336 ms 67632 KB Output is correct
18 Correct 278 ms 56332 KB Output is correct
19 Correct 119 ms 34064 KB Output is correct
20 Correct 268 ms 67884 KB Output is correct
21 Correct 293 ms 66432 KB Output is correct
22 Correct 319 ms 68908 KB Output is correct
23 Correct 300 ms 55080 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24668 KB Output is correct
2 Correct 11 ms 24568 KB Output is correct
3 Correct 403 ms 49508 KB Output is correct
4 Correct 393 ms 50476 KB Output is correct
5 Correct 441 ms 50012 KB Output is correct
6 Correct 407 ms 50476 KB Output is correct
7 Correct 455 ms 50232 KB Output is correct
8 Correct 405 ms 49356 KB Output is correct
9 Correct 420 ms 49984 KB Output is correct
10 Correct 416 ms 49272 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24668 KB Output is correct
2 Correct 11 ms 24568 KB Output is correct
3 Correct 13 ms 24512 KB Output is correct
4 Correct 11 ms 24668 KB Output is correct
5 Correct 12 ms 24924 KB Output is correct
6 Correct 11 ms 24936 KB Output is correct
7 Correct 11 ms 24936 KB Output is correct
8 Correct 12 ms 24924 KB Output is correct
9 Correct 10 ms 24704 KB Output is correct
10 Correct 11 ms 24924 KB Output is correct
11 Correct 11 ms 24836 KB Output is correct
12 Correct 11 ms 24924 KB Output is correct
13 Correct 11 ms 24924 KB Output is correct
14 Correct 11 ms 24924 KB Output is correct
15 Correct 11 ms 24924 KB Output is correct
16 Correct 11 ms 24924 KB Output is correct
17 Correct 11 ms 24924 KB Output is correct
18 Correct 12 ms 24924 KB Output is correct
19 Correct 11 ms 24988 KB Output is correct
20 Correct 11 ms 24920 KB Output is correct
21 Correct 11 ms 24868 KB Output is correct
22 Correct 11 ms 24804 KB Output is correct
23 Correct 12 ms 24924 KB Output is correct
24 Correct 11 ms 24924 KB Output is correct
25 Correct 12 ms 25016 KB Output is correct
26 Correct 11 ms 25012 KB Output is correct
27 Correct 11 ms 24924 KB Output is correct
28 Correct 11 ms 24924 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24704 KB Output is correct
2 Correct 10 ms 24668 KB Output is correct
3 Correct 11 ms 24568 KB Output is correct
4 Correct 13 ms 24512 KB Output is correct
5 Correct 11 ms 24668 KB Output is correct
6 Correct 12 ms 24924 KB Output is correct
7 Correct 11 ms 24936 KB Output is correct
8 Correct 11 ms 24936 KB Output is correct
9 Correct 12 ms 24924 KB Output is correct
10 Correct 117 ms 57120 KB Output is correct
11 Correct 155 ms 63816 KB Output is correct
12 Correct 151 ms 63536 KB Output is correct
13 Correct 183 ms 66756 KB Output is correct
14 Correct 107 ms 54468 KB Output is correct
15 Correct 11 ms 24924 KB Output is correct
16 Correct 11 ms 24836 KB Output is correct
17 Correct 11 ms 24924 KB Output is correct
18 Correct 11 ms 24924 KB Output is correct
19 Correct 11 ms 24924 KB Output is correct
20 Correct 11 ms 24924 KB Output is correct
21 Correct 11 ms 24924 KB Output is correct
22 Correct 11 ms 24924 KB Output is correct
23 Correct 12 ms 24924 KB Output is correct
24 Correct 11 ms 24988 KB Output is correct
25 Correct 11 ms 24920 KB Output is correct
26 Correct 11 ms 24868 KB Output is correct
27 Correct 11 ms 24804 KB Output is correct
28 Correct 12 ms 24924 KB Output is correct
29 Correct 11 ms 24924 KB Output is correct
30 Correct 12 ms 25016 KB Output is correct
31 Correct 11 ms 25012 KB Output is correct
32 Correct 11 ms 24924 KB Output is correct
33 Correct 11 ms 24924 KB Output is correct
34 Correct 27 ms 29624 KB Output is correct
35 Correct 190 ms 66592 KB Output is correct
36 Correct 179 ms 65476 KB Output is correct
37 Correct 195 ms 65228 KB Output is correct
38 Correct 158 ms 62404 KB Output is correct
39 Correct 160 ms 63428 KB Output is correct
40 Correct 134 ms 62408 KB Output is correct
41 Correct 164 ms 65736 KB Output is correct
42 Correct 174 ms 65728 KB Output is correct
43 Runtime error 871 ms 524288 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24668 KB Output is correct
2 Correct 11 ms 24568 KB Output is correct
3 Correct 13 ms 24512 KB Output is correct
4 Correct 11 ms 24668 KB Output is correct
5 Correct 12 ms 24924 KB Output is correct
6 Correct 11 ms 24936 KB Output is correct
7 Correct 11 ms 24936 KB Output is correct
8 Correct 12 ms 24924 KB Output is correct
9 Correct 117 ms 57120 KB Output is correct
10 Correct 155 ms 63816 KB Output is correct
11 Correct 151 ms 63536 KB Output is correct
12 Correct 183 ms 66756 KB Output is correct
13 Correct 107 ms 54468 KB Output is correct
14 Correct 141 ms 57280 KB Output is correct
15 Correct 281 ms 66384 KB Output is correct
16 Correct 266 ms 64632 KB Output is correct
17 Correct 336 ms 67632 KB Output is correct
18 Correct 278 ms 56332 KB Output is correct
19 Correct 403 ms 49508 KB Output is correct
20 Correct 393 ms 50476 KB Output is correct
21 Correct 441 ms 50012 KB Output is correct
22 Correct 407 ms 50476 KB Output is correct
23 Correct 455 ms 50232 KB Output is correct
24 Correct 405 ms 49356 KB Output is correct
25 Correct 420 ms 49984 KB Output is correct
26 Correct 416 ms 49272 KB Output is correct
27 Correct 11 ms 24924 KB Output is correct
28 Correct 11 ms 24836 KB Output is correct
29 Correct 11 ms 24924 KB Output is correct
30 Correct 11 ms 24924 KB Output is correct
31 Correct 11 ms 24924 KB Output is correct
32 Correct 11 ms 24924 KB Output is correct
33 Correct 11 ms 24924 KB Output is correct
34 Correct 11 ms 24924 KB Output is correct
35 Correct 12 ms 24924 KB Output is correct
36 Correct 27 ms 29624 KB Output is correct
37 Correct 190 ms 66592 KB Output is correct
38 Correct 179 ms 65476 KB Output is correct
39 Correct 195 ms 65228 KB Output is correct
40 Correct 158 ms 62404 KB Output is correct
41 Correct 160 ms 63428 KB Output is correct
42 Correct 134 ms 62408 KB Output is correct
43 Correct 164 ms 65736 KB Output is correct
44 Correct 174 ms 65728 KB Output is correct
45 Runtime error 871 ms 524288 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24704 KB Output is correct
2 Correct 10 ms 24668 KB Output is correct
3 Correct 11 ms 24568 KB Output is correct
4 Correct 13 ms 24512 KB Output is correct
5 Correct 11 ms 24668 KB Output is correct
6 Correct 12 ms 24924 KB Output is correct
7 Correct 11 ms 24936 KB Output is correct
8 Correct 11 ms 24936 KB Output is correct
9 Correct 12 ms 24924 KB Output is correct
10 Correct 117 ms 57120 KB Output is correct
11 Correct 155 ms 63816 KB Output is correct
12 Correct 151 ms 63536 KB Output is correct
13 Correct 183 ms 66756 KB Output is correct
14 Correct 107 ms 54468 KB Output is correct
15 Correct 141 ms 57280 KB Output is correct
16 Correct 281 ms 66384 KB Output is correct
17 Correct 266 ms 64632 KB Output is correct
18 Correct 336 ms 67632 KB Output is correct
19 Correct 278 ms 56332 KB Output is correct
20 Correct 403 ms 49508 KB Output is correct
21 Correct 393 ms 50476 KB Output is correct
22 Correct 441 ms 50012 KB Output is correct
23 Correct 407 ms 50476 KB Output is correct
24 Correct 455 ms 50232 KB Output is correct
25 Correct 405 ms 49356 KB Output is correct
26 Correct 420 ms 49984 KB Output is correct
27 Correct 416 ms 49272 KB Output is correct
28 Correct 11 ms 24924 KB Output is correct
29 Correct 11 ms 24836 KB Output is correct
30 Correct 11 ms 24924 KB Output is correct
31 Correct 11 ms 24924 KB Output is correct
32 Correct 11 ms 24924 KB Output is correct
33 Correct 11 ms 24924 KB Output is correct
34 Correct 11 ms 24924 KB Output is correct
35 Correct 11 ms 24924 KB Output is correct
36 Correct 12 ms 24924 KB Output is correct
37 Correct 27 ms 29624 KB Output is correct
38 Correct 190 ms 66592 KB Output is correct
39 Correct 179 ms 65476 KB Output is correct
40 Correct 195 ms 65228 KB Output is correct
41 Correct 158 ms 62404 KB Output is correct
42 Correct 160 ms 63428 KB Output is correct
43 Correct 134 ms 62408 KB Output is correct
44 Correct 164 ms 65736 KB Output is correct
45 Correct 174 ms 65728 KB Output is correct
46 Runtime error 871 ms 524288 KB Execution killed with signal 9
47 Halted 0 ms 0 KB -