CSES - Datatähti 2021 alku

Submission details
Task:	Arpakuutiot
Sender:	T
Submission time:	2020-10-10 21:31:30 +0300
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	35
#2	ACCEPTED	65

Test results
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 'int main()':
input/code.cpp:219:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~

Code

/**
 * Datat�hti 2021 alku
 * Arpakuutiot/Dice
 * @author TRS
 */
//Include
#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <utility>
#include <list>
#include <queue>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <regex>
#include <iterator>
//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 dice[MX][5][5];
int Answer[MX][MX];
int n;
int checkDice(int a1[4], int a2[4]) {
    if (a1[0] == a2[0] && a1[1] == a2[1] && a1[2] == a2[2] && a1[3] == a2[3]) {
        return 1;
    }
    if (a1[0] == a2[1] && a1[1] == a2[2] && a1[2] == a2[3] && a1[3] == a2[0]) {
        return 1;
    }
    if (a1[0] == a2[2] && a1[1] == a2[3] && a1[2] == a2[0] && a1[3] == a2[1]) {
        return 1;
    }
    if (a1[0] == a2[3] && a1[1] == a2[0] && a1[2] == a2[1] && a1[3] == a2[2]) {
        return 1;
    }
    return 0;
}
int result(int dice1[][5], int dice2[][5]) {
    int d1[7] = {0, dice1[0][0], dice1[0][1], dice1[0][2], dice1[1][1], dice1[2][1], dice1[3][1]};
    int d2[7] = {0, dice2[0][0], dice2[0][1], dice2[0][2], dice2[1][1], dice2[2][1], dice2[3][1]};
    int d2side[] = {d2[2], d2[4], d2[5], d2[6]};
    if (d1[1] == d2[1]) {
        if (d1[3] != d2[3]) {
            return 0;
        }
        int d1side[] = {d1[2], d1[4], d1[5], d1[6]};
        return checkDice(d1side, d2side);
    }
    if (d1[2] == d2[1]) {
        if (d1[5] != d2[3]) {
            return 0;
        }
        int d1side[] = {d1[1], d1[6], d1[3], d1[4]};
        return checkDice(d1side, d2side);
    }
    if (d1[3] == d2[1]) {
        if (d1[1] != d2[3]) {
            return 0;
        }
        int d1side[] = {d1[2], d1[6], d1[5], d1[4]};
        return checkDice(d1side, d2side);
    }
    if (d1[4] == d2[1]) {
        if (d1[6] != d2[3]) {
            return 0;
        }
        int d1side[] = {d1[1], d1[2], d1[3], d1[5]};
        return checkDice(d1side, d2side);
    }
    if (d1[5] == d2[1]) {
        if (d1[2] != d2[3]) {
            return 0;
        }
        int d1side[] = {d1[1], d1[4], d1[3], d1[6]};
        return checkDice(d1side, d2side);
    }
    if (d1[6] == d2[1]) {
        if (d1[4] != d2[3]) {
            return 0;
        }
        int d1side[] = {d1[1], d1[5], d1[3], d1[2]};
        return checkDice(d1side, d2side);
    }
    return 0;
}
void convertDice(int d[5][5]) {
    int d0[5][5];
    int minRow = 5, minColumn = 5, maxRow = 0, maxColumn = 0;
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            d0[i][j] = 0;
            if (d[i][j] != 0) {
                if (i < minRow) {
                    minRow = i;
                }
                if (i > maxRow) {
                    maxRow = i;
                }
                if (j < minColumn) {
                    minColumn = j;
                }
                if (j > maxColumn) {
                    maxColumn = j;
                }
            }
        }
    }
    if (maxColumn - minColumn == 1) {
        if (d[0][minColumn] != 0) {
            if (minColumn <= 2) {
                d[2][maxColumn + 1] = d[0][minColumn];
                d[0][minColumn] = 0;
                minRow++;
                maxColumn++;
            }
            else {
                d[2][minColumn - 1] = d[4][maxColumn];
                d[4][maxColumn] = 0;
                maxRow--;
                minColumn--;
            }
        }
        else {
            if (minColumn <= 2) {
                d[2][maxColumn + 1] = d[4][minColumn];
                d[4][minColumn] = 0;
                maxRow--;
                maxColumn++;
            }
            else {
                d[2][minColumn - 1] = d[0][maxColumn];
                d[0][maxColumn] = 0;
                minRow++;
                minColumn--;
            }
        }
    }
    if (maxRow - minRow == 1) {
        if (d[minRow][0] != 0) {
            if (minRow <= 2) {
                d[maxRow + 1][2] = d[minRow][0];
                d[minRow][0] = 0;
                maxRow++;
                minColumn++;
            }
            else {
                d[minRow - 1][2] = d[maxRow][4];
                d[maxRow][4] = 0;
                minRow--;
                maxColumn--;
            }
        }
        else {
            if (minRow <= 2) {
                d[maxRow + 1][2] = d[minRow][4];
                d[minRow][4] = 0;
                maxRow++;
                maxColumn--;
            }
            else {
                d[minRow - 1][2] = d[maxRow][0];
                d[maxRow][0] = 0;
                minRow--;
                minColumn++;
            }
        }
    }
    if (maxRow - minRow < maxColumn - minColumn) {
        for (int i = minRow; i <= maxRow; i++) {
            for (int j = minColumn; j <= maxColumn; j++) {
                d0[j - minColumn][2 - i + minRow] = d[i][j];
            }
        }
    }
    else {
        for (int i = minRow; i <= maxRow; i++) {
            for (int j = minColumn; j <= maxColumn; j++) {
                d0[i - minRow][j - minColumn] = d[i][j];
            }
        }
    }
    for (int i = 0; i < 4; i++) {
        if (d0[i][1] == 0) {
            d0[i][1] = d0[i][0] + d0[i][2];
            d0[i][0] = d0[i][2] = 0;
        }
    }
    for (int j = 0; j < 3; j++) {
        if (d0[0][j] == 0) {
            d0[0][j] = d0[1][j] + d0[2][j] + d0[3][j];
            d0[1][j] = d0[2][j] = d0[3][j] = 0;
        }
    }
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            d[i][j] = d0[i][j];
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    scanf("%d", &n);
    getchar();
    char c;
    for (int i = 0; i < n; i++) {
        Answer[i][i] = 0;
        for (int j = 0; j < 5; j++) {
            for (int k = 0; k < 5; k++) {
                dice[i][j][k] = 0;
                c = getchar();
                if (c < '7' && c > '0') {
                    dice[i][j][k] = c - '0';
                }
            }
            getchar();
        }
        convertDice(dice[i]);
        getchar();
    }

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            Answer[i][j] = result(dice[i], dice[j]);
            Answer[j][i] = Answer[i][j];
        }

        int similar = 0;
        for (int j = 0; j < n; j++) {
            if (Answer[i][j]) {
                if (similar) {
                    cout<<" ";
                }
                cout<<(j + 1);
                similar = 1;
            }
        }
        if (!similar) {
            cout<<"-";
        }
        cout<<"\n";
    }
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`3 165.. .4... .3... .2... ...` view save

correct output
`3 - 1` view save

user output
`3 - 1` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 264.. .5... .3... .1... ...` view save

correct output
`3 4 5 1 2 5 2 4` view save

user output
`3 4 5 1 2 5 2 4` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`5 152.. .4... .3... .6... ...` view save

correct output
`3 5 4 1 5 2 1 3` view save

user output
`3 5 4 1 5 2 1 3` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 142.. .6... .3... .5... ...` view save

correct output
`4 5 3 2 1 5 1 4` view save

user output
`4 5 3 2 1 5 1 4` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 123.. .4... .6... .5... ...` view save

correct output
`3 4 5 1 2 5 2 4` view save

user output
`3 4 5 1 2 5 2 4` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`5 213.. .6... .4... .5... ...` view save

correct output
`4 5 3 2 1 5 1 4` view save

user output
`4 5 3 2 1 5 1 4` view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
`5 314.. .5... .2... .6... ...` view save

correct output
`3 4 5 1 2 5 2 4` view save

user output
`3 4 5 1 2 5 2 4` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`5 163.. .2... .5... .4... ...` view save

correct output
`4 5 3 2 1 5 1 4` view save

user output
`4 5 3 2 1 5 1 4` view save

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
`5 264.. .1... .3... .5... ...` view save

correct output
`2 3 1 3 1 2 5 4` view save

user output
`2 3 1 3 1 2 5 4` view save

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`5 214.. .3... .5... .6... ...` view save

correct output
`5 3 4 2 4 2 3 1` view save

user output
`5 3 4 2 4 2 3 1` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`10 .41.. .5... .2... 36... ...` view save

correct output
`9 4 6 8 7 10 2 6 8 - ...` view save

user output
`9 4 6 8 7 10 2 6 8 - ...` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`10 5.... 1436. .2... ..... ...` view save

correct output
`5 8 6 10 4 7 9 3 7 9 1 8 ...` view save

user output
`5 8 6 10 4 7 9 3 7 9 1 8 ...` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`10 2.... 41... .63.. .5... ...` view save

correct output
`4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ...` view save

user output
`4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ...` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`10 1.... 634.. ..52. ..... ...` view save

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 ...` view save

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.... ..... ...` view save

correct output
`5 7 9 10 8 4 6 3 6 1 7 9 10 ...` view save

user output
`5 7 9 10 8 4 6 3 6 1 7 9 10 ...` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`10 .56.. .2... .4... 31... ...` view save

correct output
`4 9 3 5 10 2 5 10 1 9 2 3 10 ...` view save

user output
`4 9 3 5 10 2 5 10 1 9 2 3 10 ...` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`10 ..62. .31.. 45... ..... ...` view save

correct output
`2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ...` view save

user output
`2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ...` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`10 532.. .4... .1... .6... ...` view save

correct output
`3 8 9 5 6 1 8 9 7 10 2 6 ...` view save

user output
`3 8 9 5 6 1 8 9 7 10 2 6 ...` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`10 .64.. .1... .3... 52... ...` view save

correct output
`2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ...` view save

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... ...` view save

correct output
`4 7 8 6 9 10 5 1 7 8 3 ...` view save

user output
`4 7 8 6 9 10 5 1 7 8 3 ...` view save

Test 21

Group: 2

Verdict: ACCEPTED

input
`20 .6... .4... 31... .25.. ...` view save

correct output
`3 7 11 16 6 1 7 11 16 5 19 4 19 ...` view save

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.. ..... ...` view save

correct output
`7 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ...` view save

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... ..... ...` view save

correct output
`5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ...` view save

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... ..... ...` view save

correct output
`2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ...` view save

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... ...` view save

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 ...` view save

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... ...` view save

correct output
`8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ...` view save

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... ..... ...` view save

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 ...` view save

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.... ..... ...` view save

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 ...` view save

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.... ...` view save

correct output
`5 8 9 14 17 3 10 16 2 10 16 13 15 19 1 8 9 14 17 ...` view save

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... ...` view save

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 ...` view save

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... ...` view save

correct output
`- -` view save

user output
`- -` view save

Datatähti 2021 alku

Arpakuutiot

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (T)