| Task: | Vaihdot |
| Sender: | FSMnArmosta |
| Submission time: | 2018-01-18 17:09:07 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | 1 | details |
| #2 | WRONG ANSWER | 0.05 s | 1 | details |
| #3 | WRONG ANSWER | 0.03 s | 1 | details |
| #4 | WRONG ANSWER | 0.03 s | 1 | details |
| #5 | ACCEPTED | 0.03 s | 1 | details |
| #6 | WRONG ANSWER | 0.04 s | 2 | details |
| #7 | WRONG ANSWER | 0.04 s | 2 | details |
| #8 | WRONG ANSWER | 0.05 s | 2 | details |
| #9 | WRONG ANSWER | 0.04 s | 2 | details |
| #10 | ACCEPTED | 0.04 s | 2 | details |
| #11 | WRONG ANSWER | 0.24 s | 3 | details |
| #12 | WRONG ANSWER | 0.23 s | 3 | details |
| #13 | WRONG ANSWER | 0.23 s | 3 | details |
| #14 | WRONG ANSWER | 0.23 s | 3 | details |
| #15 | ACCEPTED | 0.23 s | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
int n;
int a[250000];
int b[250000];
vector<pair<int, int> > sortT(int arr[]){
vector<pair<int, int> > result;
bool done = false;
while(!done){
done = true;
for(int i = 0; i < n; i++){
if(arr[i] != i){
int t = arr[i];
arr[i] = arr[t];
arr[t] = t;
result.push_back({t, i});
done = false;
}
}
}
return result;
}
int main(){
cin >> n;
int t;
for(int y = 0; y < n; y++){
for(int x = 0; x < n; x++){
cin >> t;
a[y*n + x] = t-1;
}
}
for(int y = 0; y < n; y++){
for(int x = 0; x < n; x++){
cin >> t;
b[y*n + x] = t-1;
}
}
for(int y = 0; y < n; y++){
for(int x = 0; x < n; x++){
a[y*n + x] = b[a[y*n + x]];
}
}
// Sanity check
for(int y = 0; y < n; y++){
int r = (a[y*n] / n)*n;
for(int x = 0; x < n; x++){
if(a[y*n+x]/n != r/n){
cout << "-1" << endl;
return 0;
}
}
}
for(int x = 0; x < n; x++){
int r = a[x] % n;
for(int y = 0; y < n; y++){
if(a[y*n+x]%n != r){
cout << "-1" << endl;
return 0;
}
}
}
int d1[n];
for(int i = 0; i < n; i++){
d1[i] = a[i];
}
int d2[n];
for(int i = 0; i < n; i++){
d2[i] = a[i*n]/n;
}
vector<pair<int, int> > f1 = sortT(d1);
vector<pair<int, int> > f2 = sortT(d2);
cout << f1.size() + f2.size() << endl;
for(pair<int, int> k : f1){
cout << 2 << " " << k.first+1 << " " << k.second+1 << endl;
}
for(pair<int, int> k : f2){
cout << 1 << " " << k.first+1 << " " << k.second+1 << endl;
}
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 3 2 1 7 4 3 6 8 9 5 1 7 2 ... |
| correct output |
|---|
| 2 2 1 3 2 1 2 |
| user output |
|---|
| -1 |
Test 2
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 3 3 7 2 1 5 6 4 8 9 7 3 2 ... |
| correct output |
|---|
| 2 1 2 3 2 1 2 |
| user output |
|---|
| -1 |
Test 3
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 3 3 7 8 4 5 1 6 9 2 3 8 7 ... |
| correct output |
|---|
| 1 2 2 3 |
| user output |
|---|
| -1 |
Test 4
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 3 3 1 8 5 2 6 9 4 7 3 1 8 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -1 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 3 6 5 8 1 2 4 3 7 9 7 9 3 ... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 6
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 50 2080 2133 335 2071 1666 1889 4... |
| correct output |
|---|
| 89 1 1 27 1 1 47 1 1 32 1 1 2 ... |
| user output |
|---|
| -1 |
Test 7
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 50 59 2140 2044 1095 520 1562 153... |
| correct output |
|---|
| 88 1 1 29 1 1 47 1 1 3 1 1 26 ... |
| user output |
|---|
| -1 |
Test 8
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 50 1015 2205 747 1628 2184 61 189... |
| correct output |
|---|
| 94 1 1 17 1 1 30 1 1 15 1 1 3 ... |
| user output |
|---|
| -1 |
Test 9
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 50 1936 637 1930 1825 1375 688 23... |
| correct output |
|---|
| 88 1 1 45 1 1 34 1 1 26 1 1 21 ... |
| user output |
|---|
| -1 |
Test 10
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 50 367 944 222 1047 2163 113 1076... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 11
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 500 125877 110081 73003 167540 184... |
| correct output |
|---|
| 986 1 1 222 1 1 325 1 1 203 1 1 73 ... |
| user output |
|---|
| -1 |
Test 12
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 500 98396 218927 201855 126130 103... |
| correct output |
|---|
| 983 1 1 80 1 1 125 1 1 242 1 1 85 ... |
| user output |
|---|
| -1 |
Test 13
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 500 54508 62242 106667 218403 5323... |
| correct output |
|---|
| 985 1 1 356 1 1 88 1 1 142 1 1 321 ... |
| user output |
|---|
| -1 |
Test 14
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 500 108478 62895 206775 78592 2247... |
| correct output |
|---|
| 986 1 1 182 1 1 253 1 1 365 1 1 413 ... |
| user output |
|---|
| -1 |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 96354 155542 19613 222634 1530... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |