Arpakuutiot

input/code.cpp: In function 'int main()':
input/code.cpp:143:12: warning: statement has no effect [-Wunused-value]
         cin;
            ^
input/code.cpp:158:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < similar[i].size(); j++) {
                         ~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:112:33: warning: 'face2' may be used uninitialized in this function [-Wmaybe-uninitialized]
             oppositeFace[face2] = face1;
             ~~~~~~~~~~~~~~~~~~~~^~~~~~~
input/code.cpp:98:24: note: 'face2' was declared here
             int face1, face2;
                        ^~~~~
input/code.cpp:112:33: warning: 'face1' may be used uninitialized in this function [-Wmaybe-uninitialized]
             oppositeFace[face2] = face1;
             ~~~~~~~~~~~~~~~~~~~~^~~~~~~
input/code.cpp:98:17: note: 'face1' was declared here
             int face1, face2;
                 ^~~~~
input/code.cpp:95:33: warning: 'face2'...

/**
 * Datatähti 2021 alku
 * Arpakuutiot/Dice
 * @author TRS
 */
//Include
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <list>
#include <queue>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <regex>
//Definitions
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<pii> vpii;
#define pb push_back
#define mp make_pair
#define mt make_tuple
//Constants
#define infinity 0x3f3f3f3f
#define linfinity 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
const int MX = 21;
int n;
vi similar[MX];
char c;
struct dice {
    int net[5][5];
    int oppositeFace[7];
    dice() {}
    dice(int net0[5][5]) {
        memcpy(net, net0, sizeof(net));
    }
    void setNet(int net0[5][5]) {
        memcpy(net, net0, sizeof(net));
    }
    bool has4() {
        bool done = false;
        char direction = '=';
        int startX = 0;
        int startY = 0;
        for (int i = 1; i < 4; i++) {
            for (int j = 0; j < 2; j++) {
                if (net[i][j] != 0 && net[i][j + 1] != 0 && net[i][j + 2] != 0 && net[i][j + 3] != 0) {
                    startX = i;
                    startY = j;
                    direction = 'h';
                    done = true;
                    i = 5;
                    break;
                }
            }
        }
        if (!done) {
            for (int j = 1; j < 4; j++) {
                for (int i = 0; i < 2; i++) {
                    if (net[i][j] != 0 && net[i + 1][j] != 0 && net[i + 2][j] != 0 && net[i + 3][j] != 0) {
                        startX = i;
                        startY = j;
                        direction = 'v';
                        done = true;
                        j = 5;
                        break;
                    }
                }
            }
        }
        if (!done) {
            return false;
        }
        if (direction == 'h') {
            int face1, face2;
            for (int i = startY; i < startY + 4; i++) {
                if (net[startX - 1][i] != 0) {
                    face1 = (int)net[startX - 1][i];
                }
                if (net[startX + 1][i] != 0) {
                    face2 = (int)net[startX + 1][i];
                }
            }
            oppositeFace[net[startX][startY]] = net[startX][startY + 2];
            oppositeFace[net[startX][startY + 1]] = net[startX][startY + 3];
            oppositeFace[net[startX][startY + 2]] = net[startX][startY];
            oppositeFace[net[startX][startY + 3]] = net[startX][startY + 1];
            oppositeFace[face1] = face2;
            oppositeFace[face2] = face1;
        }
        else { //direction == 'v'
            int face1, face2;
            for (int i = startX; i < startX + 4; i++) {
                if (net[i][startY - 1] != 0) {
                    face1 = (int)net[i][startY - 1];
                }
                if (net[i][startY + 1] != 0) {
                    face2 = (int)net[i][startY + 1];
                }
            }
            oppositeFace[net[startX][startY]] = net[startX + 2][startY];
            oppositeFace[net[startX + 1][startY]] = net[startX + 3][startY];
            oppositeFace[net[startX + 2][startY]] = net[startX][startY];
            oppositeFace[net[startX + 3][startY]] = net[startX + 1][startY];
            oppositeFace[face1] = face2;
            oppositeFace[face2] = face1;
        }
        return true;
    }
};
bool arraysAreEqual(int array1[7], int array2[7]) {
    for (int i = 0; i < 7; i++) {
        if (array1[i] != array2[i]) {
            return false;
        }
    }
    return true;
}
dice diceA[MX];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    for (int d = 1; d <= n; d++) {
        int net0[5][5];
        memset(net0, 0, sizeof(net0));
        for (int i = 0; i < 5; i++) {
            for (int j = 0; j < 5; j++) {
                cin>>c;
                if (c != '.') {
                    net0[i][j] = c - 48;
                }
            }
        }
        diceA[d].setNet(net0);
        diceA[d].has4();
        cin;
    }
    for (int i = 1; i < n; i++) {
        for (int j = i + 1; j < n + 1; j++) {
            if (arraysAreEqual(diceA[i].oppositeFace, diceA[j].oppositeFace)) {
                similar[i].pb(j);
                similar[j].pb(i);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        if (similar[i].empty()) {
            cout<<"-\n";
            continue;
        }
        for (int j = 0; j < similar[i].size(); j++) {
            cout<<similar[i].at(j)<<" ";
        }
        cout<<"\n";
    }
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 1, 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: WRONG ANSWER

Test 19

Group: 2

Verdict: WRONG ANSWER

Test 20

Group: 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: WRONG ANSWER

Test 23

Group: 2

Verdict: WRONG ANSWER

Test 24

Group: 2

Verdict: WRONG ANSWER

Test 25

Group: 2

Verdict: WRONG ANSWER

Test 26

Group: 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: WRONG ANSWER

Test 28

Group: 2

Verdict: WRONG ANSWER

Test 29

Group: 2

Verdict: WRONG ANSWER

Test 30

Group: 2

Verdict: WRONG ANSWER

Test 31

Group: 1, 2

Verdict: WRONG ANSWER