Task: | Arpakuutiot |
Sender: | hltk |
Submission time: | 2020-09-28 03:43:24 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 35 |
#2 | ACCEPTED | 65 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 1, 2 | details |
#3 | ACCEPTED | 0.01 s | 1, 2 | details |
#4 | ACCEPTED | 0.01 s | 1, 2 | details |
#5 | ACCEPTED | 0.01 s | 1, 2 | details |
#6 | ACCEPTED | 0.01 s | 1, 2 | details |
#7 | ACCEPTED | 0.01 s | 1, 2 | details |
#8 | ACCEPTED | 0.01 s | 1, 2 | details |
#9 | ACCEPTED | 0.01 s | 1, 2 | details |
#10 | ACCEPTED | 0.01 s | 1, 2 | details |
#11 | ACCEPTED | 0.01 s | 2 | details |
#12 | ACCEPTED | 0.01 s | 2 | details |
#13 | ACCEPTED | 0.01 s | 2 | details |
#14 | ACCEPTED | 0.01 s | 2 | details |
#15 | ACCEPTED | 0.01 s | 2 | details |
#16 | ACCEPTED | 0.01 s | 2 | details |
#17 | ACCEPTED | 0.01 s | 2 | details |
#18 | ACCEPTED | 0.01 s | 2 | details |
#19 | ACCEPTED | 0.01 s | 2 | details |
#20 | ACCEPTED | 0.01 s | 2 | details |
#21 | ACCEPTED | 0.01 s | 2 | details |
#22 | ACCEPTED | 0.01 s | 2 | details |
#23 | ACCEPTED | 0.01 s | 2 | details |
#24 | ACCEPTED | 0.01 s | 2 | details |
#25 | ACCEPTED | 0.01 s | 2 | details |
#26 | ACCEPTED | 0.01 s | 2 | details |
#27 | ACCEPTED | 0.01 s | 2 | details |
#28 | ACCEPTED | 0.01 s | 2 | details |
#29 | ACCEPTED | 0.01 s | 2 | details |
#30 | ACCEPTED | 0.01 s | 2 | details |
#31 | ACCEPTED | 0.01 s | 1, 2 | details |
Code
#include <bits/stdc++.h>using namespace std;constexpr int N = 5;constexpr int M = 6;constexpr int P = (6 * 6) * (6 * 6) * (6 * 6);using T = array<int, M>;vector<vector<int>> straights {vector<int>{0, 1, 2, 4},vector<int>{1, 3, 4, 5},vector<int>{3, 2, 5, 0},vector<int>{4, 2, 1, 0},vector<int>{5, 4, 3, 1},vector<int>{0, 5, 2, 3}};int t[6][6][2] = {{ // 0{-1, -1},{5, 3},{-1, -1},{1, 4},{3, 5},{4, 1}},{ // 1{3, 5},{-1, -1},{5, 3},{2, 0},{-1, -1},{0, 2}},{ // 2{-1, -1},{3, 5},{-1, -1},{4, 1},{5, 3},{1, 4}},{ // 3{4, 1},{0, 2},{1, 4},{-1, -1},{2, 0},{-1, -1}},{ // 4{5, 3},{-1, -1},{3, 5},{0, 2},{-1, -1},{2, 0}},{ // 5{1, 4},{2, 0},{4, 1},{-1, -1},{0, 2},{-1, -1}}};void rot1(T& w) {int f = w[1];w[1] = w[3];w[3] = w[4];w[4] = w[5];w[5] = f;}void rot2(T& w) {int f = w[5];w[5] = w[2];w[2] = w[3];w[3] = w[0];w[0] = f;}void rot3(T& w) {int f = w[0];w[0] = w[1];w[1] = w[2];w[2] = w[4];w[4] = f;}int get_hash(T k) {int r = 1, s = 0;for (int j = 0; j < 6; ++j, r *= 6)s += r * (k[j] - '0' - 1);return s;}pair<int, int> find_first(vector<string>& grid) {for (int i = 0; i < N; ++i)for (int j = 0; j < N; ++j)if (grid[i][j] != '.')return {i, j};assert(false);}pair<int, int> delta(int ai, int aj, int bi, int bj) {return {bi - ai, bj - aj};}using B = pair<int, int>;B U {-1, 0};B D {1, 0};B L {0, -1};B R {0, 1};void rot(B& a, B& b) {if (a == U) {a = R;if (b == L)b = U;if (b == R)b = D;} else if (a == R) {a = D;if (b == U)b = R;if (b == D)b = L;} else if (a == D) {a = L;if (b == L)b = U;if (b == R)b = D;} else if (a == L) {a = U;if (b == U)b = R;if (b == D)b = L;}}int get_label(B a, B b, int la, int lb) {while (a != U)rot(a, b);assert(b == L || b == R);assert(t[la][lb][b == L ? 0 : 1] != -1);return t[la][lb][b == L ? 0 : 1];}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int n;cin >> n;vector<vector<int>> occ(P);vector<int> p;for (int ind = 0; ind < n; ++ind) {vector<string> grid(N);for (auto& x : grid)cin >> x;vector<vector<int>> label(N, vector<int>(N, -1));{auto [i, j] = find_first(grid);label[i][j] = 0;if (j + 1 < N && grid[i][j + 1] != '.') label[i][j + 1] = 1;else label[i + 1][j] = 1;}while (1) {bool f = true;for (int i = 0; i < N; ++i)for (int j = 0; j < N; ++j)if (grid[i][j] != '.' && label[i][j] == -1)f = false;if (f)break;for (int i = 0; i < N; ++i) {for (int j = 0; j < N; ++j) {if (grid[i][j] == '.')continue;if (label[i][j] != -1)continue;int xi = -1, xj = -1;if (j - 1 >= 0 && label[i][j - 1] != -1) {xi = i;xj = j - 1;} else if (i - 1 >= 0 && label[i - 1][j] != -1) {xi = i - 1;xj = j;} else if (i + 1 < N && label[i + 1][j] != -1) {xi = i + 1;xj = j;} else if (j + 1 < N && label[i][j + 1] != -1) {xi = i;xj = j + 1;}if (xi == -1 && xj == -1)continue;int yi = -1, yj = -1;if (xj - 1 >= 0 && label[xi][xj - 1] != -1 && xj - 1 != j) {yi = xi;yj = xj - 1;} else if (xi - 1 >= 0 && label[xi - 1][xj] != -1 && xi - 1 != i) {yi = xi - 1;yj = xj;} else if (xi + 1 < N && label[xi + 1][xj] != -1 && xi + 1 != i) {yi = xi + 1;yj = xj;} else if (xj + 1 < N && label[xi][xj + 1] != -1 && xj + 1 != j) {yi = xi;yj = xj + 1;}if (yi == -1 && yj == -1)continue;if (delta(i, j, xi, xj) == delta(xi, xj, yi, yj)) {bool f = false;for (auto& u : straights) {if (f)break;for (int k = 0; k < int(u.size()); ++k) {if (label[xi][xj] == u[(k + 1) % u.size()] && label[yi][yj] == u[(k + 2) % u.size()]) {f = true;label[i][j] = u[k];break;}}}assert(f);} else {label[i][j] = get_label(delta(yi, yj, xi, xj), delta(xi, xj, i, j), label[yi][yj], label[xi][xj]);}}}}T w {-1, -1, -1, -1, -1, -1};for (int i = 0; i < N; ++i)for (int j = 0; j < N; ++j)if (label[i][j] != -1)w[label[i][j]] = grid[i][j];assert(!count(w.begin(), w.end(), -1));assert(set<int>(w.begin(), w.end()).size() == w.size());if (w[1] == '1' || w[4] == '1') rot1(w);while (w[3] != '1') rot2(w);while (w[1] != (w[5] == '2' ? '3' : '2')) rot3(w);int x = get_hash(w);p.push_back(x);occ[x].push_back(ind);}for (int i = 0; i < n; ++i) {if (occ[p[i]].size() == 1) {cout << "-\n";} else {for (int j : occ[p[i]])if (i != j)cout << j + 1 << " ";cout << "\n";}}}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
input |
---|
3 165.. .4... .3... .2... ... |
correct output |
---|
3 - 1 |
user output |
---|
3 - 1 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 264.. .5... .3... .1... ... |
correct output |
---|
3 4 5 1 2 5 2 4 |
user output |
---|
3 4 5 1 2 5 2 4 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 152.. .4... .3... .6... ... |
correct output |
---|
3 5 4 1 5 2 1 3 |
user output |
---|
3 5 4 1 5 2 1 3 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 142.. .6... .3... .5... ... |
correct output |
---|
4 5 3 2 1 5 1 4 |
user output |
---|
4 5 3 2 1 5 1 4 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 123.. .4... .6... .5... ... |
correct output |
---|
3 4 5 1 2 5 2 4 |
user output |
---|
3 4 5 1 2 5 2 4 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 213.. .6... .4... .5... ... |
correct output |
---|
4 5 3 2 1 5 1 4 |
user output |
---|
4 5 3 2 1 5 1 4 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 314.. .5... .2... .6... ... |
correct output |
---|
3 4 5 1 2 5 2 4 |
user output |
---|
3 4 5 1 2 5 2 4 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 163.. .2... .5... .4... ... |
correct output |
---|
4 5 3 2 1 5 1 4 |
user output |
---|
4 5 3 2 1 5 1 4 |
Test 9
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 264.. .1... .3... .5... ... |
correct output |
---|
2 3 1 3 1 2 5 4 |
user output |
---|
2 3 1 3 1 2 5 4 |
Test 10
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 214.. .3... .5... .6... ... |
correct output |
---|
5 3 4 2 4 2 3 1 |
user output |
---|
5 3 4 2 4 2 3 1 |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
10 .41.. .5... .2... 36... ... |
correct output |
---|
9 4 6 8 7 10 2 6 8 - ... |
user output |
---|
9 4 6 8 7 10 2 6 8 - ... |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
10 5.... 1436. .2... ..... ... |
correct output |
---|
5 8 6 10 4 7 9 3 7 9 1 8 ... |
user output |
---|
5 8 6 10 4 7 9 3 7 9 1 8 ... |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
10 2.... 41... .63.. .5... ... |
correct output |
---|
4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ... |
user output |
---|
4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ... |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
10 1.... 634.. ..52. ..... ... |
correct output |
---|
2 3 4 5 6 9 10 1 3 4 5 6 9 10 1 2 4 5 6 9 10 1 2 3 5 6 9 10 1 2 3 4 6 9 10 ... |
user output |
---|
2 3 4 5 6 9 10 1 3 4 5 6 9 10 1 2 4 5 6 9 10 1 2 3 5 6 9 10 1 2 3 4 6 9 10 ... Truncated |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
10 .2... 4516. 3.... ..... ... |
correct output |
---|
5 7 9 10 8 4 6 3 6 1 7 9 10 ... |
user output |
---|
5 7 9 10 8 4 6 3 6 1 7 9 10 ... |
Test 16
Group: 2
Verdict: ACCEPTED
input |
---|
10 .56.. .2... .4... 31... ... |
correct output |
---|
4 9 3 5 10 2 5 10 1 9 2 3 10 ... |
user output |
---|
4 9 3 5 10 2 5 10 1 9 2 3 10 ... |
Test 17
Group: 2
Verdict: ACCEPTED
input |
---|
10 ..62. .31.. 45... ..... ... |
correct output |
---|
2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ... |
user output |
---|
2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ... Truncated |
Test 18
Group: 2
Verdict: ACCEPTED
input |
---|
10 532.. .4... .1... .6... ... |
correct output |
---|
3 8 9 5 6 1 8 9 7 10 2 6 ... |
user output |
---|
3 8 9 5 6 1 8 9 7 10 2 6 ... |
Test 19
Group: 2
Verdict: ACCEPTED
input |
---|
10 .64.. .1... .3... 52... ... |
correct output |
---|
2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ... |
user output |
---|
2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ... Truncated |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
10 .4... 326.. .1... .5... ... |
correct output |
---|
4 7 8 6 9 10 5 1 7 8 3 ... |
user output |
---|
4 7 8 6 9 10 5 1 7 8 3 ... |
Test 21
Group: 2
Verdict: ACCEPTED
input |
---|
20 .6... .4... 31... .25.. ... |
correct output |
---|
3 7 11 16 6 1 7 11 16 5 19 4 19 ... |
user output |
---|
3 7 11 16 6 1 7 11 16 5 19 4 19 ... Truncated |
Test 22
Group: 2
Verdict: ACCEPTED
input |
---|
20 3.... 5614. ..2.. ..... ... |
correct output |
---|
7 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ... |
user output |
---|
7 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ... Truncated |
Test 23
Group: 2
Verdict: ACCEPTED
input |
---|
20 42... .316. .5... ..... ... |
correct output |
---|
5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ... |
user output |
---|
5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ... Truncated |
Test 24
Group: 2
Verdict: ACCEPTED
input |
---|
20 ..5.. .623. 41... ..... ... |
correct output |
---|
2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ... |
user output |
---|
2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ... Truncated |
Test 25
Group: 2
Verdict: ACCEPTED
input |
---|
20 .46.. 53... .1... .2... ... |
correct output |
---|
2 3 5 7 15 17 19 1 3 5 7 15 17 19 1 2 5 7 15 17 19 8 10 11 14 1 2 3 7 15 17 19 ... |
user output |
---|
2 3 5 7 15 17 19 1 3 5 7 15 17 19 1 2 5 7 15 17 19 8 10 11 14 1 2 3 7 15 17 19 ... Truncated |
Test 26
Group: 2
Verdict: ACCEPTED
input |
---|
20 .61.. .4... 35... .2... ... |
correct output |
---|
8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ... |
user output |
---|
8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ... Truncated |
Test 27
Group: 2
Verdict: ACCEPTED
input |
---|
20 ..2.. 1463. .5... ..... ... |
correct output |
---|
2 3 5 6 9 20 1 3 5 6 9 20 1 2 5 6 9 20 11 19 1 2 3 6 9 20 ... |
user output |
---|
2 3 5 6 9 20 1 3 5 6 9 20 1 2 5 6 9 20 11 19 1 2 3 6 9 20 ... Truncated |
Test 28
Group: 2
Verdict: ACCEPTED
input |
---|
20 ...4. 5132. 6.... ..... ... |
correct output |
---|
2 8 10 12 13 19 1 8 10 12 13 19 4 5 15 16 17 3 5 15 16 17 3 4 15 16 17 ... |
user output |
---|
2 8 10 12 13 19 1 8 10 12 13 19 4 5 15 16 17 3 5 15 16 17 3 4 15 16 17 ... Truncated |
Test 29
Group: 2
Verdict: ACCEPTED
input |
---|
20 .2... .31.. 45... 6.... ... |
correct output |
---|
5 8 9 14 17 3 10 16 2 10 16 13 15 19 1 8 9 14 17 ... |
user output |
---|
5 8 9 14 17 3 10 16 2 10 16 13 15 19 1 8 9 14 17 ... Truncated |
Test 30
Group: 2
Verdict: ACCEPTED
input |
---|
20 3.... 452.. .1... .6... ... |
correct output |
---|
3 7 8 9 14 15 16 19 4 12 13 17 1 7 8 9 14 15 16 19 2 12 13 17 11 20 ... |
user output |
---|
3 7 8 9 14 15 16 19 4 12 13 17 1 7 8 9 14 15 16 19 2 12 13 17 11 20 ... Truncated |
Test 31
Group: 1, 2
Verdict: ACCEPTED
input |
---|
2 546.. .3... .2... .1... ... |
correct output |
---|
- - |
user output |
---|
- - |