Vaihdot

#include <iostream>
#include <vector>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int t[n][n], r[n][n];
  int rltx[n*n], rlty[n*n];
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cin >> t[i][j];
      t[i][j]--;
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cin >> r[i][j];
      r[i][j]--;
      rltx[r[i][j]] = i;
      rlty[r[i][j]] = j;
    }
  }
  int rp[n], sp[n];
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (i != 0 && rp[j] != rlty[t[i][j]]) {
        cout << -1 << endl;
        return 0;
      }
      rp[j] = rlty[t[i][j]];
      if (i != 0 && sp[j] != rltx[t[j][i]]) {
        cout << -1 << endl;
        return 0;
      }
      sp[j] = rltx[t[j][i]];
    }
  }
  vector<pair<int, pair<int, int>>> mv;
  for (int i = 0; i < n; ++i) {
    int j = rp[i];
    while (j != i) {
      swap(rp[i], rp[j]);
      mv.push_back({2, {i+1, j+1}});
      j = rp[i];
    }
    j = sp[i];
    while (j != i) {
      swap(sp[i], sp[j]);
      mv.push_back({1, {i+1, j+1}});
      j = sp[i];
    }
  }
  cout << mv.size() << endl;
  for (auto p : mv) {
    cout << p.first << " " << p.second.first << " " << p.second.second << endl;
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED