Cod sursa(job #3288603)

Utilizator AlexandruTigauTigau Alexandru AlexandruTigau Data 22 martie 2025 23:36:04
Problema 2SAT Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("2sat.in");
ofstream g("2sat.out");
vector<int> v[200005],vc[200005];
int viz[200005],ord[200005],k,apart[200005],p;
bool ans[200005];
void dfs1(int x)
{
    viz[x]=1;
    for(auto i:v[x])
        if(!viz[i])
            dfs1(i);
    ord[++k]=x;
}
void dfs2(int x)
{
    viz[x]=2;
    apart[x]=p;
    for(auto i:vc[x])
        if(viz[i]!=2)
            dfs2(i);
}
int main()
{
    int n,m;
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,opx,opy;
        f>>x>>y;
        if(x<0)
        {
            opx=-x;
            x=n-x;
        }
        else
            opx=x+n;
        if(y<0)
        {
            opy=-y;
            y=n-y;
        }
        else
            opy=y+n;
        v[opx].push_back(y);
        v[opy].push_back(x);
        vc[y].push_back(opx);
        vc[x].push_back(opy);
    }
    for(int i=1;i<=2*n;i++)
        if(!viz[i])
            dfs1(i);
    for(int i=2*n;i>=1;i--)
        if(viz[ord[i]]!=2)
    {
        ++p;
        dfs2(ord[i]);
    }
    for(int i=1;i<=n;i++)
        if(apart[i]==apart[i+n])    
        {
            g<<-1;
            return 0;
        }
        else ans[i]=apart[i]>apart[i+n];
    for(int i=1;i<=n;i++)
        g<<ans[i]<<" ";
    return 0;
}