题目:
http://acm.hdu.edu.cn/showproblem.php?pid=4421
题意:
给出一个矩阵,询问是否存在一个a序列,使得符合矩阵中,b【i%2=1】【j%2=1】= a[i]|b[j] ; b【i%2=0】【j%2=0】= a[i] & a[j];其他b【i】【j】 = a[i]^b[j].
思路:
将数的每个二进制位分别建图,跑2-SAT.
AC.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn = 505*4;
const int maxm = 4e6+5;
int g[505][505];
int tol, head[maxn];
struct Edge{
int to, nex;
}edge[maxm];
void init()
{
tol = 0;
memset(head, -1, sizeof(head));
}
void addedge(int u, int v)
{
edge[tol].to = v;
edge[tol].nex = head[u];
head[u] = tol++;
}
int low[maxn], dfn[maxn], Stack[maxn], belong[maxn];
int Index, top;
int scc;
bool Instack[maxn];
int num[maxn];
void tarjan(int u)
{
int v;
low[u] = dfn[u] = ++Index;
Stack[top++] = u;
Instack[u] = true;
for(int i = head[u]; ~i; i = edge[i].nex) {
v = edge[i].to;
if(!dfn[v]) {
tarjan(v);
if(low[u] > low[v]) low[u] = low[v];
}
else if(Instack[v] && low[u] > dfn[v]) {
low[u] = dfn[v];
}
}
if(low[u] == dfn[u]) {
scc++;
do {
v = Stack[--top];
Instack[v] = false;
belong[v] = scc;
num[scc]++;
}while(v != u);
}
}
bool solve(int n)
{
memset(dfn, 0, sizeof(dfn));
memset(Instack, false, sizeof(Instack));
memset(num, 0, sizeof(num));
Index = scc = top= 0;
for(int i = 0; i < 2*n; ++i) {
if(!dfn[i]) tarjan(i);
}
for(int i = 0; i < n; ++i) {
if(belong[i] == belong[n+i]) return false;
}
return true;
}
int main()
{
//freopen("in", "r", stdin);
int n;
while(~scanf("%d", &n)) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
scanf("%d", &g[i][j]);
}
}
int flag = 1;
for(int b = 0; b < 31; ++b) {
init();
for(int i = 0; i < n; ++i) {
for(int j = i+1; j < n; ++j) {
if(i%2 == 1 && j%2 == 1) {
if(g[i][j] & (1<<b)) {
addedge(n+i, j);
addedge(n+j, i);
}
else{
addedge(i, n+i);
addedge(j, n+j);
}
}
else if(i%2==0 && j%2==0) {
if(g[i][j] & (1<<b)) {
addedge(n+i, i);
addedge(n+j, j);
}
else {
addedge(i, n+j);
addedge(j, n+i);
}
}
else {
if(g[i][j] & (1<<b)) {
addedge(i,j+n);
addedge(i+n,j);
addedge(j,i+n);
addedge(j+n,i);
}
else {
addedge(i,j);
addedge(i+n,j+n);
addedge(j,i);
addedge(j+n,i+n);
}
}
}
}
if(!solve(n)) {
flag = 0;
break;
}
}
if(flag) puts("YES");
else puts("NO");
}
return 0;
}