UvaSolution/uva908_Re-connecting Computer Sites.cpp at master · Masum95/UvaSolution · 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
#include<bits/stdc++.h>
#define pb(n) push_back(n)
#define bug cout<<"bug";
#define all(c) c.begin(),c.end()
#define fr(i,n) for(i=0;i<n;i++)
#define sf(n) scanf("%d",&n)
#define mst(n) memset(n,0,sizeof(n))
#define nl printf("\n")
#define lli long long int
#define tr(container,it) \
    for (auto it = container.begin(); it != container.end() ; ++it)

#define INF INT_MAX
#define MOD 1000000007
#define mp(i,j) make_pair(i,j)
#define mstn(n) memset(n,-1,sizeof(n))
#define infile freopen("in.txt","r",stdin)
#define outfile freopen("out.txt","w",stdout)

#define V 5
using namespace std;
typedef pair<int,int> pi;
int parent[1000000+1];
class edge
{

public:
    int u,v,cost;

    friend istream &operator>>(istream& stream,edge &a);
    bool operator<(const edge &b)
    {
        return cost<b.cost;
    }

};
istream &operator>>(istream& stream,edge &a)
{
    stream>>a.u>>a.v>>a.cost;
}

int findParent(int a)
{
    return (parent[a]==a?a:parent[a]=findParent(parent[a]));
}

int kruskalMst(vector<edge> &e)
{
    sort(all(e));
    int cost=0;

    for(int i=0; i<e.size(); i++)
    {
        int u=findParent(e[i].u);
        int v=findParent(e[i].v);
        if(u!=v)
        {
            cost+=e[i].cost;
            parent[u]=v;
        }
    }
    return cost;

}
int main()
{

    int num;
    bool nel=0;
    while(scanf("%d",&num)!=EOF)
    {
        if(nel) nl;
        nel=1;
        int originalCost=0, curCost=0;
        vector<edge> store;
        mst(parent);
        for(int i=0; i<num; i++)
            parent[i]=i;

        edge tmp;
        for(int i=0; i<num-1; i++)
        {
            cin>>tmp;
            store.push_back(tmp);
            originalCost+=tmp.cost;
        }

        int newEdge;
        sf(newEdge);
        for(int i=0; i<newEdge; i++)
        {
            cin>>tmp;
            store.push_back(tmp);

        }
        //unnecessary part
        int how;
        sf(how);
        for(int i=0; i<how; i++)
        {
            edge tmp;
            cin>>tmp;
        }

        curCost=kruskalMst(store);
        printf("%d\n%d\n",originalCost,curCost);
    }


}