Bit Magic HDU

Yesterday, my teacher taught me about bit operators: and (&), or (|), xor (^). I generated a number table a[N], and wrote a program to calculate the matrix table b[N][N] using three kinds of bit operator. I thought my achievement would get teacher's attention.
The key function is the code showed below.

There is no doubt that my teacher raised lots of interests in my work and was surprised to my talented programming skills. After deeply thinking, he came up with another problem: if we have the matrix table b[N][N] at first, can you check whether corresponding number table a[N] exists?

InputThere are multiple test cases.
For each test case, the first line contains an integer N, indicating the size of the matrix. (1 <= N <= 500).
The next N lines, each line contains N integers, the jth integer in ith line indicating the element b[i][j] of matrix. (0 <= b[i][j] <= 2 ³¹ - 1)
OutputFor each test case, output "YES" if corresponding number table a[N] exists; otherwise output "NO".Sample Input

2
0 4
4 0
3
0 1 24
1 0 86
24 86 0

Sample Output

YES
NO
公式还是自己推下的好！加油!

// ConsoleApplication2.cpp: 定义控制台应用程序的入口点。
//

// ConsoleApplication1.cpp: 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define mem(array) memset(array,0,sizeof(array))
using namespace std;

const int maxn = 6000;
const int maxm = 999999;

stack<int> S;

struct node {
    int to, next;
}e[maxm];

int k, n, tot, index;
int Low[maxn], Dfn[maxn], head[maxn], cmp[maxn],map[505][505];
bool use[maxn];

void Inite() {
    k = tot = index = 0;
    mem(Dfn); mem(use); mem(cmp);
    memset(head, -1, sizeof(head));
}

void addedge(int u, int v) {
    e[tot].to = v;
    e[tot].next = head[u];
    head[u] = tot++;
}

void Tarjan(int u) {
    Low[u] = Dfn[u] = ++index;
    S.push(u);
    use[u] = 1;
    for (int i = head[u]; i != -1; i = e[i].next) {
        int v = e[i].to;
        if (!Dfn[v]) {
            Tarjan(v);
            Low[u] = min(Low[u], Low[v]);
        }
        else if (use[v]) {
            Low[u] = min(Low[u], Dfn[v]);
        }
    }
    int v;
    if (Dfn[u] == Low[u]) {
        k++;
        do {
            v = S.top();
            S.pop();
            cmp[v] = k;
            use[v] = 0;
        } while (v != u);
    }
}

bool check() {
    for (int i = 0; i < n; i++) {
        if (map[i][i]) return false;
        for (int j = i + 1; j < n; j++)
            if (map[i][j] != map[j][i]) return false;
    }
    return true;
}

int main()
{
    while (scanf_s("%d", &n) != EOF) {
        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) scanf_s("%d", &map[i][j]);
        if (!check()) { puts("NO"); continue; }
        bool flag = false;
        for (int p = 0; p < 31; p++) {
            Inite();
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (i % 2 == 1 && j % 2 == 1) {
                        if ((map[i][j] >> p) & 1) {
                            addedge(i + n, j);
                            addedge(j + n, i);
                        }
                        else {
                            addedge(i, i + n);
                            addedge(j, j + n);
                        }
                    }
                    else if (i % 2 == 0 && j % 2 == 0) {
                        if ((map[i][j] >> p) & 1) {
                            addedge(i + n, i);
                            addedge(j + n, j);
                        }
                        else {
                            addedge(i, j + n);
                            addedge(j, i + n);
                        }
                    }
                    else {
                        if ((map[i][j] >> p) & 1) {
                            addedge(i, j + n);
                            addedge(i + n, j);
                            addedge(j, i + n);
                            addedge(j + n, i);
                        }
                        else {
                            addedge(i, j);
                            addedge(j, i);
                            addedge(i + n, j + n);
                            addedge(j + n, i + n);
                        }
                    }
                }    
            }
            for (int i = 0; i < 2 * n; i++) if (!Dfn[i]) Tarjan(i);
            for (int i = 0; i < n; i++) if (cmp[i] == cmp[i + n]) flag = true;
            if (flag) break;    
         }
        if (flag) puts("NO");
        else puts("YES");
    }
    return 0;
}