CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Lentsu
Submission time:2020-10-11 15:28:11 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s1, 2details
#30.01 s1, 2details
#40.01 s1, 2details
#50.01 s1, 2details
#60.01 s1, 2details
#70.01 s1, 2details
#80.01 s1, 2details
#90.01 s1, 2details
#100.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
#31ACCEPTED0.01 s1, 2details

Code

#include <iostream>
struct cube {
int data[5][5];
bool operator==(const cube& rhs) {
//Important: copy value !!!
cube target = rhs;
bool c_eq_t;
//Rotate x and y untill cubes match or end of rotations
for (int x_rots = 0; x_rots != 3; ++x_rots) {
for (int y_rots = 0; y_rots != 4; ++y_rots) {
//rotate target in y-axis
target.rotate_y();
//true until proven false
c_eq_t = true;
for (int y = 0; y != 3; ++y)
for (int x = 0; x != 2; ++x)
if (data[x][y] != target.data[x][y])
c_eq_t = false;
if (c_eq_t)
return true;
}
target.rotate_x();
}
return false;
}
void rotate_x() {
//local temporaries
int temp1, temp2;
temp2 = data[1][0];
data[1][0] = data[0][0];
temp1 = data[2][0];
data[2][0] = temp2;
temp2 = data[1][2];
data[1][2] = temp1;
data[0][0] = temp2;
}
void rotate_y() {
//local temporaries
int temp1, temp2;
//for clearance
int x = 1;
temp1 = data[x][0];
data[x][0] = data[x][3];
temp2 = data[x][1];
data[x][1] = temp1;
temp1 = data[x][2];
data[x][2] = temp2;
data[x][3] = temp1;
}
};
void reform(cube& cube) {
}
int main() {
int n;
std::cin >> n;
cube cubes[n];
char c;
//Read input into cubes
for (int i = 0; i != n; ++i) {
for (int y = 0; y != 5; ++y) {
for (int x = 0; x != 5; ++x) {
//Get character input
std::cin >> c;
if (c != '.')
//turn into int for 0-9
cubes[i].data[x][y] = (int)c - '0'; // no need for c++11 lol
else
cubes[i].data[x][y] = 0;
}
}
}
// One past the last element in cubes
cube* cubes_end = cubes + n;
// Reform all cubes to:
// xxx..
// .x...
// .x...
// .x...
// .....
for (cube* it = cubes; it != cubes_end; ++it)
reform(*it);
//Cout an empty line
//std::cout << std::endl;
//List of lists of similiar cubes for all except the last cube
bool list[n][n-1];
// Initialize the list of identical cubes
for (int i = n - 2; i != -1; --i)
for (int j = n - 1; j != -1; --j)
if (i != j) {
if (cubes[i] == cubes[j]) { list[j][i] = true; }
else { list[j][i] = false; }
} else { list[j][i] = false; }
bool printed_smthn;
// COUT result
//
// Edge case: if nth cube doesn't equal to anything
bool edge = true;
for (int e = n - 2; e != -1; --e)
if (cubes[n-1] == cubes[e])
edge = false;
if (edge)
std::cout << "-" << std::endl;
// The rest of the cubes
for (int i = n - 2; i != -1; --i) {
//set bool printed something to false
printed_smthn = false;
for (int j = n - 1; j != -1; --j) {
if (list[j][i]) {
if (j > i) {
std::cout << i+1 << " " << j+1 << std::endl;
//printed something !
printed_smthn = true;
} else {
//we will print something later
printed_smthn = true;
}
}
}
if (!printed_smthn)
std::cout << "-" << std::endl;
}
return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

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

correct output
3
-
1

user output
-
-
1 3

Test 2

Group: 1, 2

Verdict:

input
5
264..
.5...
.3...
.1...
...

correct output
3
4 5
1
2 5
2 4

user output
-
3 5
2 4
1 3

Test 3

Group: 1, 2

Verdict:

input
5
152..
.4...
.3...
.6...
...

correct output
3 5
4
1 5
2
1 3

user output
-
-
1 3

Test 4

Group: 1, 2

Verdict:

input
5
142..
.6...
.3...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output
4 5
-
-

Test 5

Group: 1, 2

Verdict:

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:

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:

input
5
314..
.5...
.2...
.6...
...

correct output
3
4 5
1
2 5
2 4

user output
4 5
-
1 3
1 2

Test 8

Group: 1, 2

Verdict:

input
5
163..
.2...
.5...
.4...
...

correct output
4 5
3
2
1 5
1 4

user output
-
2 3
1 4

Test 9

Group: 1, 2

Verdict:

input
5
264..
.1...
.3...
.5...
...

correct output
2 3
1 3
1 2
5
4

user output
-
-
1 3

Test 10

Group: 1, 2

Verdict:

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

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

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
-
-
8 9
-
-
...

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

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

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

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

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

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

Test 31

Group: 1, 2

Verdict: ACCEPTED

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

correct output
-
-

user output
-
-