60pts 求助，及关于造数据的疑问，玄关

#include<bits/stdc++.h>
using namespace std;
struct nood{
	int num,s,d,c1,c2,p;
}pjr;
vector<nood> now,a;
vector<int> ji;
int m,n,k;
int zu(int x){
	return ji[x]==x?x:ji[x]=zu(ji[x]);
} 
bool cmp(nood a,nood b){
	return a.num<b.num;
}
bool check(int xian){
	for(int i=0;i<=n;i++) ji[i]=i;
	now.clear();
	int x,y,z,c,sum1=0,sum2=0;
	for(int i=0;i<a.size();i++){
		x=a[i].s,y=a[i].d,z=a[i].c1,c=a[i].c2;
		if(zu(x)==zu(y)||c>xian) continue;
		now.push_back(a[i]);
		if(z<=xian) now[sum1].p=1,sum2++;
		else now[sum1].p=2;
		if(ji[x]==x) ji[x]=zu(y);
		else ji[zu(y)]=zu(x);
		sum1++;
	}
	if(sum1<(n-1)||sum2<k) return false;
	else return true;
}
int main(){
	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
	cin>>n>>k>>m;
	int i=1,l=30000,r=1;
	for(int i=1;i<=m-1;i++){
		cin>>pjr.s>>pjr.d>>pjr.c1>>pjr.c2;
		pjr.num=i;
		a.push_back(pjr);
		l=min(l,pjr.c2),r=max(pjr.c1,r);
	}
	 
	for(int i=0;i<=n;i++){
		ji.push_back(i);
	}
//	cout<<check(3)<<" "<<check(4)<<" "<<check(5)<<" "<<check(7)<<endl;
//	cout<<l<<" "<<r<<endl;
	while(l<r-1){
//		cout<<l<<" "<<r<<endl;
		int mid=(l+r)>>1;
//		cout<<check(mid)<<endl;
		if(check(mid)){
			r=mid;
//			cout<<"!"<<endl;
		}
		else l=mid;
	}
	bool jrt=check(r);
	cout<<r<<endl;
	sort(now.begin(),now.end(),cmp);
	for(int i=0;i<now.size();i++){
		cout<<now[i].num<<" "<<now[i].p<<endl;
	}
	fclose(stdin);
//	fclose(stdout);
	return 0;
}