CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Arpakuutiot
Sender:	intoo
Submission time:	2020-09-29 01:36:52 +0300
Language:	C++ (C++17)
Status:	READY
Result:	35

Feedback
group	verdict	score
#1	ACCEPTED	35
#2	WRONG ANSWER	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	WRONG ANSWER	0.01 s	2	details
#12	ACCEPTED	0.01 s	2	details
#13	WRONG ANSWER	0.01 s	2	details
#14	ACCEPTED	0.01 s	2	details
#15	WRONG ANSWER	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	WRONG ANSWER	0.01 s	2	details
#21	WRONG ANSWER	0.01 s	2	details
#22	WRONG ANSWER	0.01 s	2	details
#23	WRONG ANSWER	0.01 s	2	details
#24	WRONG ANSWER	0.01 s	2	details
#25	WRONG ANSWER	0.01 s	2	details
#26	ACCEPTED	0.01 s	2	details
#27	WRONG ANSWER	0.01 s	2	details
#28	ACCEPTED	0.01 s	2	details
#29	WRONG ANSWER	0.01 s	2	details
#30	WRONG ANSWER	0.01 s	2	details
#31	ACCEPTED	0.01 s	1, 2	details

Code

#include <iostream>
#include <vector>
 
using namespace std;
 
int n;
char t[20][5][5];
vector<int> v[20];
 
void print() {
	for (int i = 0; i < n; i++) {
		for (int y = 0; y < 5; y++) {
			for (int x = 0; x < 5; x++) {
				cout << t[i][y][x];
			}
			cout << endl;
		}
		cout << endl;
	}
}
 
void up(int k) {
	int l[4];
	for (int i = 0; i < 4; i++) l[i] = t[k][i][1];
	for (int i = 0; i < 4; i++) t[k][i][1] = l[(i+1) % 4];
}
 
void down(int k) {
	int l[4];
	for (int i = 0; i < 4; i++) l[i] = t[k][i][1];
	for (int i = 0; i < 4; i++) t[k][i][1] = l[(i+3) % 4];
}
 
void left(int k) {
	int l[4];
	for (int i = 0; i < 3; i++) l[i] = t[k][0][i];
	l[3] = t[k][2][1];
	for (int i = 0; i < 3; i++) t[k][0][i] = l[(i+1) % 4];
	t[k][2][1] = l[0];
}
 
void right(int k) {
	int l[4];
	for (int i = 0; i < 3; i++) l[i] = t[k][0][i];
	l[3] = t[k][2][1];
	for (int i = 0; i < 3; i++) t[k][0][i] = l[(i+3) % 4];
	t[k][2][1] = l[2];
}
 
void clock(int k) {
	int l[4] = {t[k][0][0], t[k][3][1], t[k][0][2], t[k][1][1]};
	t[k][0][0] = l[3];
	t[k][3][1] = l[0];
	t[k][0][2] = l[1];
	t[k][1][1] = l[2];
}
 
void counter(int k) {
	int l[4] = {t[k][0][0], t[k][3][1], t[k][0][2], t[k][1][1]};
	t[k][0][0] = l[1];
	t[k][3][1] = l[2];
	t[k][0][2] = l[3];
	t[k][1][1] = l[0];
}
 
void normalize3(int);
 
void normalize2(int k) {
	for (int y = 0; y < 5; y++) {
		int yl = 0;
		for (int x = 0; x < 5; x++) {
			yl += (t[k][y][x] != '.');
		}
		if (yl == 1) {
			for (int x = 0; x < 5; x++) {
				if (t[k][y][x] != '.') {
					int X = -1;
					if (0 < x) {
						if (0 < y) {
							if (t[k][y-1][x-1] != '.') {
								X = x-1;
							}
						}  if (y < 4)
							if (t[k][y+1][x-1] != '.') {
								X = x-1;
							}
					} if (x < 4) {
						if (0 < y) {
							if (t[k][y-1][x+1] != '.') {
								X = x+1;
							}
						} else if (y < 4)
							if (t[k][y+1][x+1] != '.') {
								X = x+1;
							}
					}
					int a = t[k][y][X];
					t[k][y][X] = t[k][y][x];
					t[k][y][x] = a;
					normalize3(k);
					return;
				}
			}
		}
	}
	for (int x = 0; x < 5; x++) {
		int yl = 0;
		for (int y = 0; y < 5; y++) {
			yl += (t[k][y][x] != '.');
		}
		if (yl == 1) {
			for (int y = 0; y < 5; y++) {
				if (t[k][y][x] != '.') {
					int Y = -1;
					if (0 < x) {
						if (0 < y) {
							if (t[k][y-1][x-1] != '.') {
								Y = y-1;
							}
						} if (y < 4)
							if (t[k][y+1][x-1] != '.') {
								Y = y+1;
							}
					} if (x < 4) {
						if (0 < y) {
							if (t[k][y-1][x+1] != '.') {
								Y = y-1;
							}
						} if (y < 4)
							if (t[k][y+1][x+1] != '.') {
								Y = y+1;
							}
					}
					int a = t[k][Y][x];
					t[k][Y][x] = t[k][y][x];
					t[k][y][x] = a;
					normalize3(k);
					return;
				}
			}
		}
	}
}
 
void normalize3(int k) {	
	int p = -1;
	vector<int> l;
	char a[5][5];
	for (int i = 0; i < 5; i++)
		for (int j = 0; j < 5; j++)
			a[i][j] = '.';
	for (int y = 0; y < 5; y++) {
		for (int x = 0; x < 5; x++) {
			if (t[k][y][x] != '.') {
				l.push_back(t[k][y][x]);
				p = y;
			} else {
				l.clear();
				p = -1;
			}
			if (l.size() == 3) break;
		}
		if (l.size() == 3) break;
	}
	if (l.size() == 3) {
		int ad = 0;
		for (int x = 0; x < 5; x++) {
			if (p-1 >= 0)
				ad += (t[k][p-1][x] != '.');
			if (p+1 < 5)
				ad += (t[k][p+1][x] != '.');
		}
		if (ad < 3) p = -1; // kolmen suora väärään suuntaan
	}
	if (l.size() == 3) { // kaksi vaakasuoraa kolmen suoraa EI VAAN YLIPÄÄTÄÄN VAAKASUORA KOLMEN SUORA
		int yl1 = 0, yl2 = 0;
		for (int x = 0; x < 5; x++) {
			if (p-1 >= 0)
				yl1 += t[k][p-1][x] != '.';
			if (p+1 < 5)
				yl2 += t[k][p+1][x] != '.';
		}
		if (yl1 == 3 || yl2 == 3) { // kaksi vaakasuoraa kolmen suoraa
			vector<int> p1, p2;
			int q1 = -1, q2 = -1;
			for (int x = 0; x < 5; x++) {
				if (p-1 >= 0 && t[k][p-1][x] != '.') {
					p1.push_back(t[k][p-1][x]);
					q1 = p-1;
				} else {
					p1.clear();
					q1 = -1;
				}
				if (p+1 < 5 && t[k][p+1][x] != '.') {
					p2.push_back(t[k][p+1][x]);
					q2 = p+1;
				} else {
					p2.clear();
					q2 = -1;
				}
			}
			if (q1 != -1) {
				for (int x = 0; x < 3; x++) a[0][x] = l[x]; // pot. seg fault
				for (int y = 0; y < 3; y++) a[y+1][1] = p1[y]; // -||-
				for (int y = 0; y < 5; y++)
					for (int x = 0; x < 5; x++)
						t[k][y][x] = a[y][x];
				return;
			}
			if (q2 != -1) {
				for (int x = 0; x < 3; x++) a[0][x] = l[x]; // pot. seg fault
				for (int y = 0; y < 3; y++) a[y+1][1] = p2[y]; // -||-
				for (int y = 0; y < 5; y++)
					for (int x = 0; x < 5; x++)
						t[k][y][x] = a[y][x];
				return;
			}
		}
	}
	if (l.size() <  3) { // pystysuora kolmen suora
		l.clear();
		p = -1;
		for (int x = 0; x < 5; x++) {
			for (int y = 0; y < 5; y++) {
				if (t[k][y][x] != '.') {
					l.push_back(t[k][y][x]);
					p = x;
				} else {
					l.clear();
					p = -1;
				}
				if (l.size() == 3) break;
			}
			if (l.size() == 3) break;
		}
		if (l.size() < 3) { // ei kolmen suoraa
			normalize2(k);
			return;
		}
		if (l.size() == 3) { // kaksi pystysuoraa kolmen suoraa EI
			int yl1 = 0, yl2 = 0;
			for (int y = 0; y < 5; y++) {
				if (p-1 >= 0)
					yl1 += t[k][y][p-1] != '.';
				if (p+1 < 5)
					yl2 += t[k][y][p+1] != '.';
			}
			if (yl1 == 3 || yl2 == 3) { // kaksi pystysuoraa kolmen suoraa
				vector<int> p1, p2;
				int q1 = -1, q2 = -1;
				for (int y = 0; y < 5; y++) {
					if (p-1 >= 0 && t[k][y][p-1] != '.') {
						p1.push_back(t[k][y][p-1]);
						q1 = p-1;
					} else {
						p1.clear();
						q1 = -1;
					}
					if (p+1 < 5 && t[k][y][p+1] != '.') {
						p2.push_back(t[k][y][p+1]);
						q2 = p+1;
					} else {
						p2.clear();
						q2 = -1;
					}
				}
				if (q1 != -1) {
					for (int x = 0; x < 3; x++) a[0][x] = l[x]; // pot. seg fault
					for (int y = 0; y < 3; y++) a[y+1][1] = p1[2-y]; // -||-
					for (int y = 0; y < 5; y++)
						for (int x = 0; x < 5; x++)
							t[k][y][x] = a[y][x];
					return;
				}
				if (q2 != -1) {
					for (int x = 0; x < 3; x++) a[0][x] = l[x]; // pot. seg fault
					for (int y = 0; y < 3; y++) a[y+1][1] = p2[2-y]; // -||-
					for (int y = 0; y < 5; y++)
						for (int x = 0; x < 5; x++)
							t[k][y][x] = a[y][x];
					return;
				}
			}
		}
		for (int y = 0; y < 3; y++) a[y][1] = l[y]; // pot. seg fault
		for (int y = 0; y < 5; y++) {
			if (t[k][y][p] != '.') { // täällä ei pitäisi segfaultata
				if (t[k][y][p-1] != '.') a[0][0] = t[k][y][p-1];
				if (t[k][y][p+1] != '.') a[0][2] = t[k][y][p+1];
			} else {
				if (t[k][y][p-1] != '.') a[3][1] = t[k][y][p-1];
				if (t[k][y][p+1] != '.') a[3][1] = t[k][y][p+1];
			}
		}
		for (int y = 0; y < 5; y++)
			for (int x = 0; x < 5; x++)
				t[k][y][x] = a[y][x];
		return;
	}
	for (int y = 0; y < 3; y++) a[y][1] = l[y]; // pot. seg fault
	for (int x = 0; x < 5; x++) {
		if (t[k][p][x] != '.') { // täällä ei pitäisi segfaultata
			if (t[k][p-1][x] != '.') a[0][2] = t[k][p-1][x];
			if (t[k][p+1][x] != '.') a[0][0] = t[k][p+1][x];
		} else {
			if (t[k][p-1][x] != '.') a[3][1] = t[k][p-1][x];
			if (t[k][p+1][x] != '.') a[3][1] = t[k][p+1][x];
		}
	}
	for (int y = 0; y < 5; y++)
		for (int x = 0; x < 5; x++)
			t[k][y][x] = a[y][x];
}
 
void normalize(int k) {
	int p = -1;
	vector<int> l;
	char a[5][5];
	for (int i = 0; i < 5; i++)
		for (int j = 0; j < 5; j++)
			a[i][j] = '.';
	for (int y = 0; y < 5; y++) {
		for (int x = 0; x < 5; x++) {
			if (t[k][y][x] != '.') {
				l.push_back(t[k][y][x]);
				p = y;
			} else {
				l.clear();
				p = -1;
			}
			if (l.size() == 4) break;
		}
		if (l.size() == 4) break;
	}
	if (l.size() < 4) { // pystysuora neljän suora
		l.clear();
		p = -1;
		for (int x = 0; x < 5; x++) {
			for (int y = 0; y < 5; y++) {
				if (t[k][y][x] != '.') {
					l.push_back(t[k][y][x]);
					p = x;
				} else {
					l.clear();
					p = -1;
				}
				if (l.size() == 4) break;
			}
			if (l.size() == 4) break;
		}
		if (l.size() < 4) { // ei neljän suoraa
			normalize3(k);
			return;
		}
		for (int y = 0; y < 4; y++) a[y][1] = l[y]; // pot. seg fault
		for (int y = 0; y < 5; y++) { // ei pitäisi segfaultata
			if (t[k][y][p-1] != '.') a[0][0] = t[k][y][p-1];
			if (t[k][y][p+1] != '.') a[0][2] = t[k][y][p+1];
		}
		for (int y = 0; y < 5; y++)
			for (int x = 0; x < 5; x++)
				t[k][y][x] = a[y][x];
		return;
	}
	for (int y = 0; y < 4; y++) a[y][1] = l[y]; // pot. seg fault
	for (int x = 0; x < 5; x++) {
		if (t[k][p-1][x] != '.') a[0][2] = t[k][p-1][x];
		if (t[k][p+1][x] != '.') a[0][0] = t[k][p+1][x];
	}
	for (int y = 0; y < 5; y++)
		for (int x = 0; x < 5; x++)
			t[k][y][x] = a[y][x];
}
 
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int y = 0; y < 5; y++) {
			for (int x = 0; x < 5; x++) {
				cin >> t[i][y][x];
			}
		}
	}
	for (int i = 0; i < n; i++) normalize(i);
	for (int i = 0; i < n; i++) {
		bool b = 0;
		for (int y = 0; y < 4; y++) {
			for (int x = 0; x < 3; x++) {
				if (t[i][y][x] == '1') {
					if (y == 0) {
						if (x == 1 || x == 2) left(i);
						if (x == 2) left(i);
					} else if (y == 1) clock(i);
					else if (y == 2) right(i);
					else if (y == 3) counter(i);
					b = 1;
				}
				if (b) break;
			}
			if (b) break;
		}
	}
	for (int i = 0; i < n-1; i++) {
		for (int j = i+1; j < n; j++) {
			if (t[i][0][2] != t[j][0][2]) continue;
			for (int y = 0; y < 4; y++) {
				if (t[i][0][1] == t[j][y][1]) {
					if (y == 1 || y == 2) up(j);
					if (y == 2) up(j);
					if (y == 3) down(j);
				}
			}
		}
	}
	for (int i = 0; i < n-1; i++) {
		for (int j = i+1; j < n; j++) {
			bool b = 0;
			for (int y = 0; y < 5; y++) {
				for (int x = 0; x < 5; x++) {
					if (t[i][y][x] != t[j][y][x]) {
						b = 1;
						break;
					}
				}
				if (b) break;
			}
			if (b) continue;
			v[i].push_back(j);
			v[j].push_back(i);
		}
	}
	for (int i = 0; i < n; i++) {
		for (auto u : v[i]) cout << u+1 << ' ';
		if (v[i].empty()) cout << '-';
		cout << endl;
	}
	//print();
}

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: WRONG ANSWER

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 7 10 2 6 - ...` 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: WRONG ANSWER

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
`9 10 5 6 7 8 - - 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: WRONG ANSWER

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 - 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: WRONG ANSWER

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

Test 21

Group: 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

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 18 3 9 13 18 8 14 16 ...` Truncated

Test 23

Group: 2

Verdict: WRONG ANSWER

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

Test 24

Group: 2

Verdict: WRONG ANSWER

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

Test 25

Group: 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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

Test 30

Group: 2

Verdict: WRONG ANSWER

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
`- 12 13 17 7 8 9 14 15 16 - 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 (intoo)