BLINNET.cpp

/*My First Template :D*/
#include <bits/stdc++.h>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
 
#define MOD (ll)1000000007
#define pb   push_back
#define EPS 1e-9
#define FOR(i,n)  for(int i = 0;i < n; i++)
#define FORE(i,a,b) for(int i = a;i <= b; i++)
#define pi(a)   printf("%d\n", a)
#define all(c)  c.begin(), c.end()
#define tr(container, it)   for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define gc getchar_unlocked
#define sdi(a, b)   si(a);si(b)
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl '\n'

template <typename T> T gcd(T a, T b){return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template <typename T> T mod_exp(T b, T p, T m){T x = 1;while(p){if(p&1)x=(x*b)%m;b=(b*b)%m;p=p>>1;}return x;}
template <typename T> T invFermat(T a, T p){return mod_exp(a, p-2, p);}
template <typename T> T exp(T b, T p){T x = 1;while(p){if(p&1)x=(x*b);b=(b*b);p=p>>1;}return x;}

void si(int &x){
    register int c = gc();
    x = 0;
    int neg = 0;
    for(;((c<48 || c>57) && c != '-');c = gc());
    if(c=='-') {neg=1;c=gc();}
    for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
    if(neg) x=-x;
}

const int MAXN = 1e5+5;
typedef pair<long long, int> PII;
bool marked[MAXN];
vector<PII> adj[MAXN];

long long prim(int x){
	priority_queue<PII, vector<PII>, greater<PII> > Q;	//minimum priority queue
	long long minimumCost = 0;
	PII p;
	Q.push(make_pair(0, x));
	while(!Q.empty()){
		p = Q.top();
		Q.pop();
		x = p.second;
		if(marked[x] == true)
			continue;
		minimumCost += p.first;
		marked[x] = true;
		for(int i = 0;i < adj[x].size(); i++){
			int y = adj[x][i].second;
			if(!marked[y])
				Q.push(adj[x][i]);
		}
	}
	return minimumCost;
}

int main()
{	
	io;
	int t;
	cin>>t;
	while(t--){
	    int nodes, x, y;
	    memset(adj,0, sizeof(adj));
	    memset(marked, 0, sizeof(marked));
	    long long weight, minimumCost;
	    cin >> nodes;
	    for(int i = 1;i <= nodes; i++){
	    	string input;
	    	cin>>input;
	    	int edges;
	    	cin>>edges;
	    	for(int j = 1;j <= edges; j++){
	    		cin>>y>>weight;
	    		adj[i].pb(make_pair(weight,y));
	    	}
	    }
	    minimumCost = prim(1);
	    cout << minimumCost << endl;
	}
    return 0;
}