CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Salama
Submission time:2020-10-03 14:57:30 +0300
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s1, 2details
#10ACCEPTED0.01 s1, 2details
#110.01 s2details
#120.01 s2details
#130.01 s2details
#140.01 s2details
#150.01 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details
#250.01 s2details
#260.01 s2details
#270.01 s2details
#280.01 s2details
#290.01 s2details
#300.01 s2details
#310.01 s1, 2details

Code

#include <iostream>
#include <string>
#include <algorithm>
#include <array>
using namespace std;
bool arraysEqual(int array1[2], int array2[2], int len) {
    sort(array1, array1+len);
    sort(array2, array2+len);
    for (int i = 0; i < len; i++)
        if (array1[i] != array2[i]) return false;
    return true;
}
array<int, 8> getSurroundingSides(string dice, int index, bool diagonal) {
    array<int, 8> result = { 0, 0, 0, 0, 0, 0, 0, 0 };
    if (index % 5 != 0) {//Vasen
        if (dice[index - 1] != '.') result[0] = dice[index - 1] - '0';
        if (index > 4 && diagonal) //Ylä
            if (dice[index - 1 - 5] != '.') result[1] = dice[index - 1 - 5] - '0';
        if (index <= 5 * 5 - 5 && diagonal) //Ala
            if (dice[index - 1 + 5] != '.') result[2] = dice[index - 1 + 5] - '0';
    }
    if (index % 5 != 4) {//Oikea
        if (dice[index + 1] != '.') result[3] = dice[index + 1] - '0';
        if (index > 4 && diagonal) //Ylä
            if (dice[index + 1 - 5] != '.') result[4] = dice[index + 1 - 5] - '0';
        if (index <= 5 * 5 - 5 && diagonal) //Ala
            if (dice[index + 1 + 5] != '.') result[5] = dice[index + 1 + 5] - '0';
    }
    if (index > 4) //Ylä
        if (dice[index - 5] != '.') result[6] = dice[index - 5] - '0';
    if (index <= 5 * 5 - 5) //Ala
        if (dice[index + 5] != '.') result[7] = dice[index + 5] - '0';

    return result;
}
array<int[2], 3> getCombos(string dice, int pos) { //Olettaen etteivät ole vierekkäin
    array<int[2], 3> combos = array<int[2], 3> {};
    int index = 0;
    array<int, 8> side = getSurroundingSides(dice, pos, true);
    //VASEN VASEN-YLÄ VASEN-ALA OIKEA OIKEA-YLÄ OIKEA-ALA YLÄ ALA


    if (side[0] != 0 && side[3] != 0) { //V O
        combos[index][0] = side[0];
        combos[index++][1] = side[3];
    }
    if (side[1] != 0 && side[5] != 0) { //VY OA
        combos[index][0] = side[1];
        combos[index++][1] = side[5];
    }
    if (side[2] != 0 && side[4] != 0) { //VA OY
        combos[index][0] = side[2];
        combos[index++][1] = side[4];
    }
    if (side[6] != 0 && side[7] != 0) { //Y A
        combos[index][0] = side[6];
        combos[index++][1] = side[7];
    }
    
    return combos;
}
int getIndex(string dice, int number) {
    int i = 0;
    while (true) {
        if (dice[i] - '0' == number) return i;
        i++;
    }
}
int main() {
    int diceCount;
    cin >> diceCount;
    string dices[20];
    string dice = "";
    array<int[2], 3> cDices[20];
    string row;
    for (int u = 0; u < diceCount; u++) {
        for (int i = 0; i < 5; i++) {
            cin >> row; dice += row;
        }
        dices[u] = dice;
        dice = "";
    }
    array<int[2], 3> tmp;
    int index;
    for (int y = 0; y < diceCount; y++) {
        index = 0;
        for (int x = 0; x < 6; x++) {
            tmp = getCombos(dices[y], getIndex(dices[y], x + 1));
            for(int i = 0; i < 3; i++)
                if (tmp[i][0] != 0) {
                    cDices[y][index + i][0] = tmp[i][0];
                    cDices[y][index + i][1] = tmp[i][1];
                }
                else { index += i; break; }
        }
    }
    //Nyt on oikeat nopat
    unsigned int results[20][20];
    int match;
    for (int y = 0; y < diceCount; y++) {
        index = 0;
        for (int x = 0; x < diceCount; x++) {
            if (x == y)continue;
            match = 0;
            for (int a = 0; a < 3; a++) {
                for (int b = 0; b < 3; b++) {
                    if (arraysEqual(cDices[y][a], cDices[x][b], 2)) {
                        match++;
                    }
                }
            }
            if (match == 3) {
                results[y][index++] = x + 1;
            }
        }
    }
    for (int i = 0; i < diceCount; i++) {
        index = 0;
        if (results[i][0] > 20) {
            cout << "-\n";
            continue;
        }
        while (results[i][index] <= 20 && results[i][index] != 0) {
            cout << results[i][index++] << " ";
        }
        cout << "\n";
    }
    cout << "\n";
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
3
165..
.4...
.3...
.2...
...

correct output
3
-
1

user output

-

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

4 5 

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 

1 5 

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 


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

4 5 

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 


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

4 5 

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 


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 


...

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

3 4 
2 4 
2 3 

...

Test 11

Group: 2

Verdict:

input
10
.41..
.5...
.2...
36...
...

correct output
9
4 6 8
7 10
2 6 8
-
...

user output
-
-

-
-
...

Test 12

Group: 2

Verdict:

input
10
5....
1436.
.2...
.....
...

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

user output
-
-


-
...

Test 13

Group: 2

Verdict:

input
10
2....
41...
.63..
.5...
...

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

user output
-
-

-
-
...

Test 14

Group: 2

Verdict:

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
10 
-

-
-
...

Test 15

Group: 2

Verdict:

input
10
.2...
4516.
3....
.....
...

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

user output
10 
-

-

...

Test 16

Group: 2

Verdict:

input
10
.56..
.2...
.4...
31...
...

correct output
4 9
3 5 10
2 5 10
1 9
2 3 10
...

user output
-
-

-
-
...

Test 17

Group: 2

Verdict:

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
-
-

-
-
...

Test 18

Group: 2

Verdict:

input
10
532..
.4...
.1...
.6...
...

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

user output

-

-

...

Test 19

Group: 2

Verdict:

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
-
-

-
-
...

Test 20

Group: 2

Verdict:

input
10
.4...
326..
.1...
.5...
...

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

user output

-

-
-
...

Test 21

Group: 2

Verdict:

input
20
.6...
.4...
31...
.25..
...

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

user output
-
-

-
-
...

Test 22

Group: 2

Verdict:

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
17 
-

-
-
...

Test 23

Group: 2

Verdict:

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
15 
-

-
-
...

Test 24

Group: 2

Verdict:

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
-
-

-
-
...

Test 25

Group: 2

Verdict:

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
-
-

-
-
...

Test 26

Group: 2

Verdict:

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 
-

-
-
...

Test 27

Group: 2

Verdict:

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
-
-

-
-
...

Test 28

Group: 2

Verdict:

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
-
-

15 
-
...

Test 29

Group: 2

Verdict:

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
-
-

-
-
...

Test 30

Group: 2

Verdict:

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
15 
-

-
-
...

Test 31

Group: 1, 2

Verdict:

input
2
546..
.3...
.2...
.1...
...

correct output
-
-

user output