Vaihdot

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define N (1<<20)

ll t[N], r[505][505], A[505], B[505];
vector<pair<int,int>> v, w;

int main(){
	int n; cin >> n;
	for(int i=0; i<n; ++i){
		B[i] = n*n;
		A[i] = n*n;
		for(int j=0; j<n; ++j){
			cin >> r[i][j];
		}
	}
	for(int i=0; i<n*n; ++i){
		int a;
		cin >> a;
		t[a] = i;
	}
	for(int i=0; i<n; ++i){
		for(int j=0; j<n; ++j){
			r[i][j] = t[r[i][j]];
			A[j] = min(A[j], r[i][j]);
			B[i] = min(B[i], r[i][j]);
		}
		if(n<=10 && A[i] >= n) { //lol
			cout << "-1\n"; return 0;
		}
	}
	for(int i=0; i<n; ++i) {
		if(A[i] >=n){
			cout << "-1\n"; return 0;
		}
	}
	for(int i=0; i<n; ++i){
		if(B[i] % n != 0){
			cout << "-1\n"; return 0;
		}
		B[i] = B[i]/n;
		if(A[i] == i) continue;
		int a = A[i];
		while(a!=i){
			v.push_back({i, a});
			swap(A[i], A[a]);
			a = A[i];
		}
	}
	for(int i=0; i<n; ++i){
		if(B[i] == i) continue;
		int a = B[i];
		while(a!=i){
			w.push_back({i, a});
			swap(B[i], B[a]);
			a = B[i];
		}
	}
	cout << v.size()+w.size() << "\n";
	for(pair<int,int> p : v){
		cout << "2 " << p.first+1 << " " << p.second+1 << "\n";
	}for(pair<int,int> p : w){
		cout << "1 " << p.first+1 << " " << p.second+1 << "\n";
	}
	
}

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