CSES - Datatähti 2021 alku

Submission details
Task:	Arpakuutiot
Sender:	jubidubi
Submission time:	2020-09-30 17:47:33 +0300
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	35
#2	ACCEPTED	65

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

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int a[7][7];
int d[20][6];

void rotate(vector<int>& v, int n) {
	for (int i = 0; i < n; ++i) {
		vector<int> t = {v[3], v[0], v[1], v[2]};
		v[0] = t[0];
		v[1] = t[1];
		v[2] = t[2];
		v[3] = t[3];
	}
}

int next(int p, int i, char c) {
	if (i == 0) {
		if (c == 'd') return 1;
		if (c == 'r') return 2;
		if (c == 'u') return 3;
		if (c == 'l') return 4;
	}
	if (i == 1) {
		vector<int> v = {5, 2, 0, 4};
		if (p == 5) rotate(v, 0);
		if (p == 2) rotate(v, 3);
		if (p == 0) rotate(v, 2);
		if (p == 4) rotate(v, 1);
		if (c == 'd') return v[0];
		if (c == 'r') return v[1];
		if (c == 'u') return v[2];
		if (c == 'l') return v[3];
	}
	if (i == 2) {
		vector<int> v = {5, 3, 0, 1};
		if (p == 5) rotate(v, 0);
		if (p == 3) rotate(v, 3);
		if (p == 0) rotate(v, 2);
		if (p == 1) rotate(v, 1);
		if (c == 'd') return v[0];
		if (c == 'r') return v[1];
		if (c == 'u') return v[2];
		if (c == 'l') return v[3];
	}
	if (i == 3) {
		vector<int> v = {5, 4, 0, 2};
		if (p == 5) rotate(v, 0);
		if (p == 4) rotate(v, 3);
		if (p == 0) rotate(v, 2);
		if (p == 2) rotate(v, 1);
		if (c == 'd') return v[0];
		if (c == 'r') return v[1];
		if (c == 'u') return v[2];
		if (c == 'l') return v[3];
	}
	if (i == 4) {
		vector<int> v = {5, 1, 0, 3};
		if (p == 5) rotate(v, 0);
		if (p == 1) rotate(v, 3);
		if (p == 0) rotate(v, 2);
		if (p == 3) rotate(v, 1);
		if (c == 'd') return v[0];
		if (c == 'r') return v[1];
		if (c == 'u') return v[2];
		if (c == 'l') return v[3];
	}
	if (i == 5) {
		vector<int> v = {3, 2, 1, 4};
		if (p == 3) rotate(v, 0);
		if (p == 2) rotate(v, 3);
		if (p == 1) rotate(v, 2);
		if (p == 4) rotate(v, 1);
		if (c == 'd') return v[0];
		if (c == 'r') return v[1];
		if (c == 'u') return v[2];
		if (c == 'l') return v[3];
	}
	return -1;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	for (int i = 0; i < n; ++i) {
		int sx = 0, sy = 0;
		for (int y = 1; y <= 5; ++y) {
			string s;
			cin >> s;

			for (int x = 1; x <= 5; ++x) {
				a[x][y] = 0;
				if (s[x-1] != '.') a[x][y] = (int)s[x-1] - 48;
				if (a[x][y] == 1) sx = x;
				if (a[x][y] == 1) sy = y;
			}
		}
		set<int> z;
		queue<pair<pair<int, int>, pair<pair<int, int>, int>>> q;
		q.push({{sx, sy}, {{0, 0}, 'u'}});
		d[i][0] = 1;
		while (!q.empty()) {


			int x = q.front().first.first;
			int y = q.front().first.second;
			int p = q.front().second.first.first;
			int cur = q.front().second.first.second;
			char dir = q.front().second.second;
			q.pop();

			if (z.count(a[x][y])) continue;
			z.insert(a[x][y]);

			if (a[x+1][y] && !z.count(a[x+1][y])) {
				char c = ' ';
				if (dir == 'r') c = 'u';
				if (dir == 'u') c = 'r';
				if (dir == 'l') c = 'd';
				if (dir == 'd') c = 'l';
				int ni = next(p, cur, c);
				d[i][ni] = a[x+1][y];
				q.push({{x+1, y}, {{cur, ni}, 'r'}});
			}
			if (a[x-1][y] && !z.count(a[x-1][y])) {
				char c = ' ';
				if (dir == 'r') c = 'd';
				if (dir == 'u') c = 'l';
				if (dir == 'l') c = 'u';
				if (dir == 'd') c = 'r';
				int ni = next(p, cur, c);
				d[i][ni] = a[x-1][y];
				q.push({{x-1, y}, {{cur, ni}, 'l'}});
			}
			if (a[x][y-1] && !z.count(a[x][y-1])) {
				char c = ' ';
				if (dir == 'r') c = 'l';
				if (dir == 'u') c = 'u';
				if (dir == 'l') c = 'r';
				if (dir == 'd') c = 'd';
				int ni = next(p, cur, c);
				d[i][ni] = a[x][y-1];
				q.push({{x, y-1}, {{cur, ni}, 'u'}});
			}
			if (a[x][y+1] && !z.count(a[x][y+1])) {
				char c = ' ';
				if (dir == 'r') c = 'r';
				if (dir == 'u') c = 'd';
				if (dir == 'l') c = 'l';
				if (dir == 'd') c = 'u';
				int ni = next(p, cur, c);
				d[i][ni] = a[x][y+1];
				q.push({{x, y+1}, {{cur, ni}, 'd'}});
			}
		}
	}

	for (int i = 0; i < n; ++i) {
		set<int> s;
		for (int j = 0; j < n; ++j) {
			if (j == i) continue;
			if (d[i][5] != d[j][5]) continue;
			for (int k = 0; k < 4; ++k) {
				if (d[i][1] == d[j][1] && d[i][2] == d[j][2] && d[i][3] == d[j][3]) s.insert(j);
				
				vector<int> t;
				for (int l = 1; l < 5; ++l) t.push_back(d[j][l]);
				rotate(t, 1);
				for (int l = 1; l < 5; ++l) d[j][l] = t[l-1];
			}
		}
		for (auto c : s) cout << c+1 << " ";
		if (s.size() == 0) cout << "-";
		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: ACCEPTED

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

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

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

Test 12

Group: 2

Verdict: ACCEPTED

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
`5 8 6 10 4 7 9 3 7 9 1 8 ...` view save

Test 13

Group: 2

Verdict: ACCEPTED

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
`4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ...` view save

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

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
`5 7 9 10 8 4 6 3 6 1 7 9 10 ...` view save

Test 16

Group: 2

Verdict: ACCEPTED

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
`4 9 3 5 10 2 5 10 1 9 2 3 10 ...` view save

Test 17

Group: 2

Verdict: ACCEPTED

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
`2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ...` Truncated

Test 18

Group: 2

Verdict: ACCEPTED

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 8 9 5 6 1 8 9 7 10 2 6 ...` view save

Test 19

Group: 2

Verdict: ACCEPTED

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
`2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ...` Truncated

Test 20

Group: 2

Verdict: ACCEPTED

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
`4 7 8 6 9 10 5 1 7 8 3 ...` view save

Test 21

Group: 2

Verdict: ACCEPTED

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
`3 7 11 16 6 1 7 11 16 5 19 4 19 ...` Truncated

Test 22

Group: 2

Verdict: ACCEPTED

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 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ...` Truncated

Test 23

Group: 2

Verdict: ACCEPTED

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
`5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ...` Truncated

Test 24

Group: 2

Verdict: ACCEPTED

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
`2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ...` Truncated

Test 25

Group: 2

Verdict: ACCEPTED

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

Test 26

Group: 2

Verdict: ACCEPTED

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
`8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ...` Truncated

Test 27

Group: 2

Verdict: ACCEPTED

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

Test 28

Group: 2

Verdict: ACCEPTED

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

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

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

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