根据2-SAT的方法建图后,得到强连通分量,并根据与拓扑序联系,输出答案。
代码中用详细注释。
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5,M=1e5+5;
int n,m,ans,a[N],b[N];
int cnt,head[N<<1];
int col,now,top,dfn[N<<1],low[N<<1],color[N<<1],sta[N<<1],si[N<<1];
bool jay;
char s1[4],s2[4];
struct edge{int next,from,to;}e[M<<1];
inline void add(int u,int v)
{
cnt++;
e[cnt].next=head[u];
e[cnt].from=u;
e[cnt].to=v;
head[u]=cnt;
}
inline void tarjan(int u)
{
dfn[u]=low[u]=++now;
sta[++top]=u;
for (register int i=head[u]; i; i=e[i].next)
{
if (!dfn[e[i].to])
{
tarjan(e[i].to);
low[u]=min(low[u],low[e[i].to]);
}
else if (!color[e[i].to])
low[u]=min(low[u],dfn[e[i].to]);
}
if (low[u]==dfn[u])
{
color[u]=++col;
si[col]++;
while (sta[top]!=u) color[sta[top]]=col,si[col]++,top--;
top--;
}
}
int main(){
scanf("%d%d",&n,&m);
for (register int t=1; t<=n; ++t)
{
scanf("%d",&a[0]);
for (register int i=1; i<=a[0]; ++i) scanf("%d",&a[i]);
if (t>1)
for (register int i=1; i<=min(a[0],b[0]); ++i)
{
if (b[i]<a[i])
{
add(b[i]+m,a[i]+m);
add(a[i],b[i]);
break;
}
if (b[i]>a[i])
{
add(b[i]+m,b[i]);
add(a[i],a[i]+m);
break;
}
if (i==min(a[0],b[0]) && b[0]>a[0]) {puts("No"); return 0;}
}
for (register int i=0; i<=a[0]; ++i) b[i]=a[i];
}
for (register int i=1; i<=2*m; ++i) if (!dfn[i]) tarjan(i);
for (register int i=1; i<=m; ++i)
if (color[i]==color[i+m])
{
puts("No");
return 0;
}
puts("Yes");
for (register int i=1; i<=m; ++i) if (color[i]<color[i+m]) ans++;
printf("%d\n",ans);
for (register int i=1; i<=m; ++i) if (color[i]<color[i+m]) printf("%d ",i);
return 0;
}