Pagini recente » Cod sursa (job #2193483) | Cod sursa (job #2720776) | Cod sursa (job #3195961) | Cod sursa (job #3148490) | Cod sursa (job #3243293)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("2sat.in");
ofstream cout("2sat.out");
vector <int> g[200001];
vector <int> ctc[200001];
int l[200001],k,ok[200001],t;
bool rez[200001];
void arc(int x, int y ,int n)
{
if(x<0)
x=-x+n;
if(y<0)
y=-y+n;
g[x].push_back(y);
}
void dfs1(int nod)
{
ok[nod]=-1;
for(auto x : g[nod])
{
if(ok[x]==0)
dfs1(x);
}
l[++t]=nod;
}
void dfs2(int nod)
{
ok[nod]=k;
ctc[k].push_back(nod);
for(auto x : g[nod])
{
if(ok[x]==-1)
dfs2(x);
}
}
bool check(int n)
{
for(int i=1;i<=n;i++)
if(ok[i]==ok[i+n])
{
cout<<-1;
return 0;
}
return 1;
}
int main()
{
int n,m,i,x,y;
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
arc(-x,y,n);
arc(-y,x,n);
}
for(i=1;i<=n*2;i++)
{
if(ok[i]==0)
dfs1(i);
}
for(i=1;i<=n*2;i++)
{
if(ok[l[i]]==-1)
{
k++;
dfs2(l[i]);
}
}
if(check(n))
{
for(i=1;i<=k/2;i++)
{
for(auto x : ctc[i])
{
rez[x]=1;
if(x>n)
rez[x-n]=0;
else
rez[x+n]=0;
}
}
for(i=1;i<=n;i++)
cout<<rez[i]<<" ";
}
return 0;
}