— Dark mode

Datatähti 2021 alku

Arpakuutiot

  • Start: 2020-09-28 00:00:00
  • End: 2020-10-12 00:00:00
CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Nanohenry
Submission time:2020-09-29 13:53:52 +0300
Language:C++11
Status:READY
Result:35
Feedback
groupverdictscore
#1ACCEPTED35
#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
#31ACCEPTED0.01 s1, 2details

Code

#include <iostream>

using namespace std;

#define Y 0
#define A 1
#define V 2
#define O 3
#define E 4
#define T 5

const char dirs[] = "YAVOET";

#define OP(d) ((d) ^ 1)

#define P(n, x, y) d[(n) * 5 + (y)][x]

typedef long long ll;

ll n, i, j, l[7], o[7], s[7], v[7], e, p, tp, c[20][6], m;

bool sf;

string d[20 * 5];

int main() {
	cin >> n;
	for (; i < n * 5; i++) {
		cin >> d[i];
		//cout << d[i] << endl;
	}
	for (i = 0; i < n; i++) {
		l[E] = P(i, 1, 0) - '1' + 1;
		l[A] = P(i, 1, 1) - '1' + 1;
		l[T] = P(i, 1, 2) - '1' + 1;
		l[Y] = P(i, 1, 3) - '1' + 1;
		l[V] = P(i, 0, 0) - '1' + 1;
		l[O] = P(i, 2, 0) - '1' + 1;

		s[l[E]] = E;
		s[l[T]] = T;
		s[l[O]] = O;
		s[l[V]] = V;
		s[l[Y]] = Y;
		s[l[A]] = A;

		switch (s[1]) {
			case V:
				v[E] = l[V];
				v[O] = l[E];
				v[T] = l[O];
				v[V] = l[T];

				v[Y] = l[Y];
				v[A] = l[A];
				break;
			case O:
				v[E] = l[O];
				v[O] = l[T];
				v[T] = l[V];
				v[V] = l[E];

				v[Y] = l[Y];
				v[A] = l[A];
				break;
			case A:
				v[E] = l[A];
				v[A] = l[T];
				v[T] = l[Y];
				v[Y] = l[E];

				v[O] = l[O];
				v[V] = l[V];
				break;
			case Y:
				v[E] = l[Y];
				v[A] = l[E];
				v[T] = l[A];
				v[Y] = l[T];

				v[O] = l[O];
				v[V] = l[V];
				break;
			case T:
				v[E] = l[T];
				v[O] = l[V];
				v[V] = l[O];
				v[T] = l[E];

				v[Y] = l[Y];
				v[A] = l[A];
				break;
			case E:
				v[E] = l[E];
				v[O] = l[O];
				v[V] = l[V];
				v[T] = l[T];

				v[Y] = l[Y];
				v[A] = l[A];
				break;
		}

		for (j = 0; j < 6; j++) {
			l[j] = v[j];
		}

		s[l[E]] = E;
		s[l[T]] = T;
		s[l[O]] = O;
		s[l[V]] = V;
		s[l[Y]] = Y;
		s[l[A]] = A;

		o[l[E]] = l[OP(E)];
		o[l[T]] = l[OP(T)];
		o[l[O]] = l[OP(O)];
		o[l[V]] = l[OP(V)];
		o[l[Y]] = l[OP(Y)];
		o[l[A]] = l[OP(A)];

		for (j = 1; j <= 6; j++) {
			c[i][j] = o[j];
		}

		p = min(min(l[V], l[O]), min(l[Y], l[A]));
		
		/*cout << "Cube " << i << ":" << endl;
		cout << "  Pre-rotation:" << endl;
		for (j = 0; j < 6; j++) {
			cout << "    Face " << dirs[j] << ": " << l[j] << endl;
		}
		cout << "  Smallest " << p << " on " << dirs[s[p]] << endl;*/

		switch (s[p]) {
			case V:
				v[Y] = l[V];
				v[V] = l[A];
				v[A] = l[O];
				v[O] = l[Y];

				v[E] = l[E];
				v[T] = l[T];
				break;
			case O:
				v[Y] = l[O];
				v[O] = l[A];
				v[A] = l[V];
				v[V] = l[Y];

				v[E] = l[E];
				v[T] = l[T];
				break;
			case A:
				v[Y] = l[A];
				v[V] = l[O];
				v[A] = l[Y];
				v[O] = l[V];

				v[E] = l[E];
				v[T] = l[T];
				break;
			case Y:
				v[Y] = l[Y];
				v[O] = l[O];
				v[A] = l[A];
				v[V] = l[V];

				v[E] = l[E];
				v[T] = l[T];
				break;
		}

		for (j = 0; j < 6; j++) {
			l[j] = v[j];
		}

		/*cout << "  Post-rotation:" << endl;
		for (j = 0; j < 6; j++) {
			cout << "    Face " << dirs[j] << ": " << l[j] << endl;
		}*/

		for (j = 0; j < 6; j++) {
			c[i][j] = l[j];
		}
 	}
 	//cout << "===" << endl;
 	for (i = 0; i < n; i++) {
 		sf = 0;
 		for (j = 0; j < n; j++) {
 			if (i == j) {
 				continue;
 			}
 			if (c[i][0] == c[j][0] && c[i][1] == c[j][1] && c[i][2] == c[j][2] &&
 				c[i][3] == c[j][3] && c[i][4] == c[j][4] && c[i][5] == c[j][5]) {
 				cout << j + 1 << " ";
 				sf = 1;
 			}
 		}
 		if (!sf) {
 			cout << "-";
 		}
 		cout << endl;
 	}
}

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:

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

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

user output
-
-
-
-
-
...
view save

Test 12

Group: 2

Verdict:

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

Test 13

Group: 2

Verdict:

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

Test 14

Group: 2

Verdict:

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

Test 15

Group: 2

Verdict:

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

Test 16

Group: 2

Verdict:

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

Test 17

Group: 2

Verdict:

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

Test 18

Group: 2

Verdict:

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

Test 19

Group: 2

Verdict:

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

Test 20

Group: 2

Verdict:

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

Test 21

Group: 2

Verdict:

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

Test 22

Group: 2

Verdict:

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

Test 23

Group: 2

Verdict:

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

Test 24

Group: 2

Verdict:

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

Test 25

Group: 2

Verdict:

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

Test 26

Group: 2

Verdict:

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

Test 27

Group: 2

Verdict:

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

Test 28

Group: 2

Verdict:

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

Test 29

Group: 2

Verdict:

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

Test 30

Group: 2

Verdict:

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

Test 31

Group: 1, 2

Verdict: ACCEPTED

input
2
546..
.3...
.2...
.1...
...
view save

correct output
-
-
view save

user output
-
-
view save

Tasks

A Sanalista-B Ratsun reitit-C Alitaulukot-D 2021-luvut-E Arpakuutiot-

Submissions (Nanohenry)

2020-09-29 20:20:17 1002020-09-29 13:53:52 352020-09-29 13:00:11 02020-09-29 12:58:41 0