Pagini recente » Cod sursa (job #223547) | Cod sursa (job #1850655) | Cod sursa (job #953989) | Cod sursa (job #321480) | Cod sursa (job #2018370)
#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <deque>
#include <ctime>
#include <queue>
#include <cmath>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
using zint = int;
using namespace std;
const int inf = 3e4 + 5;
const int NMax = 1e5 + 5;
const int MMax = 2e5 + 5;
const int coef = 20;
ifstream in("2sat.in");
ofstream out("2sat.out");
zint N,M,P;
zint sol[NMax],aux[NMax];
pair<zint,zint> ex[MMax];
struct elem {
zint lit,nrE;
elem (zint _lit = 0,zint _nrE = 0) {
lit = _lit;
nrE = _nrE;
}
};
vector<elem> v[NMax];
bool eval(zint);
void cpy(zint*,zint*);
int main() {
in>>N>>M;
for (int i=1;i <= M;++i) {
zint x,y;
in>>x>>y;
ex[i] = mp(x,y);
}
srand(time(0));
for (int i=1;i <= N;++i) {
sol[i] = rand()%2;
}
bool noSol = true;
ll lim = coef*N;
while (noSol && lim--) {
bool curr = true;
for (int i=1;i <= M;++i) {
if (eval(i)) {
continue;
}
curr = false;
if (rand() % 2 == 0) {
sol[abs(ex[i].first)] ^= 1;
}
else {
sol[abs(ex[i].second)] ^= 1;
}
//cout<<i<<' ';
break;
}
noSol = !curr;
/*
cout<<noSol<<'\n';
for (int i=1;i <= N;++i) {
cout<<sol[i]<<' ';
}
cout<<"\n\n";
//*/
}
if (noSol) {
out<<"-1\n";
}
else {
for (int i=1;i <= N;++i) {
out<<sol[i]<<' ';
}
/*
cout<<"YE\n";
for (int i=1;i <= M;++i) {
if (!eval(i)) {
cout<<"BAD\n";
break;
}
}
//*/
}
in.close();out.close();
return 0;
}
bool eval(zint nr) {
zint x = ex[nr].first,
y = ex[nr].second,
val1 = sol[abs(x)],
val2 = sol[abs(y)];
if (x < 0) { val1 ^= 1; }
if (y < 0) { val2 ^= 1; }
return (val1 | val2);
}