Pagini recente » Cod sursa (job #1760725) | Cod sursa (job #976676) | Cod sursa (job #1582275) | Cod sursa (job #2013881) | Cod sursa (job #1650348)
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
vector<pair<int, int> > L[200005];
int n, m, i, x, y, z, h[200005], p[200005], D[200005], nod, nodd, p1, s, vecin, cost, apm, nrh, nrsol;
pair<int, int> soll[200005];
void prim()
{
while(nrh!=0)
{
nodd=nod;
nod=h[1];
soll[nrsol].first=nodd;
soll[nrsol].second=nod;
nrsol++;
apm+=D[nod];
h[1]=h[nrh];
nrh--;
p1=1;
s=2;
while(s<=nrh)
{
if(s+1<=nrh && D[h[s+1]]<D[h[s]])
s++;
if(D[h[s]]<D[h[p1]])
{
swap(h[s], h[p1]);
p[h[s]]=s;
p[h[p1]]=p1;
p1=s;
s*=2;
}else
{
break;
}
}
for(i=0; i<L[nod].size(); i++)
{
vecin=L[nod][i].first;
cost=L[nod][i].second;
if(D[vecin]>cost)
{
D[vecin]=cost;
if(p[vecin]!=0)
{
s=p[vecin];
p1=s/2;
}else
{
h[++nrh]=vecin;
p[vecin]=nrh;
s=nrh;
p1=s/2;
}
while(p1!=0 && D[h[s]]<D[h[p1]])
{
swap(h[s], h[p1]);
p[h[s]]=s;
p[h[p1]]=p1;
s=p1;
p1/=2;
}
}
}
}
}
ifstream in("apm.in");
ofstream out("apm.out");
int main()
{
in>>n>>m;
for(i=1; i<=m; i++)
{
in>>x>>y>>z;
L[x].push_back(make_pair(y, z));
L[y].push_back(make_pair(x, z));
}
h[++nrh]=1;
p[1]=1;
memset(D, 127, sizeof(D));
D[1]=0;
prim();
out<<apm<<"\n"<<nrsol<<"\n";
for(i=1; i<nrsol; i++)
out<<soll[i].first<<" "<<soll[i].second<<"\n";
return 0;
}