奇数码问题

 

 

#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
int a[N], b[N];
int tmp[N];
typedef long long ll;
ll merge_sort(int a[], int l, int r) {
    if (l >= r) {
        return 0;
    }
    int mid = (l + r) >> 1;
    ll ans = merge_sort(a, l, mid) + merge_sort(a, mid + 1, r);
    int k = 0, i = l, j = mid + 1;
    while (i <= mid && j <= r) {
        if (a[i] <= a[j]) {
            tmp[k++] = a[i++];
        } else {
            tmp[k++] = a[j++];
            ans += mid - i + 1;
        }
    }
    while (i <= mid) {
        tmp[k++] = a[i++];
    }
    while (j <= r) {
        tmp[k++] = a[j++];
    }
    for (int i = l, j = 0; i <= r; i++, j++) {
        a[i] = tmp[j];
    }
    return ans;
}
int main () {
    int n;
    while (cin >> n) {
        int len = n * n;
        for (int i = 0, idx = 0; i < len; i++) {
            int x;
            cin >> x;
            if (x) {
                a[idx++] = x;
            }
        }
        for (int i = 0, idx = 0; i < len; i++) {
            int x;
            cin >> x;
            if (x) {
                b[idx++] = x;
            }
        }
        ll ans1 = merge_sort(a, 0, len - 2);
        ll ans2 = merge_sort(b, 0, len - 2);
        if ((ans1 % 2) == (ans2 % 2)) {
            cout << "TAK" << endl;
        } else {
            cout << "NIE" << endl;
        }
    }
    return 0;
}