题意
有n个人和m条证词,第i条证词是第
xi
x
i
个人说第
yi
y
i
个人是或不是罪犯。若一个人不是罪犯则他说的全是真话;若一个人是罪犯则他最多说了一句谎话。要求输出一组可行解。
n,m<=100000
分析
考虑把每个人和每条证词均拆成两个点,表示是犯人还是好人或者是真话还是谎话。然后就可以大力2-SAT建图了。
对于某个人说的全部证词,由于最多只能有一个谎话,所以每个证词的谎话点要向所有其他证词的真话点连边。这个可以用前后缀优化连边。
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=600005;
int n,m,cnt,last[N],pre[N],suf[N],cho[N],sz,a[N];
struct edge{int to,next,from,op;}e[N];
int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int point(int x,int y)
{
return y*(n+m)+x;
}
void addedge(int u,int v,int op)
{
e[++cnt].from=u;e[cnt].to=v;e[cnt].op=op;e[cnt].next=last[u];last[u]=cnt;
}
struct Two_SAT
{
int cnt,tim,dfn[N],low[N],stack[N],top,ls[N],bel[N],tot,last[N],con[N];
bool ins[N];
struct edge{int from,to,next;}e[N*20];
void addedge(int u,int v)
{
e[++cnt].from=u;e[cnt].to=v;e[cnt].next=last[u];last[u]=cnt;
}
void add1(int u,int v)
{
e[++cnt].to=v;e[cnt].next=last[u];last[u]=cnt;
e[++cnt].to=u;e[cnt].next=ls[v];ls[v]=cnt;
}
void tarjan(int x)
{
dfn[x]=low[x]=++tim;
stack[++top]=x;ins[x]=1;
for (int i=last[x];i;i=e[i].next)
if (!dfn[e[i].to]) tarjan(e[i].to),low[x]=min(low[x],low[e[i].to]);
else if (ins[e[i].to]) low[x]=min(low[x],dfn[e[i].to]);
if (dfn[x]==low[x])
{
tot++;int y=0;
while (y!=x) y=stack[top--],bel[y]=tot,ins[y]=0;
}
}
void fill(int x,int y)
{
cho[x]=y;
for (int i=y==1?last[x]:ls[x];i;i=e[i].next)
if (!cho[e[i].to]) fill(e[i].to,y);
}
bool solve()
{
for (int i=1;i<=sz;i++) if (!dfn[i]) tarjan(i);
for (int i=1;i<=n+m;i++) if (bel[point(i,0)]==bel[point(i,1)]) return 0;
memset(last,0,sizeof(last));
int tmp=cnt;
for (int i=1;i<=tmp;i++)
{
int x=bel[e[i].from],y=bel[e[i].to];
if (x!=y) add1(x,y);
}
for (int i=1;i<=n+m;i++)
{
con[bel[point(i,0)]]=bel[point(i,1)];
con[bel[point(i,1)]]=bel[point(i,0)];
}
for (int i=1;i<=tot;i++) if (!cho[i]) fill(i,1),fill(con[i],2);
return 1;
}
}t;
int main()
{
n=read();m=read();
for (int i=1;i<=m;i++)
{
int x=read(),y=read(),z=read();
addedge(x,y,z);
}
sz=point(n+m,1);
for (int i=1;i<=n;i++)
{
int tot=0;
for (int j=last[i];j;j=e[j].next)
t.addedge(point(i,1),point(j+n,1)),
t.addedge(point(j+n,0),point(i,0)),
a[++tot]=j;
for (int j=1;j<=tot;j++) pre[j]=++sz,t.addedge(pre[j],point(a[j]+n,1));
for (int j=2;j<=tot;j++) t.addedge(pre[j],pre[j-1]);
for (int j=tot;j>=1;j--) suf[j]=++sz,t.addedge(suf[j],point(a[j]+n,1));
for (int j=tot-1;j>=1;j--) t.addedge(suf[j],suf[j+1]);
for (int j=1;j<=tot;j++)
{
if (j>1) t.addedge(point(a[j]+n,0),pre[j-1]);
if (j<tot) t.addedge(point(a[j]+n,0),suf[j+1]);
}
}
for (int i=1;i<=m;i++)
{
int x=e[i].from,y=e[i].to,z=e[i].op;
if (!z)
{
t.addedge(point(i+n,1),point(y,0));
t.addedge(point(i+n,0),point(y,1));
t.addedge(point(y,0),point(i+n,1));
t.addedge(point(y,1),point(i+n,0));
}
else
{
t.addedge(point(i+n,1),point(y,1));
t.addedge(point(i+n,0),point(y,0));
t.addedge(point(y,0),point(i+n,0));
t.addedge(point(y,1),point(i+n,1));
}
}
if (!t.solve()) {puts("Impossible");return 0;}
int ans=0;
for (int i=1;i<=n;i++) if (cho[t.bel[point(i,0)]]==1) ans++;
printf("%d\n",ans);
for (int i=1;i<=n;i++) if (cho[t.bel[point(i,0)]]==1) printf("%d ",i);
return 0;
}