CSES - Datatähti 2018 loppu - Results
Submission details
Task:Tanssiaiset
Sender:Leiska
Submission time:2018-01-18 17:01:16 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1--1details
#2--1details
#3--1details
#4--1details
#5--1details
#60.93 s2details
#70.72 s2details
#8--2details
#90.90 s2details
#100.90 s2details

Compiler report

input/code.cpp: In function 'void s(int)':
input/code.cpp:34:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(o.size()<len) {
              ^
input/code.cpp: In function 'int main()':
input/code.cpp:78:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i<o1.size(); i++) {
                   ^

Code

#include <bits/stdc++.h>

using namespace std;

int n;
vector<int> a1;
vector<int> a2;
vector<int> arr;
vector<string> o1;
vector<string> o;
int len=1e9;
int depth = 5;

void row(int a, int b) {
	o.push_back("1 " + to_string(a) + " " + to_string(b));
	for(int i=0; i<n; i++) {
		int t = arr[ ((a-1)*n) + i ];
		arr[ ((a-1)*n) + i ] = arr[ ((b-1)*n) + i ];
		arr[ ((b-1)*n) + i ] = t;
	}
}
void column(int a, int b) {
	o.push_back("2 " + to_string(a) + " " + to_string(b));
	for(int i=0; i<n; i++) {
		int t = arr[(i*n)+a-1];
		arr[(i*n)+a-1] = arr[(i*n)+b-1];
		arr[(i*n)+b-1] = t;
	}
}

void s(int d) {
	if(d>depth) return;
	if(arr==a2) {
		if(o.size()<len) {
			len = o.size();
			o1 = o;		
		}
		return;
	}

	
	for(int a = 1; a<n; a++) {
		for(int b=a+1; b<=n; b++) {
			for(int i=0; i<=1; i++) {
				vector<int> t = arr;
				if(i==0)
					row(a,b);
				else
					column(a,b);

				s(d+1);

				arr=t;
				o.pop_back();
			}
		}
	}
}

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	cin >> n;

	for(int i = 0; i<n*n; i++) {
		int t; cin >> t; a1.push_back(t);
	}
	for(int i = 0; i<n*n; i++) {
		int t; cin >> t; a2.push_back(t);
	}

	arr = a1;
	s(0);
	if(o1.size()<=0) cout << -1 << endl;
	else {
		cout << o1.size() << endl;
		for(int i = 0; i<o1.size(); i++) {
			cout << o1[i] << endl;
		}
	}
}

Test details

Test 1

Group: 1

Verdict:

input
100
79 22
53 70
7 23
91 26
...

correct output
75 45

user output
(empty)

Test 2

Group: 1

Verdict:

input
100
71 84
54 25
91 34
98 30
...

correct output
27 49

user output
(empty)

Test 3

Group: 1

Verdict:

input
100
74 68
86 10
83 56
31 87
...

correct output
67 2

user output
(empty)

Test 4

Group: 1

Verdict:

input
100
85 43
95 8
53 1
29 86
...

correct output
54 60

user output
(empty)

Test 5

Group: 1

Verdict:

input
100
71 69
74 45
8 95
12 32
...

correct output
5 7

user output
(empty)

Test 6

Group: 2

Verdict:

input
100000
95086 86958
87818 74731
27185 49356
54360 7043
...

correct output
60551 58365

user output
(empty)

Test 7

Group: 2

Verdict:

input
100000
14011 98742
82421 87350
55194 56454
90097 92904
...

correct output
50997 58566

user output
(empty)

Test 8

Group: 2

Verdict:

input
100000
72139 85248
98125 85461
39422 60426
45770 13451
...

correct output
50397 41760

user output
(empty)

Test 9

Group: 2

Verdict:

input
100000
32124 96365
8819 68067
90795 31927
45745 64571
...

correct output
56735 39394

user output
(empty)

Test 10

Group: 2

Verdict:

input
100000
70709 61209
69548 3671
2215 57335
2539 71294
...

correct output
69366 23793

user output
(empty)