Arpakuutiot

input/code.cpp: In function 'int main()':
input/code.cpp:81:12: warning: statement has no effect [-Wunused-value]
         cin;
            ^
input/code.cpp:95:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < similar[i].size(); j++) {
                         ~~^~~~~~~~~~~~~~~~~~~

/**
 * 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] = {0, 0, 0, 0, 0, 0, 0};
    dice() {}
    dice(int net0[5][5]) {
        memcpy(net, net0, sizeof(net));
    }
    void setNet(int net0[5][5]) {
        memcpy(net, net0, sizeof(net));
    }
    void diceFaces() {
        oppositeFace[net[0][0]] = net[0][2];
        oppositeFace[net[0][2]] = net[0][0];
        oppositeFace[net[0][1]] = net[2][1];
        oppositeFace[net[2][1]] = net[0][1];
        oppositeFace[net[1][1]] = net[3][1];
        oppositeFace[net[3][1]] = net[1][1];
    }
};
bool arraysAreEqual(int array1[7], int array2[7]) {
    for (int i = 1; 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].diceFaces();
        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);
            }
        }
    }
    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: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 1, 2

Verdict: WRONG ANSWER

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

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