\u6700\u5927\u6d41\u3002\u3002\u5f88\u597d\u6784\u56fe\u3002\u3002\u5b9e\u9645\u4e0a\u4e0d\u7528\u4e0a\u4e0b\u754c\u7684\u3002\u3002
\u6e90\u5230\u6bcf\u4e2a\u5b66\u751f\u8054\u4e00\u6761\u5bb9\u91cf1\u7684\u8fb9\u3002\u3002\u5b66\u751f\u5230\u6bcf\u4e2a\u80fd\u53bb\u7684\u5b66\u6821\u8fde\u4e00\u6761\u5bb9\u91cf1\u7684\u8fb9\u3002\u3002\u5b66\u6821\u5230\u6c47\u8fde\u4e00\u6761\u5bb9\u91cf\u4e3a2\u7684\u8fb9\u3002\u3002\u7136\u540e\u5224\u65ad\u6d41\u91cf\u662f\u5426\u662f\u5b66\u6821\u76842\u500d\u5c31OK\u4e86\u3002\u3002\u3002
Code\u3002\u3002
#include<iostream>
#include<string.h>
using namespace std;
const int maxn=200+10,maxk=200+10,maxV=maxn+maxk,inf=~0U>>1;
int vs,vt;
int n,k;
struct edge
{
int t,c;
edge*next,*op;
edge(int t,int c,edge*n):t(t),c(c),next(n){}
}*E[maxV];
int H[maxV],VH[maxV];
void addedge(int s,int t,int c)
{
E[s]=new edge(t,c,E[s]);
E[t]=new edge(s,0,E[t]);
E[s]->op=E[t];E[t]->op=E[s];
}
inline int stu(int n){return n;}
inline int sch(int n){return n+maxn;}
int aug(int no,int m)
{
if(no==vt) return m;
int l=m;
for(edge*i=E[no];i;i=i->next) if(i->c&&H[i->t]+1==H[no])
{
int d=aug(i->t,min(i->c,l));
l-=d;i->c-=d;i->op->c+=d;
if(H[vs]==n||l==0) return m-l;
}
int minh=n; for(edge*i=E[no];i;i=i->next) if(i->c)
if(H[i->t]+1<minh) minh=H[i->t]+1;
if(!–VH[H[no]]) H[vs]=n;else ++VH[H[no]=minh];
return m-l;
}
void init()
{
cin>>n>>k;vs=0;vt=maxV-1;
for(int i=1;i<=n;i++)
{
int t,s;cin>>t;
addedge(vs,stu(i),1);
for(int j=0;j<t;j++)
{
cin>>s;addedge(stu(i),sch(s),1);
}
}
n+=2+k;
for(int i=1;i<=k;i++)
addedge(sch(i),vt,2);
memset(H,0,sizeof(H));
memset(VH,0,sizeof(VH));
VH[0]=n;
}
void solve()
{
int ans=0;
while(H[vs]<n) ans+=aug(vs,inf);
if(ans<2*k)
cout<<"NOn";
else
{
cout<<"YESn";int ans[maxn];
for(int i=1;i<=k;i++)
{
int num=0;
for(edge*j=E[sch(i)];j;j=j->next)
if(j->t!=vt&&j->c==1)
{
ans[num++]=j->t;
}
cout<<num;
for(int o=0;o<num;o++)
cout<<" "<<ans[o];
cout<<endl;
}
}
}
int main()
{
init();
solve();
} <\/p>\n","protected":false},"excerpt":{"rendered":"
\u6700\u5927\u6d41\u3002\u3002\u5f88\u597d\u6784\u56fe\u3002\u3002\u5b9e\u9645\u4e0a\u4e0d\u7528\u4e0a\u4e0b\u754c\u7684\u3002\u3002\u6e90\u5230\u6bcf\u4e2a\u5b66\u751f\u8054\u4e00\u6761\u5bb9\u91cf1\u7684\u8fb9\u3002\u3002\u5b66\u751f\u5230\u6bcf\u4e2a\u80fd\u53bb\u7684\u5b66\u6821\u8fde\u4e00\u6761\u5bb9\u91cf1\u7684\u8fb9\u3002\u3002\u5b66\u6821\u5230\u6c47\u8fde\u4e00\u6761\u5bb9\u91cf\u4e3a2\u7684\u8fb9\u3002\u3002\u7136\u540e\u5224\u65ad\u6d41\u91cf\u662f\u5426\u662f\u5b66\u6821\u76842\u500d\u5c31OK\u4e86\u3002\u3002\u3002Code\u3002\u3002#include<iostream>#include<string.h>using namespace std;const int maxn=200+10,maxk=200+10,maxV=maxn+maxk,inf=~0U>>1;int vs,vt;int n,k;struct edge{int t,c;edge*next,*op;edge(int t,int c,edge*n):t(t),c(c),next(n){}}*E[maxV];int H[maxV],VH[maxV];void addedge(int s,int t,int c){E[s]=new edge(t,c,E[s]);E[t]=new edge(s,0,E[t]);E[s]->op=E[t];E[t]->op=E[s];}inline int stu(int n){return n;}inline int sch(int n){return n+maxn;}int aug(int no,int m){if(no==vt) return m;int l=m;for(edge*i=E[no];i;i=i->next) if(i->c&&H[i->t]+1==H[no]){int d=aug(i->t,min(i->c,l));l-=d;i->c-=d;i->op->c+=d;if(H[vs]==n||l==0) return m-l;}int minh=n; for(edge*i=E[no];i;i=i->next) if(i->c)if(H[i->t]+1<minh) minh=H[i->t]+1;if(!–VH[H[no]]) H[vs]=n;else ++VH[H[no]=minh];return m-l;}void init(){cin>>n>>k;vs=0;vt=maxV-1;for(int i=1;i<=n;i++){int t,s;cin>>t;addedge(vs,stu(i),1);for(int j=0;j<t;j++){cin>>s;addedge(stu(i),sch(s),1);}} n+=2+k;for(int i=1;i<=k;i++)addedge(sch(i),vt,2);memset(H,0,sizeof(H));memset(VH,0,sizeof(VH));VH[0]=n;}void solve(){ int ans=0;while(H[vs]<n) ans+=aug(vs,inf); […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/650"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=650"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/650\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=650"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=650"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=650"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}