Cod sursa(job #2026275)

Utilizator MaligMamaliga cu smantana Malig Data 24 septembrie 2017 10:01:02
Problema 2SAT Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 2.47 kb
#include<bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
using namespace std;
ifstream in("2sat.in");
ofstream out("2sat.out");

const int NMax = 1e5 + 5;
const int MMax = 2e5 + 5;
const int inf = 1e9 + 5;
using zint = short;

zint N,M;
zint sol[NMax],aux[NMax];
pair<zint,zint> ex[MMax];
vector< pair<zint,zint> > v[NMax];

bool test(zint,zint);
bool eval(zint);
void cpy(zint*,zint*);

int main() {
    in>>N>>M;
    for (int i=1;i <= M;++i) {
        int x,y;
        in>>x>>y;

        ex[i] = mp(x,y);
        v[abs(x)].pb( mp(abs(y),i) );
        v[abs(y)].pb( mp(abs(x),i) );
    }

    for (int i=1;i <= N;++i) {
        sol[i] = -1;
    }

    bool ans = true;
    for (int i=1;i <= N;++i) {
        if (sol[i] != -1) {
            continue;
        }

        if (test(i,0) || test(i,1)) {
            cpy(sol,aux);
        }
        else {
            ans = false;
            break;
        }
    }

    if (ans) {
        for (int i=1;i <= N;++i) {
            out<<sol[i]<<' ';
        }
    }
    else {
        out<<"-1\n";
    }

    in.close();out.close();
    return 0;
}

bool test(zint idx,zint val) {
    cpy(aux,sol);
    aux[idx] = val;

    queue<zint> Q;
    Q.push(idx);
    while (Q.size()) {
        zint lit = Q.front();
        Q.pop();

        for (auto p : v[lit]) {
            zint nxt = p.first, nr = p.second;
            if (aux[nxt] != -1) {
                if (eval(nr)) {
                    continue;
                }
                return false;
            }

            aux[nxt] = 0;
            bool val0 = eval(nr);

            aux[nxt] = 1;
            bool val1 = eval(nr);

            if (val0) {
                if (val1) {
                    aux[nxt] = -1;
                    continue;
                }
                aux[nxt] = 0;
            }
            else if (val1) {
                aux[nxt] = 1;
            }

            Q.push(nxt);
        }
    }

    return true;
}

bool eval(zint nr) {
    int x = ex[nr].first,
        y = ex[nr].second,
        val1 = aux[abs(x)],
        val2 = aux[abs(y)];

    /*
    val1 = (x < 0) ? val1^1 : val1;
    val2 = (y < 0) ? val2^1 : val2;
    //*/

    if (x < 0) {val1 ^= 1;}
    if (y < 0) {val2 ^= 1;}
    return val1 | val2;
}

void cpy(zint* a,zint* b) {
    for (int i=1;i <= N;++i) {
        a[i] = b[i];
    }
}