Vaihdot

input/code.cpp: In function 'int main()':
input/code.cpp:188:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < ans.size(); ++i) {
                   ^

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 505;


vector<pair<int, pair<int, int> > > ans;
int table[N][N];
int goal[N][N];

vector<int> colT[N];
vector<int> rowT[N];
vector<int> colG[N];
vector<int> rowG[N];


int firstCT[N];
int firstRT[N];
int firstCG[N];
int firstRG[N];


int revCT[N];
int revRT[N];
int revCG[N];
int revRG[N];

int n;


void sortRows() {


	for(int r = 1; r <= n; ++r) {
		int toCorrectI = revRG[r];
		int curI = r;
		if(toCorrectI == curI) continue;
		revRT[r] = toCorrectI;
		revRG[toCorrectI] = revRT[r];
		int copy = firstRT[r];
		firstRT[r] = firstRT[toCorrectI];
		firstRT[toCorrectI] = copy;
		ans.push_back(make_pair(1, make_pair(toCorrectI, curI)));
	}


}



void sortCols() {


	for(int c = 1; c <= n; ++c) {
		int toCorrectI = revCG[c];
		int curI = c;
		if(toCorrectI == curI) continue;
		revCT[c] = toCorrectI;
		revCG[toCorrectI] = revCT[c];
		int copy = firstRT[c];
		firstCT[c] = firstCT[toCorrectI];
		firstCT[toCorrectI] = copy;
		ans.push_back(make_pair(2, make_pair(toCorrectI, curI)));
	}

}




int main() {
	cin >> n;
	for(int r = 1; r <= n; ++r) {
		for(int i = 1; i <= n; ++i) {
			cin >> table[r][i];
		}
	}

	for(int r = 1; r <= n; ++r) {
		for(int i = 1; i <= n; ++i) {
			cin >> goal[r][i];
		}
	}

	for(int r = 1; r <= n; ++r) {
		for(int x = 1; x <= n; ++x) {
			rowT[r].push_back(table[r][x]);
			rowG[r].push_back(goal[r][x]);
		}
		sort(rowT[r].begin(), rowT[r].end());
		sort(rowG[r].begin(), rowG[r].end());
	}

	for(int c = 1; c <= n; ++c) {
		for(int y = 1; y <= n; ++y) {
			colT[c].push_back(table[y][c]);
			colG[c].push_back(goal[y][c]);
		}
		sort(colT[c].begin(), colT[c].end());
		sort(colG[c].begin(), colG[c].end());
	}

	for(int row = 1; row <= n; ++row) {
		int first = rowT[row][0];
		bool ok = false;
		for(int rows = 1; rows <= n; ++rows) {
			if(rowG[rows][0] == first) {
				ok = true;
				for(int i = 1; i < n; ++i) {
					if(rowT[row][i] != rowG[rows][i]) {
						ok = false;
						break;
					}
				}
				break;
			}
		}
		if(!ok) {
			cout << -1 << "\n";
			return 0;
		}

	}


	for(int col = 1; col <= n; ++col) {
		int first = colT[col][0];
		bool ok = false;
		for(int cols = 1; cols <= n; ++cols) {
			if(colG[cols][0] == first) {
				ok = true;
				for(int i = 1; i < n; ++i) {
					if(colT[col][i] != colG[cols][i]) {
						ok = false;
						break;
					}
				}
			}
		}
		if(!ok) {
			cout << -1 << "\n";
			return 0;
		}

	}


	//There is a solution


	for(int r = 1; r <= n; ++r) {
		firstRT[r] = rowT[r][0];
		firstRG[r] = rowG[r][0];
	}
	for(int c = 1; c <= n; ++c) {
		firstCT[c] = colT[c][0];
		firstCG[c] = colG[c][0];
	}


	for(int r = 1; r <= n; ++r) {
		int target = firstRT[r];
		for(int i = 1; i <= n; ++i) {
			if(firstRG[i] == target) {
				revRT[r] = i;
				revRG[i] = r;
				break;
			}
		}
	}
	for(int c = 1; c <= n; ++c) {
		int target = firstCT[c];
		for(int i = 1; i <= n; ++i) {
			if(firstCG[i] == target) {
				revCT[c] = i;
				revCG[i] = c;
				break;
			}
		}
	}

	sortRows();
	sortCols();
	cout << ans.size() << "\n";
	for(int i = 0; i < ans.size(); ++i) {
		cout << ans[i].first << " " << ans[i].second.first << " " << ans[i].second.second << "\n";
	}
	

		

}

Test 1

Group: 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED