奇数码问题

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int N = 500010;
 4 int a[N], b[N];
 5 int tmp[N];
 6 typedef long long ll;
 7 ll merge_sort(int a[], int l, int r) {
 8     if (l >= r) {
 9         return 0;
10     }
11     int mid = (l + r) >> 1;
12     ll ans = merge_sort(a, l, mid) + merge_sort(a, mid + 1, r);
13     int k = 0, i = l, j = mid + 1;
14     while (i <= mid && j <= r) {
15         if (a[i] <= a[j]) {
16             tmp[k++] = a[i++];
17         } else {
18             tmp[k++] = a[j++];
19             ans += mid - i + 1;
20         }
21     }
22     while (i <= mid) {
23         tmp[k++] = a[i++];
24     }
25     while (j <= r) {
26         tmp[k++] = a[j++];
27     }
28     for (int i = l, j = 0; i <= r; i++, j++) {
29         a[i] = tmp[j];
30     }
31     return ans;
32 }
33 int main () {
34     int n;
35     while (cin >> n) {
36         int len = n * n;
37         for (int i = 0, idx = 0; i < len; i++) {
38             int x;
39             cin >> x;
40             if (x) {
41                 a[idx++] = x;
42             }
43         }
44         for (int i = 0, idx = 0; i < len; i++) {
45             int x;
46             cin >> x;
47             if (x) {
48                 b[idx++] = x;
49             }
50         }
51         ll ans1 = merge_sort(a, 0, len - 2);
52         ll ans2 = merge_sort(b, 0, len - 2);
53         if ((ans1 % 2) == (ans2 % 2)) {
54             cout << "TAK" << endl;
55         } else {
56             cout << "NIE" << endl;
57         }
58     }
59     return 0;
60 }