Arpakuutiot

input/code.cpp: In function 'bool areEqualVPII(vpii, vpii)':
input/code.cpp:94:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1.size(); i++) {
                     ~~^~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:149: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;
string answer;
struct dice {
    int net[5][5];
    vpii oppositeFace;
    int side4[12][4];
    dice() {}
    void setNet(int net0[5][5]) {
        memcpy(net, net0, sizeof(net));
    }
    void diceFaces() {
        oppositeFace.pb(mp(min(net[0][0], net[0][2]), max(net[0][0], net[0][2])));
        oppositeFace.pb(mp(min(net[0][1], net[2][1]), max(net[0][1], net[2][1])));
        oppositeFace.pb(mp(min(net[1][1], net[3][1]), max(net[1][1], net[3][1])));
        sort(oppositeFace.begin(), oppositeFace.end(),
             [](pii a, pii b) {
             if (a.first == b.first) {
                return a.second > b.second;
             }
             return a.first > b.first;
            });
        int side4a[4] = {net[0][1], net[1][1], net[2][1], net[3][1]};
        int side4b[4] = {net[0][0], net[0][1], net[0][2], net[2][1]};
        int side4c[4] = {net[0][1], net[1][1], net[0][2], net[3][1]};
        memcpy(side4[0], side4a, sizeof(side4));
        memcpy(side4[1], side4b, sizeof(side4));
        memcpy(side4[3], side4c, sizeof(side4));
        int temporarySide4a[4];
        int temporarySide4b[4];
        int temporarySide4c[4];
        int side4Index = 3;
        int index;
        for (int cycle = 1; cycle <= 4; cycle++) {
            index = 0;
            for (int i = cycle; i < 4; i++) {
                temporarySide4a[index] = side4a[i];
                temporarySide4b[index] = side4b[i];
                temporarySide4c[index] = side4c[i];
                index++;
            }
            for (int i = 0; i < cycle; i++) {
                temporarySide4a[index] = side4a[i];
                temporarySide4b[index] = side4b[i];
                temporarySide4c[index] = side4c[i];
                index++;
            }
            for (int i = 0; i < 4; i++) {
                side4[side4Index][i] = temporarySide4a[i];
                side4[side4Index + 1][i] = temporarySide4b[i];
                side4[side4Index + 2][i] = temporarySide4c[i];
            }
            side4Index += 3;
        }
    }
};
bool areEqualVPII(vpii v1, vpii v2) {
    if (v1.size() != v2.size()) {
        return false;
    }
    for (int i = 0; i < v1.size(); i++) {
        if (v1.at(i).first != v2.at(i).first || v1.at(i).second != v2.at(i).second) {
            return false;
        }
    }
    return true;
}
bool areEqualSide4(int a1[12][4], int a2[12][4]) {
    int cnt = 0;
    for (int i = 0; i < 12; i++) {
        for (int j = 0; j < 12; j++) {
            if (a1[i][0] == a2[j][0] && a1[i][1] == a2[j][1] && a1[i][2] == a2[j][2] && a1[i][3] == a2[j][3]) {
                cnt++;
                break;
            }
            if (a1[i][0] == a2[j][3] && a1[i][1] == a2[j][2] && a1[i][2] == a2[j][1] && a1[i][3] == a2[j][0]) {
                cnt++;
                break;
            }
        }
    }
    return (cnt == 12 ? true : false);
}
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();
    }
    for (int i = 1; i < n; i++) {
        for (int j = i + 1; j < n + 1; j++) {
            if (areEqualVPII(diceA[i].oppositeFace, diceA[j].oppositeFace) && areEqualSide4(diceA[i].side4, diceA[j].side4)) {
                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: 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: RUNTIME ERROR

Test 22

Group: 2

Verdict: RUNTIME ERROR

Test 23

Group: 2

Verdict: RUNTIME ERROR

Test 24

Group: 2

Verdict: RUNTIME ERROR

Test 25

Group: 2

Verdict: RUNTIME ERROR

Test 26

Group: 2

Verdict: RUNTIME ERROR

Test 27

Group: 2

Verdict: RUNTIME ERROR

Test 28

Group: 2

Verdict: RUNTIME ERROR

Test 29

Group: 2

Verdict: RUNTIME ERROR

Test 30

Group: 2

Verdict: RUNTIME ERROR

Test 31

Group: 1, 2

Verdict: ACCEPTED