CSES - Datatähti 2021 alku

Submission details
Task:	Ratsun reitit
Sender:	Ulrikaz
Submission time:	2020-10-01 12:10:36 +0300
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	27
#2	ACCEPTED	31
#3	ACCEPTED	42

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.01 s	2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.01 s	3	details
#12	ACCEPTED	0.01 s	3	details
#13	ACCEPTED	0.01 s	3	details

Code

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

int v[100][100];
bool z[100][100];

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

	int n;
	cin >> n;
	
	queue<pair<int, int>> q;
	z[0][0] = 1; v[0][0] = 0;
	q.push({0, 0});

	while (!q.empty()) {

		int x = q.front().first;
		int y = q.front().second;
		q.pop();

		if (x - 1 >= 0 && x - 1 < n && y - 2 >= 0 && y - 2 < n && !z[x - 1][y - 2]) {
			z[x - 1][y - 2] = 1; 
			v[x - 1][y - 2] = v[x][y] + 1;
			q.push({x - 1, y - 2});
		}
		if (x + 1 >= 0 && x + 1 < n && y - 2 >= 0 && y - 2 < n && !z[x + 1][y - 2]) {
			z[x + 1][y - 2] = 1; 
			v[x + 1][y - 2] = v[x][y] + 1;
			q.push({x + 1, y - 2});
		}
		if (x + 2 >= 0 && x + 2 < n && y - 1 >= 0 && y - 1 < n && !z[x + 2][y - 1]) {
			z[x + 2][y - 1] = 1; 
			v[x + 2][y - 1] = v[x][y] + 1;
			q.push({x + 2, y - 1});
		}
		if (x + 2 >= 0 && x + 2 < n && y + 1 >= 0 && y + 1 < n && !z[x + 2][y + 1]) {
			z[x + 2][y + 1] = 1; 
			v[x + 2][y + 1] = v[x][y] + 1;
			q.push({x + 2, y + 1});
		}
		if (x + 1 >= 0 && x + 1 < n && y + 2 >= 0 && y + 2 < n && !z[x + 1][y + 2]) {
			z[x + 1][y + 2] = 1; 
			v[x + 1][y + 2] = v[x][y] + 1;
			q.push({x + 1, y + 2});
		}
		if (x - 1 >= 0 && x - 1 < n && y + 2 >= 0 && y + 2 < n && !z[x - 1][y + 2]) {
			z[x - 1][y + 2] = 1; 
			v[x - 1][y + 2] = v[x][y] + 1;
			q.push({x - 1, y + 2});
		}	
		if (x - 2 >= 0 && x - 2 < n && y + 1 >= 0 && y + 1 < n && !z[x - 2][y + 1]) {
			z[x - 2][y + 1] = 1; 
			v[x - 2][y + 1] = v[x][y] + 1;
			q.push({x - 2, y + 1});
		}
		if (x - 2 >= 0 && x - 2 < n && y - 1 >= 0 && y - 1 < n && !z[x - 2][y - 1]) {
			z[x - 2][y - 1] = 1; 
			v[x - 2][y - 1] = v[x][y] + 1;
			q.push({x - 2, y - 1});
		}
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			cout << v[j][i] << ' ';
		}
		cout << '\n';
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4` view save

correct output
`0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2` view save

user output
`0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`5` view save

correct output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

user output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`6` view save

correct output
`0 3 2 3 2 3 3 4 1 2 3 4 2 1 4 3 2 3 3 2 3 2 3 4 2 3 2 3 4 3 ...` view save

user output
`0 3 2 3 2 3 3 4 1 2 3 4 2 1 4 3 2 3 3 2 3 2 3 4 2 3 2 3 4 3 ...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`7` view save

correct output
`0 3 2 3 2 3 4 3 4 1 2 3 4 3 2 1 4 3 2 3 4 3 2 3 2 3 4 3 2 3 2 3 4 3 4 ...` view save

user output
`0 3 2 3 2 3 4 3 4 1 2 3 4 3 2 1 4 3 2 3 4 3 2 3 2 3 4 3 2 3 2 3 4 3 4 ...` Truncated

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8` view save

correct output
`0 3 2 3 2 3 4 5 3 4 1 2 3 4 3 4 2 1 4 3 2 3 4 5 3 2 3 2 3 4 3 4 2 3 2 3 4 3 4 5 ...` view save

user output
`0 3 2 3 2 3 4 5 3 4 1 2 3 4 3 4 2 1 4 3 2 3 4 5 3 2 3 2 3 4 3 4 2 3 2 3 4 3 4 5 ...` Truncated

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`9` view save

correct output
`0 3 2 3 2 3 4 5 4 3 4 1 2 3 4 3 4 5 2 1 4 3 2 3 4 5 4 3 2 3 2 3 4 3 4 5 2 3 2 3 4 3 4 5 4 ...` view save

user output
`0 3 2 3 2 3 4 5 4 3 4 1 2 3 4 3 4 5 2 1 4 3 2 3 4 5 4 3 2 3 2 3 4 3 4 5 2 3 2 3 4 3 4 ...` Truncated

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10` view save

correct output
`0 3 2 3 2 3 4 5 4 5 3 4 1 2 3 4 3 4 5 6 2 1 4 3 2 3 4 5 4 5 3 2 3 2 3 4 3 4 5 6 2 3 2 3 4 3 4 5 4 5 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 3 4 1 2 3 4 3 4 5 6 2 1 4 3 2 3 4 5 4 5 3 2 3 2 3 4 3 4 5 6 2 3 2 ...` Truncated

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`25` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`49` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`50` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 11

Group: 3

Verdict: ACCEPTED

input
`75` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 12

Group: 3

Verdict: ACCEPTED

input
`99` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Test 13

Group: 3

Verdict: ACCEPTED

input
`100` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` Truncated

Datatähti 2021 alku

Ratsun reitit

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

Tasks

Submissions (Ulrikaz)