Task: | Arpakuutiot |
Sender: | AtskaFin |
Submission time: | 2020-10-01 15:09:46 +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 |
Compiler report
input/code.cpp: In function 'std::pair<int, int> etsiAloitusPiste(int)': input/code.cpp:34:7: warning: 'shortestX' may be used uninitialized in this function [-Wmaybe-uninitialized] int shortestX; ^~~~~~~~~ input/code.cpp:33:7: warning: 'shortestY' may be used uninitialized in this function [-Wmaybe-uninitialized] int shortestY; ^~~~~~~~~
Code
#include <iostream>#include <vector>#include <algorithm>#include <string>using namespace std;vector<vector<string>> cubes;int pisinPolkuHaku(int cubeIndex, int x, int y, int len) {if (x < 0 || x > 4 ||y < 0 || y > 4 ||cubes[cubeIndex][y][x] == '.') {return len - 1;}int maximum = 0;int tmp = cubes[cubeIndex][y][x];cubes[cubeIndex][y][x] = '.';maximum = max(pisinPolkuHaku(cubeIndex, x+1, y, len+1), maximum);maximum = max(pisinPolkuHaku(cubeIndex, x-1, y, len+1), maximum);maximum = max(pisinPolkuHaku(cubeIndex, x, y+1, len+1), maximum);maximum = max(pisinPolkuHaku(cubeIndex, x, y-1, len+1), maximum);cubes[cubeIndex][y][x] = tmp;return maximum;}pair<int, int> etsiAloitusPiste(int cubeIndex) {int shortest = 6;int shortestY;int shortestX;for (int i = 0; i < 5; i++) {for (int j = 0; j < 5; j++) {if (cubes[cubeIndex][i][j] != '.') {int len = pisinPolkuHaku(cubeIndex, j, i, 0);if (len < shortest) {shortest = len;shortestY = i;shortestX = j;}}}}return make_pair(shortestX, shortestY);}void asetaTposeen(vector<string>& cube, int defX, int defY) {vector<string> newTposeCube = {".....",".....",".....",".....","....."};newTposeCube[0][1] = cube[defY][defX];// Vasemmalleif (defX > 0 && cube[defY][defX - 1] != '.') {newTposeCube[0][0] = cube[defY][defX-1];// Ylösif (defY > 0 && cube[defY - 1][defX - 1] != '.') {newTposeCube[3][1] = cube[defY - 1][defX - 1];}// Vasenif (defX > 1 && cube[defY][defX - 2] != '.') {newTposeCube[2][1] = cube[defY][defX - 2];}// Alasif (defY < 4 && cube[defY + 1][defX - 1] != '.') {newTposeCube[1][1] = cube[defY + 1][defX - 1];}}// Alaspäinif (defY < 4 && cube[defY + 1][defX] != '.') {newTposeCube[1][1] = cube[defY + 1][defX];// Vasenif (defX > 0 && cube[defY + 1][defX - 1] != '.') {newTposeCube[0][0] = cube[defY + 1][defX - 1];}// Alasif (defY < 3 && cube[defY + 2][defX] != '.') {newTposeCube[2][1] = cube[defY + 2][defX];}// Oikeaif (defX < 4 && cube[defY + 1][defX + 1] != '.') {newTposeCube[0][2] = cube[defY + 1][defX + 1];}}// Oikealleif (defX < 4 && cube[defY][defX + 1] != '.') {newTposeCube[0][2] = cube[defY][defX + 1];// Alasif (defY < 4 && cube[defY + 1][defX + 1] != '.') {newTposeCube[1][1] = cube[defY + 1][defX + 1];}// Oikeaif (defX < 3 && cube[defY][defX + 2] != '.') {newTposeCube[2][1] = cube[defY][defX + 2];}// Ylösif (defY > 0 && cube[defY - 1][defX + 1] != '.') {newTposeCube[3][1] = cube[defY - 1][defX + 1];}}// Ylösif (defY > 0 && cube[defY - 1][defX] != '.') {newTposeCube[3][1] = cube[defY - 1][defX];// Vasenif (defX > 0 && cube[defY - 1][defX - 1] != '.') {newTposeCube[0][0] = cube[defY - 1][defX - 1];}// Ylösif (defY > 1 && cube[defY - 2][defX] != '.') {newTposeCube[2][1] = cube[defY - 2][defX];}// Oikeaif (defX < 4 && cube[defY - 1][defX + 1] != '.') {newTposeCube[0][2] = cube[defY - 1][defX + 1];}}// Asetetaan viimeinen puuttuva palaint sum = newTposeCube[0][1] - '0';int puuttuvaY;int puuttuvaX;if (newTposeCube[0][0] != '.') sum += newTposeCube[0][0] - '0';else {puuttuvaY = 0;puuttuvaX = 0;}if (newTposeCube[0][2] != '.') sum += newTposeCube[0][2] - '0';else {puuttuvaY = 0;puuttuvaX = 2;}if (newTposeCube[1][1] != '.') sum += newTposeCube[1][1] - '0';else {puuttuvaY = 1;puuttuvaX = 1;}if (newTposeCube[2][1] != '.') sum += newTposeCube[2][1] - '0';else {puuttuvaY = 2;puuttuvaX = 1;}if (newTposeCube[3][1] != '.') sum += newTposeCube[3][1] - '0';else {puuttuvaY = 3;puuttuvaX = 1;}if (sum < 21) {newTposeCube[puuttuvaY][puuttuvaX] = char(21 - sum + 48);}cube = newTposeCube;}void sortTposeCube(vector<string>& cube) {vector<string> newCube = {"1....",".....",".....",".....","....."};/*Sijoitetaan ykkönen vasempaan yläkulmaanja sijoitetaan muut numerot oikeille paikoilleen*/if (cube[0][0] == '1') {// Ykkönen on jo oikealle paikallanewCube[0][1] = cube[0][1];newCube[0][2] = cube[0][2];newCube[1][1] = cube[1][1];newCube[2][1] = cube[2][1];newCube[3][1] = cube[3][1];} else if (cube[0][1] == '1') {newCube[0][1] = cube[0][0];newCube[0][2] = cube[2][1];newCube[1][1] = cube[3][1];newCube[2][1] = cube[0][2];newCube[3][1] = cube[1][1];} else if (cube[0][2] == '1') {newCube[0][1] = cube[0][1];newCube[0][2] = cube[0][0];newCube[1][1] = cube[3][1];newCube[2][1] = cube[2][1];newCube[3][1] = cube[1][1];} else if (cube[1][1] == '1') {newCube[0][1] = cube[0][1];newCube[0][2] = cube[3][1];newCube[1][1] = cube[0][2];newCube[2][1] = cube[2][1];newCube[3][1] = cube[0][0];} else if (cube[2][1] == '1') {newCube[0][1] = cube[1][1];newCube[0][2] = cube[0][1];newCube[1][1] = cube[0][2];newCube[2][1] = cube[3][1];newCube[3][1] = cube[0][0];} else if (cube[3][1] == '1') {newCube[0][1] = cube[0][1];newCube[0][2] = cube[1][1];newCube[1][1] = cube[0][0];newCube[2][1] = cube[2][1];newCube[3][1] = cube[0][2];}/*Järjestetään keskirivi niin, ettäpienin numero on ylimpänä*/vector<int> midVals = {newCube[0][1] - '0',newCube[1][1] - '0',newCube[2][1] - '0',newCube[3][1] - '0'};int min = *min_element(midVals.begin(), midVals.end());int storage1, storage2;while (newCube[0][1] - '0' != min) {storage1 = newCube[0][1];newCube[0][1] = newCube[3][1];storage2 = newCube[1][1];newCube[1][1] = storage1;storage1 = newCube[2][1];newCube[2][1] = storage2;newCube[3][1] = storage1;}cube = newCube;}int n;vector<string> cubeStrings;string cubeString;vector<vector<int>> matches;int main() {cin >> n;cubes.resize(n);cubeStrings.resize(n);matches.resize(n);for (int i = 0; i < n; i++) {cubes[i].resize(5);for (int j = 0; j < 5; j++) {cin >> cubes[i][j];}}// Asetetaan kaikki kuutiot tposeenfor (int i = 0; i < n; i++) {pair<int, int> p = etsiAloitusPiste(i);asetaTposeen(cubes[i], p.first, p.second);}// Järjestetään tpose -nopat ja luodaan cubestringitfor (int i = 0; i < n; i++) {sortTposeCube(cubes[i]);cubeString = "";for (int j = 0; j < 5; j++) {cubeString += cubes[i][j];}cubeStrings[i] = cubeString;}// etsitään paritfor (int i = 0; i < n; i++) {for (int j = i+1; j < n; j++) {if (cubeStrings[i] == cubeStrings[j]) {matches[i].push_back(j+1);matches[j].push_back(i+1);}}}// Tulostetaan paritfor (int i = 0; i < n; i++) {if (matches[i].size() == 0) {cout << "-" << "\n";} else {for (int match : matches[i]) {cout << match << " ";}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 |
---|
- - |