— Dark mode

Datatähti 2018 loppu

Vaihdot

  • Start: 2018-01-18 12:15:00
  • End: 2018-01-18 17:15:00
Submission details
Task:Vaihdot
Sender:inv41idu53rn4m3
Submission time:2018-01-18 14:41:48 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.28 s1details
#20.32 s1details
#30.26 s1details
#4ACCEPTED0.05 s1details
#50.28 s1details
#60.32 s2details
#70.27 s2details
#80.26 s2details
#90.26 s2details
#100.28 s2details
#110.48 s3details
#120.49 s3details
#130.47 s3details
#140.47 s3details
#150.55 s3details

Code

#include <iostream>
#include <unordered_map>

using namespace std;

int main() {
    unordered_map<int, pair<int, int>> m;
    int a[500][500], b[500][500];
    int x[500], y[500];
    int s[3][1 << 20];
    int c = 0;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
            if (i == 0) {
                x[j] = a[i][j];
            }
            if (j == 0) {
                y[i] = a[i][j];
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> b[i][j];
            m[b[i][j]] = make_pair(i, j);
        }
    }
    bool w = true;
    while (w) {
        w = false;
        for (int i = 1; i < n; i++) {
            if (m[x[i]].second != i) {
                int a = x[i];
                x[i] = x[m[x[i]].second];
                x[m[x[i]].second] = a;
                s[0][c] = 2;
                s[1][c] = i;
                s[2][c++] = m[x[i]].second;
                w = true;
            }
        }
    }
    w = true;
    while (w) {
        w = false;
        for (int i = 1; i < n; i++) {
            if (m[y[i]].first != i) {
                int a = y[i];
                y[i] = y[m[y[i]].first];
                y[m[y[i]].first] = a;
                s[0][c] = 1;
                s[1][c] = i;
                s[2][c++] = m[y[i]].first;
                w = true;
            }
        }
    }
    cout << c << "\n";
    for (int i = 0; i < c; i++) {
        cout << s[0] << " " << s[1] << " " << s[2] << "\n";
    }
}

Test details

Test 1

Group: 1

Verdict:

input
3
2 1 7
4 3 6
8 9 5
1 7 2
...
view save

correct output
2
2 1 3
2 1 2
view save

user output
(empty)

Test 2

Group: 1

Verdict:

input
3
3 7 2
1 5 6
4 8 9
7 3 2
...
view save

correct output
2
1 2 3
2 1 2
view save

user output
(empty)

Test 3

Group: 1

Verdict:

input
3
3 7 8
4 5 1
6 9 2
3 8 7
...
view save

correct output
1
2 2 3
view save

user output
(empty)

Test 4

Group: 1

Verdict: ACCEPTED

input
3
3 1 8
5 2 6
9 4 7
3 1 8
...
view save

correct output
0
view save

user output
0
view save

Test 5

Group: 1

Verdict:

input
3
6 5 8
1 2 4
3 7 9
7 9 3
...
view save

correct output
-1
view save

user output
(empty)

Test 6

Group: 2

Verdict:

input
50
2080 2133 335 2071 1666 1889 4...
view save

correct output
89
1 1 27
1 1 47
1 1 32
1 1 2
...
view save

user output
(empty)

Test 7

Group: 2

Verdict:

input
50
59 2140 2044 1095 520 1562 153...
view save

correct output
88
1 1 29
1 1 47
1 1 3
1 1 26
...
view save

user output
(empty)

Test 8

Group: 2

Verdict:

input
50
1015 2205 747 1628 2184 61 189...
view save

correct output
94
1 1 17
1 1 30
1 1 15
1 1 3
...
view save

user output
(empty)

Test 9

Group: 2

Verdict:

input
50
1936 637 1930 1825 1375 688 23...
view save

correct output
88
1 1 45
1 1 34
1 1 26
1 1 21
...
view save

user output
(empty)

Test 10

Group: 2

Verdict:

input
50
367 944 222 1047 2163 113 1076...
view save

correct output
-1
view save

user output
(empty)

Test 11

Group: 3

Verdict:

input
500
125877 110081 73003 167540 184...
view save

correct output
986
1 1 222
1 1 325
1 1 203
1 1 73
...
view save

user output
(empty)

Test 12

Group: 3

Verdict:

input
500
98396 218927 201855 126130 103...
view save

correct output
983
1 1 80
1 1 125
1 1 242
1 1 85
...
view save

user output
(empty)

Test 13

Group: 3

Verdict:

input
500
54508 62242 106667 218403 5323...
view save

correct output
985
1 1 356
1 1 88
1 1 142
1 1 321
...
view save

user output
(empty)

Test 14

Group: 3

Verdict:

input
500
108478 62895 206775 78592 2247...
view save

correct output
986
1 1 182
1 1 253
1 1 365
1 1 413
...
view save

user output
(empty)

Test 15

Group: 3

Verdict:

input
500
96354 155542 19613 222634 1530...
view save

correct output
-1
view save

user output
(empty)

Tasks

A Tanssiaiset-B Merkkijono-C Tietoverkko-D Vaihdot-E Metsämetro-F Pinopeli-G Alue 50-

Submissions (inv41idu53rn4m3)

2018-01-18 14:41:48 0