给你一个n点m边的图,要求你求一个生成树,s点的度数不超过ds,t点的度数不超过dt,输出选择的边
首先去掉s,t两点,然后把其他点求连通,然后对于这几个互相不连通的块,看它们和s,t是否连通
然后把只能和s连得块,连上,只能和t连的块连上
剩下的就是都能连的块,然后判断一下度数是否可行
如果剩下没有块了,就看s和t是否有边
否则的话就是选一个,连s和t,其他的能连s的话连s,不满足了就连t
代码:
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
#define MAX 200010
#define MAXN 1000005
#define maxnode 5
#define sigma_size 30
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define limit 10000
//const int prime = 999983;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f;
//const double PI = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const LL mod = 1e9+7;
const ull mx = 133333331;
/*****************************************************/
inline void RI(int &x) {
char c;
while((c=getchar())<'0' || c>'9');
x=c-'0';
while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/
struct Edge{
int u,v,next;
}edge[MAX*4];
int head[MAX];
int pre[MAX];
int fst[MAX];
int tot;
void init(){
mem(head,-1);
tot=0;
}
void add_edge(int a,int b){
edge[tot]=(Edge){a,b,head[a]};
head[a]=tot++;
}
vector<int> ver[MAX];
set<int> se;
int Find(int x){
return pre[x]==x?x:pre[x]=Find(pre[x]);
}
int main(){
//freopen("in.txt","r",stdin);
int n,m;
while(cin>>n>>m){
init();
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
add_edge(a,b);
add_edge(b,a);
}
vector<pii> ans;
for(int i=1;i<=n;i++){
pre[i]=i;
ver[i].clear();
}
int s,t,ds,dt;
cin>>s>>t>>ds>>dt;
int flag=0;
for(int i=0;i<tot;i+=2){
int u=edge[i].u;
int v=edge[i].v;
if((u==s&&v==t)||(u==t&&v==s)) flag=1;
if(u==s||v==s||u==t||v==t) continue;
int uu=Find(u);
int vv=Find(v);
if(pre[uu]!=vv){
pre[uu]=vv;
ans.push_back(mk(u,v));
}
}
se.clear();
for(int i=1;i<=n;i++){
if(i!=s&&i!=t){
int u=Find(i);
ver[u].push_back(i);
se.insert(u);
}
}
int num=0;
mem(fst,-1);
for(set<int>::iterator it=se.begin();it!=se.end();it++){
int u=*it;
int f1=0;
int f2=0;
for(int i=0;i<ver[u].size();i++){
int j=ver[u][i];
for(int x=head[j];x!=-1;x=edge[x].next){
int v=edge[x].v;
if(v==s) f1=1;
if(v==t) f2=1;
}
}
if(f1&&f2){
num++;
fst[u]=0;
continue;
}
if(f1) fst[u]=1;
if(f2) fst[u]=2;
}
for(int i=head[s];i!=-1;i=edge[i].next){
int v=edge[i].v;
Find(v);
if(v==t) continue;
if(fst[pre[v]]==1){
ds--;
ans.push_back(mk(s,v));
fst[pre[v]]=-1;
}
}
for(int i=head[t];i!=-1;i=edge[i].next){
int v=edge[i].v;
Find(v);
if(v==s) continue;
if(fst[pre[v]]==2){
dt--;
ans.push_back(mk(t,v));
fst[pre[v]]=-1;
}
}
if(ds<0||dt<0) printf("No\n");
else{
if(num){
if(ds>=1&&dt>=1&&ds+dt-2>=num-1){
int fl=0;
for(int i=head[s];i!=-1;i=edge[i].next){
int v=edge[i].v;
if(v==t) continue;
if(fst[pre[v]]==0&&ds){
if(!fl) fl=pre[v];
ans.push_back(mk(s,v));
fst[pre[v]]=-1;
ds--;
}
}
for(int i=head[t];i!=-1;i=edge[i].next){
int v=edge[i].v;
if(v==s) continue;
if(pre[v]==fl){
dt--;
ans.push_back(mk(t,v));
fl=-1;
}
if(fst[pre[v]]==0){
dt--;
ans.push_back(mk(t,v));
fst[pre[v]]=-1;
}
}
printf("Yes\n");
for(int i=0;i<ans.size();i++){
printf("%d %d\n",ans[i].first,ans[i].second);
}
}
else printf("No\n");
}
else{
if(flag&&ds>=1&&dt>=1){
printf("Yes\n");
ans.push_back(mk(s,t));
for(int i=0;i<ans.size();i++){
printf("%d %d\n",ans[i].first,ans[i].second);
}
}
else printf("No\n");
}
}
}
return 0;
}