Competitive-Programming-Solutions/ccc10s4.cpp at main · Rosnaky/Competitive-Programming-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include <vector>
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>

using namespace std;

struct Edge
{
    int u, v, w;
    Edge(int u, int v, int w) : u(u), v(v), w(w) {}
};

struct EdgeComparator {
    bool operator()(const Edge& edge1, const Edge& edge2) const {
        return edge1.w < edge2.w;
    }
};


vector<int> par, rnk;
vector<vector<vector<pair<int, int>>>> dual;
vector<Edge> edges1, edges2;

void makeSet(int n) {
    par[n] = n;
    rnk[n] = 1;
}

int Find(int n) {
    if (par[n] == n) {
        return n;
    }

    return par[n] = Find(par[n]);
}

bool Union(int a, int b) {
    a = Find(a);
    b = Find(b);

    if (a != b) {
        if (rnk[a] > rnk[b]) {
            par[b] = a;
        }
        else {
            if (rnk[a] == rnk[b]) {
                rnk[b]++;
            }
            par[a] = b;
        }

        return true;
    }

    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int pens;
    cin >> pens;

    par = vector<int>(1005);
    rnk = vector<int>(1005);
    dual = vector<vector<vector<pair<int, int>>>>(1005, vector<vector<pair<int, int>>>(1005));
    edges1 = vector<Edge>();
    edges2 = vector<Edge>();

    // for (int i = 0; i < 1005; i++) {
    //     for (int j = 0; j < 1005; j++) {
    //         dual[i][j] = make_pair(-1, -1);
    //     }
    // }

    for (int i = 1; i <= pens; i++) {
        makeSet(i);
    }

    for (int i = 1; i <= pens; i++) {
        int e;
        cin >> e;

        vector<int> corners(e);
        vector<int> costs(e);

        for (int j = 0; j < e; j++) {
            cin >> corners[j];
        }
        for (int j = 0; j < e; j++) {
            cin >> costs[j];
        }

        for (int j = 0; j < e-1; j++) {
            int corner1 = corners[j];
            int corner2 = corners[j+1];
            int cost = costs[j];

            dual[corner1][corner2].push_back(pair(i, cost));
            dual[corner2][corner1].push_back(pair(i, cost));

            if (dual[corner1][corner2].size() == 2) {
                pair<int, int> pen1 = dual[corner1][corner2][0];
                pair<int, int> pen2 = dual[corner1][corner2][1];

                edges1.push_back(Edge(pen1.first, pen2.first, cost));
                edges2.push_back(Edge(pen1.first, pen2.first, cost));
            }
        }

        int corner1 = corners[e-1];
        int corner2 = corners[0];
        int cost = costs[e-1];
        dual[corner1][corner2].push_back(pair(i, cost));
        dual[corner2][corner1].push_back(pair(i, cost));
        if (dual[corner1][corner2].size() == 2) {
            pair<int, int> pen1 = dual[corner1][corner2][0];
            pair<int, int> pen2 = dual[corner1][corner2][1];

            edges1.push_back(Edge(pen1.first, pen2.first, cost));
            edges2.push_back(Edge(pen1.first, pen2.first, cost));
        }
    }
    sort(edges1.begin(), edges1.end(), EdgeComparator());
    int ansNotOutside = 0;
    int isOutside = 0;

    for (Edge e : edges1) {
        int u = e.u, v = e.v, w = e.w;
        if (Union(u, v)) {
            ansNotOutside += w;
        }
    }

    for (int i = 0; i < 1005; i++) {
        for (int j = 0; j < 1005; j++) {
            if (dual[i][j].size() == 1) {
                pair<int, int> pen = dual[i][j][0];
                edges2.push_back(Edge(pen.first, 0, pen.second));
            }
        }
    }
    for (int i = 1; i <= pens; i++) {
        makeSet(i);
    }
    sort(edges2.begin(), edges2.end(), EdgeComparator());
    for (Edge e : edges2) {
        int u = e.u, v = e.v, w = e.w;
        if (Union(u, v)) {
            isOutside += w;
        }
    }

    cout << min(ansNotOutside, isOutside) << endl;
}