Vaihdot

input/code.cpp: In function 'std::vector<std::tuple<int, int, int> > f(int, std::vector<std::tuple<int, int, int> >)':
input/code.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<op.size() && !loyt; i++) {
                    ^
input/code.cpp:32:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (t.size()<m) {
                 ^
input/code.cpp: In function 'int main()':
input/code.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (t.size() == LIMIT) cout << "-1\n";
               ^
input/code.cpp:55:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<t.size(); i++)
                  ^

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> oprtn;
int LIMIT = 8;
ll n;
vector<int> A,B;
void vaihda(int type, int a, int b) {
	if (type) for (int i=0; i<n; i++) swap(A[i*n+a], A[i*n+b]);
	else for (int i=0; i<n; i++) swap(A[a*n+i], A[b*n+i]);
}
vector<oprtn> f(int c, vector<oprtn> op) {
	if (A==B) return op;
	if (c >= LIMIT) {
		op.clear();
		return op;
	}
	int m=INT_MAX;
	vector<oprtn> nop;
	for (int i=0; i<=1; i++) {
		for (int a=0; a<n; a++) {
			for (int b=a+1; b<n; b++) {
				oprtn n = make_tuple(i+1,a+1,b+1);
				bool loyt=false;
				for (int i=0; i<op.size() && !loyt; i++) {
					if (op[i] == n) loyt=true;
				}
				if (loyt) continue;
				vaihda(i,a,b);
				auto t=f(c+1, op);
				vaihda(i,a,b);
				if (t.size()<m) {
					m=t.size();
					if (m!=INT_MAX) {
						nop = t;
						nop.push_back(n);
					}
				}
			}
		}
	}
	return nop;
}
int main() {
	cin >> n;
	A.resize(n*n);
	B.resize(n*n);
	for (int i=0; i<n*n; i++) cin >> A[i];
	for (int i=0; i<n*n; i++) cin >> B[i];
	vector<oprtn> op;
	auto t = f(0, op);
	if (t.size() == LIMIT) cout << "-1\n";
	else {
		cout << t.size() << "\n";
		for (int i=0; i<t.size(); i++)
			cout << get<0>(t[i]) << " " << get<1>(t[i]) << " " << get<2>(t[i]) << "\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: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED