模版题
题意:
求是否存在这样的数组a
使得b数组对应等式成立
问:
给定b数组,求是否有这样的a数组
思路:
对于每一个二进制位:
是否存在一个二进制位使得该式成立
然后2-sat 31次即可
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#define ll int
using namespace std;
inline ll Max(ll a,ll b){return a>b?a:b;}
inline ll Min(ll a,ll b){return a<b?a:b;}
#define N 1005
#define M 375000
struct Edge{
int to, nex;
}edge[M];
int head[N], edgenum;
void addedge(int u, int v){
Edge E = {v, head[u]};
edge[edgenum] = E;
head[u] = edgenum ++;
}
bool mark[N];
int Stack[N], top;
void init(){
memset(head, -1, sizeof(head)); edgenum = 0;
memset(mark, 0, sizeof(mark));
}
bool dfs(int x){
if(mark[x^1])return false;//一定是拆点的点先判断
if(mark[x])return true;
mark[x] = true;
Stack[top++] = x;
for(int i = head[x]; i != -1; i = edge[i].nex)
if(!dfs(edge[i].to)) return false;
return true;
}
bool solve(int n){
for(int i = 0; i < n; i+=2)
if(!mark[i] && !mark[i^1])
{
top = 0;
if(!dfs(i))//dfs(i) 假设i成立
{//当i不成立时,把所有因i成立的点都取消标记
while( top ) mark[ Stack[--top] ] = false;
if(!dfs(i^1))
return false;//若i的对立面也不成立则i点无解
}
}
return true;
}
int b[505][505];
bool hehe(int n){
for(int i=0;i < n; i++)
for(int j=i; j < n; j++)
{
if(i==j && b[i][j]) return false;
else if(i!=j && b[i][j] != b[j][i])return false;
}
return true;
}
int main(){
int n, i, j, k;
while(~scanf("%d",&n))
{
for(i = 0;i < n; i++)
for(j = 0; j < n; j++)
scanf("%d",&b[i][j]);
if(!hehe(n)){ printf("NO\n"); continue; }
bool ok = true;
for( k = 0; k < 31 && ok; k++)
{
init();
for(i = 0;i < n; i++)
for(j = i+1; j < n; j++)
{
if( (i&1) && (j&1) )
{
if((b[i][j]>>k) & 1)
{
addedge(2*i+1,2*j);
addedge(2*j+1,2*i);
}
else
{
addedge(2*i,2*i+1);
addedge(2*j,2*j+1);
}
}
else if(!(i&1) && !(j&1))
{
if((b[i][j]>>k) & 1)
{
addedge(2*i+1,2*i);
addedge(2*j+1,2*j);
}
else
{
addedge(2*i,2*j+1);
addedge(2*j,2*i+1);
}
}
else
{
if((b[i][j]>>k) & 1)
{
addedge(2*i,2*j+1);
addedge(2*i+1,2*j);
addedge(2*j,2*i+1);
addedge(2*j+1,2*i);
}
else
{
addedge(2*i,2*j);
addedge(2*i+1,2*j+1);
addedge(2*j,2*i);
addedge(2*j+1,2*i+1);
}
}
}
ok = ok && solve(n<<1);
}
if(ok)printf("YES\n");
else printf("NO\n");
}
return 0;
}
/*
2
0 4
4 0
3
0 1 24
1 0 86
24 86 0
*/