题目:
http://acm.hdu.edu.cn/showproblem.php?pid=4421
题意:
给定一个矩阵b,问问在题目中给定的伪代码下,是否存在a数组
思路:
刚开始我把每个数化成31位二进制一起搞了,果断GG了。可以把每次统一只取矩阵中数字的某一位二进制,这个二进制显然是0或1,那么就可以根据三种运算符建图判断是否有可行解,这样判断31次就可以了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1010;
struct edge
{
int to, next;
} g[N*N*2];
int cnt, head[N];
int num, idx, top, scc[N], st[N], dfn[N], low[N];
bool vis[N];
int b[510][510];
int n;
void add_edge(int v, int u)
{
g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void init()
{
memset(head, -1, sizeof head);
memset(dfn, -1, sizeof dfn);
memset(vis, 0, sizeof vis);
cnt = num = idx = top = 0;
}
void tarjan(int v)
{
dfn[v] = low[v] = ++idx;
vis[v] = true, st[top++] = v;
int u;
for(int i = head[v]; i != -1; i = g[i].next)
{
u = g[i].to;
if(dfn[u] == -1)
{
tarjan(u);
low[v] = min(low[v], low[u]);
}
else if(vis[u]) low[v] = min(low[v], dfn[u]);
}
if(dfn[v] == low[v])
{
num++;
do
{
u = st[--top], vis[u] = false, scc[u] = num;
}
while(u != v);
}
}
bool work()
{
for(int i = 0; i < n; i++)
if(b[i][i] != 0) return false;
for(int i = 0; i < n; i++)
for(int j = i + 1; j < n; j++)
if(b[i][j] != b[j][i]) return false;
return true;
}
int main()
{
while(~ scanf("%d", &n))
{
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
scanf("%d", &b[i][j]);
if(! work())
{
printf("NO\n"); continue;
}
bool flag = true;
for(int k = 0; k < 31; k++)
{
init();
for(int i = 0; i < n; i++)
for(int j = i + 1; j < n; j++)
{
if(i % 2 == 1 && j % 2 == 1)
{
if((b[i][j]>>k) & 1) add_edge(i + n, j), add_edge(j + n, i);
else add_edge(i, i + n), add_edge(j, j + n);
}
else if(i % 2 == 0 && j % 2 == 0)
{
if((b[i][j]>>k) & 1) add_edge(i + n, i), add_edge(j + n, j);
else add_edge(i, j + n), add_edge(j, i + n);
}
else
{
if((b[i][j]>>k) & 1)
{
add_edge(i, j + n), add_edge(i + n, j);
add_edge(j, i + n), add_edge(j + n, i);
}
else
{
add_edge(i, j), add_edge(j, i);
add_edge(i + n, j + n), add_edge(j + n, i + n);
}
}
}
for(int i = 0; i < n*2; i++)
if(dfn[i] == -1) tarjan(i);
for(int i = 0; i < n; i++)
if(scc[i] == scc[i+n])
{
flag = false; break;
}
if(! flag) break;
}
if(flag) printf("YES\n");
else printf("NO\n");
}
return 0;
}