CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Arpakuutiot
Sender:	hltk
Submission time:	2020-09-28 02:02:34 +0300
Language:	C++ (C++17)
Status:	READY
Result:	35

Feedback
group	verdict	score
#1	ACCEPTED	35
#2	TIME LIMIT EXCEEDED	0

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	TIME LIMIT EXCEEDED	--	2	details
#12	RUNTIME ERROR	0.01 s	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	ACCEPTED	0.01 s	2	details
#15	RUNTIME ERROR	0.01 s	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	TIME LIMIT EXCEEDED	--	2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	TIME LIMIT EXCEEDED	--	2	details
#29	ACCEPTED	0.01 s	2	details
#30	TIME LIMIT EXCEEDED	--	2	details
#31	ACCEPTED	0.01 s	1, 2	details

Code

#include <bits/stdc++.h>
using namespace std;
constexpr int N = 5;
constexpr int M = 6;
constexpr int P = (6 * 6) * (6 * 6) * (6 * 6);
using T = array<int, M>;
 
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(T& w) {
	int f = w[1];
	w[1] = w[3];
	w[3] = w[4];
	w[4] = w[5];
	w[5] = f;
}
 
void rot2(T& w) {
	int f = w[5];
	w[5] = w[2];
	w[2] = w[3];
	w[3] = w[0];
	w[0] = f;
}
 
void rot3(T& w) {
	int f = w[0];
	w[0] = w[1];
	w[1] = w[2];
	w[2] = w[4];
	w[4] = f;
}
 
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 get_hash(T k) {
	int r = 1, s = 0;
	for (int j = 0; j < 6; ++j, r *= 6)
		s += r * (k[j] - '0' - 1);
	assert(s < P);
	return s;
}
 
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
 
	int n;
	cin >> n;
 
	vector<vector<int>> occ(P);
	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;
		T w {-1, -1, -1, -1, -1, -1};
		w[1] = grid[i][j];
		w[3] = grid[i + 1][j];
		w[4] = grid[i + 2][j];
		if (i + 3 < N && grid[i + 3][j] != '.') {
			w[5] = grid[i + 3][j];
			for (int kj = j + 1; kj < N; ++kj)
				for (int ki = 0; ki < N; ++ki)
					if (grid[ki][kj] != '.')
						w[w[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] != '.')
						w[w[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;
						if (dist == 0)
							w[2] = grid[ki][kj];
						if (dist == 1)
							w[5] = grid[ki][kj];
						if (dist == 2)
							w[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;
						if (dist == 0)
							w[0] = grid[ki][kj];
						if (dist == 1)
							w[5] = grid[ki][kj];
						if (dist == 2)
							w[2] = grid[ki][kj];
					}
				}
			}
		}
		if (w[1] == '1' || w[4] == '1') rot1(w);
		while (w[3] != '1') rot2(w);
		while (w[1] != (w[5] == '2' ? '3' : '2')) rot3(w);
		int x = get_hash(w);
		p.push_back(x);
		occ[x].push_back(ind);
	}
 
	for (int i = 0; i < n; ++i) {
		if (occ[p[i]].size() == 1) {
			cout << "-\n";
		} else {
			for (int j : occ[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: TIME LIMIT EXCEEDED

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: RUNTIME ERROR

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

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

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: RUNTIME ERROR

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

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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

Test 26

Group: 2

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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

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: TIME LIMIT EXCEEDED

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

Datatähti 2021 alku

Arpakuutiot

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