MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / sat

Method sat

code/other/two_sat.cpp:33–36  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

31 res &= 1; }
32 return br | !res; }
33 bool sat() {
34 rep(i,0,2*n+1)
35 if (i != n && V[i].num == -1 && !dfs(i)) return false;
36 return true; } };
37// vim: cc=60 ts=2 sts=2 sw=2:

Callers 1

testFunction · 0.80

Calls 1

dfsFunction · 0.50

Tested by 1

testFunction · 0.64