— Dark mode

Datatähti 2021 alku

Arpakuutiot

  • Start: 2020-09-28 00:00:00
  • End: 2020-10-12 00:00:00
Submission details
Task:Arpakuutiot
Sender:hltk
Submission time:2020-09-28 01:48:23 +0300
Language:C++ (C++17)
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
#11--2details
#120.01 s2details
#130.01 s2details
#14ACCEPTED0.01 s2details
#150.01 s2details
#16--2details
#17--2details
#180.01 s2details
#19--2details
#20--2details
#21--2details
#22--2details
#23--2details
#24--2details
#250.01 s2details
#26--2details
#27--2details
#280.01 s2details
#29ACCEPTED0.01 s2details
#30--2details
#31ACCEPTED0.01 s1, 2details

Code

#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
constexpr int N = 5;

void rot_grid(vector<string>& grid) {
	auto ret = grid;
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			ret[i][j] = grid[N - j - 1][i];
	grid = ret;
}

void rot1(vector<int>& faces) {
	vector<int> ret = faces;
	ret[5] = faces[1];
	ret[1] = faces[3];
	ret[3] = faces[4];
	ret[4] = faces[5];
	faces = ret;
}

void rot2(vector<int>& faces) {
	vector<int> ret = faces;
	ret[5] = faces[2];
	ret[0] = faces[5];
	ret[3] = faces[0];
	ret[2] = faces[3];
	faces = ret;
}

void rot3(vector<int>& faces) {
	vector<int> ret = faces;
	ret[0] = faces[1];
	ret[4] = faces[0];
	ret[2] = faces[4];
	ret[1] = faces[2];
	faces = ret;
}

pair<int, int> find3(vector<string>& grid) {
	for (int i = 0; i < N - 2; ++i)
		for (int j = 0; j < N; ++j)
			if (grid[i][j] != '.' && grid[i + 1][j] != '.' && grid[i + 2][j] != '.')
				return {i, j};
	return {-1, -1};
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;

	map<vector<int>, vector<int>> z;

	vector<vector<int>> p;

	for (int ind = 0; ind < n; ++ind) {
		vector<string> grid(N);
		for (auto& x : grid)
			cin >> x;
		pair<int, int> l;
		for (l = find3(grid); l.first == -1; rot_grid(grid), l = find3(grid));
		auto [i, j] = l;
		vector<int> faces(6, -1);
		faces[1] = grid[i][j];
		faces[3] = grid[i + 1][j];
		faces[4] = grid[i + 2][j];
		if (i + 3 < N && grid[i + 3][j] != '.') {
			faces[5] = grid[i + 3][j];
			for (int kj = j + 1; kj < N; ++kj)
				for (int ki = 0; ki < N; ++ki)
					if (grid[ki][kj] != '.')
						faces[faces[2] == -1 ? 2 : 0] = grid[ki][kj];
			for (int kj = j - 1; kj >= 0; --kj)
				for (int ki = 0; ki < N; ++ki)
					if (grid[ki][kj] != '.')
						faces[faces[2] == -1 ? 2 : 0] = grid[ki][kj];
		} else {
			for (int kj = j + 1; kj < N; ++kj) {
				for (int ki = 0; ki < N; ++ki) {
					if (grid[ki][kj] != '.') {
						int dist = (i <= ki && ki <= i + 2 ? 0 : 1) + (kj - j) - 1;
						// cout << grid[ki][kj] << ": " << dist << " (case 1)\n";
						if (dist == 0)
							faces[2] = grid[ki][kj];
						if (dist == 1)
							faces[5] = grid[ki][kj];
						if (dist == 2)
							faces[0] = grid[ki][kj];
					}
				}
			}
			for (int kj = j - 1; kj >= 0; --kj) {
				for (int ki = 0; ki < N; ++ki) {
					if (grid[ki][kj] != '.') {
						int dist = (i <= ki && ki <= i + 2 ? 0 : 1) + (j - kj) - 1;
						// cout << grid[ki][kj] << ": " << dist << " (case 2)\n";
						if (dist == 0)
							faces[0] = grid[ki][kj];
						if (dist == 1)
							faces[5] = grid[ki][kj];
						if (dist == 2)
							faces[2] = grid[ki][kj];
					}
				}
			}
		}
		if (count(faces.begin(), faces.end(), -1)) {
			for (auto& u : grid)
				cout << u << "\n";
			for (int u : faces)
				cout << u << " ";
			cout << "\n";
			cout.flush();
			throw;
		}
		if (faces[1] == '1' || faces[4] == '1') rot1(faces);
		while (faces[3] != '1') rot2(faces);
		while (faces[1] != (faces[5] == '2' ? '3' : '2')) rot3(faces);
		z[faces].push_back(ind);
		p.push_back(faces);
	}

	for (int i = 0; i < n; ++i) {
		if (z[p[i]].size() == 1) {
			cout << "-\n";
		} else {
			for (int j : z[p[i]])
				if (i != j)
					cout << j + 1 << " ";
			cout << "\n";
		}
	}
}

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
(empty)

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
4....
2....
63...
.5...
.1...
...
view save

Error:
terminate called without an active exception

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
....2
....5
...36
...1.
...4.
...
view save

Error:
terminate called without an active exception

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:

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
....4
....1
...32
...6.
...5.
...
view save

Error:
terminate called without an active exception

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
(empty)

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
(empty)

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
....3
....6
...54
...1.
...2.
...
view save

Error:
terminate called without an active exception

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
....4
....3
...51
...2.
...6.
...
view save

Error:
terminate called without an active exception

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
(empty)

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
(empty)

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
2....
3....
46...
.1...
.5...
...
view save

Error:
terminate called without an active exception

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:

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
(empty)

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 (hltk)

2020-10-13 13:43:56 1002020-10-13 13:07:33 1002020-10-07 23:18:04 1002020-10-07 22:37:32 1002020-10-06 22:33:06 1002020-10-06 22:29:41 1002020-10-03 21:06:10 1002020-10-03 21:01:59 2020-09-28 03:43:24 1002020-09-28 02:18:24 352020-09-28 02:02:34 352020-09-28 01:54:56 352020-09-28 01:48:23 352020-09-28 01:13:40 35