Pagini recente » Cod sursa (job #1146545) | Cod sursa (job #1533215) | Cod sursa (job #375326) | Cod sursa (job #2608139) | Cod sursa (job #2651806)
#include <bits/stdc++.h>
#define DIM 200010
using namespace std;
ifstream fin("lazy.in");
ofstream fout("lazy.out");
int n,m,q,i,k,mmax,sol[DIM],t[DIM],rrx,rry,x,y,rx,ry,j;
struct muchie{
int x,y,c1,c2,idx;
};
vector< pair<int,int> > L[2*DIM];
muchie v[4*DIM];
bool cmp(muchie &a, muchie &b) {
if (a.c1!=b.c1)
return a.c1<b.c1;
return a.c2>b.c2;
}
int rad(int nod) {
while (t[nod]>0)
nod=t[nod];
return nod;
}
int main() {
fin>>n>>m;
for (i=1;i<=m;i++) {
fin>>v[i].x>>v[i].y>>v[i].c1>>v[i].c2;
v[i].idx=i;
}
sort(v+1,v+m+1,cmp);
for (i=1;i<=n;i++)
t[i]=-1;
for (i=1;i<=m;i++) {
x=v[i].x, y=v[i].y;
rx=rad(x), ry=rad(y);
if (rx!=ry) {
sol[++k]=v[i].idx;
if (rx>ry) {
t[rx]+=t[ry];
t[ry]=rx;
}
else {
t[ry]+=t[rx];
t[rx]=ry;
}
}
}
for (i=1;i<=k;i++)
fout<<sol[i]<<"\n";
return 0;
}