Pagini recente » Cod sursa (job #889223) | Cod sursa (job #735713) | Cod sursa (job #2797344) | Cod sursa (job #2300828) | Cod sursa (job #2239812)
# include <fstream>
# include <vector>
# include <stack>
# define DIM 200010
using namespace std;
ifstream fin("2sat.in");
ofstream fout("2sat.out");
stack<int> s;
vector<int> Lista[DIM];
int Marcat[DIM],low[DIM],niv[DIM],viz[DIM],n,m,x,y,i,t,ok;
int rv(int x){
if(x<=n)
return x+n;
else
return x-n;
}
void tarjan(int nc){
if(ok)
return;
t++;
low[nc]=niv[nc]=t;
s.push(nc);
for(int i=0;i<Lista[nc].size();i++){
if(ok)
return;
int nv=Lista[nc][i];
if(niv[nv]==0)
tarjan(nv);
if(viz[nv]==0)
low[nc]=min(low[nc],low[nv]);
}
if(low[nc]==niv[nc]){
while(s.top()!=nc){
int nv=s.top();
if(((Marcat[nv]||Marcat[rv(nv)])&&(!Marcat[nc]))||(((!Marcat[nv])||(!Marcat[rv(nv)]))&&Marcat[nc])){
fout<<"-1\n";
ok=1;
return;
}
viz[nv]=1;
if(!Marcat[nc]){
Marcat[nv]=1;
Marcat[rv(nv)]=2;
}
s.pop();
}
viz[nc]=1;
if(!Marcat[nc]){
Marcat[nc]=1;
Marcat[rv(nc)]=2;
}
s.pop();
}
}
int main () {
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
if(x<0)
x=-x+n;
if(y<0)
y=-y+n;
Lista[rv(x)].push_back(y);
Lista[rv(y)].push_back(x);
}
for(i=1;i<=2*n;i++){
if(niv[i]==0)
tarjan(i);
if(ok)
return 0;
}
for(i=1;i<=n;i++)
fout<<Marcat[i]%2<<" ";
return 0;
}