CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Ratsun reitit
Sender:	Lentsu
Submission time:	2020-10-06 22:30:21 +0300
Language:	C++11
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

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

Code

#include <iostream>

int main() {
	
	int n;
	std::cin >> n;

	int board[n][n];

	//initialize board
	for(int y = 0; y != n; ++y)
		for (int x = 0; x != n; ++x)
			board[x][y] = 0;

	//The initialization kinda makes things harder so let's set the first depth manually
	board[1][2] = board[2][1] = 1;

	int depth = 2;
	int insertion_counter = 2;
	int temp;

	while (true) {
		
		std::cout << "Current depth: " << depth << std::endl;

		//save number of insertions
		temp = insertion_counter;

		for (int y = 0; y != n; ++y)
			for (int x = 0; x != n; ++x) {

				// If starting point
				if(board[x][y] == depth-1) {

					//Possible moves:
					//	(x+2, y+1)
					//	(x+2, y-1)
					//	(x-2, y+1)
					//	(x-2, y-1)
					//
					//	(x+1, y+2)
					//	(x+1, y-2)
					//	(x-1, y+2)
					//	(x-1, y-2)
					
					//	check if one or more moves are possible
					
					// Moves x+2
					if (x+2 < n) {
						
						// Move (+2, +1)
						if (y+1 < n) {
							if (board[x+2][y+1] == 0) {
								
								std::cout << "move: (" << x << ", " << y << ") -> (" << x+2 << ", " << y+1 << ")" << std::endl;

								board[x+2][y+1] = depth;
								++insertion_counter;
							}
						}
						
						// Move (+2, -1)
						if (y-1 >= 0) {
							if (board[x+2][y-1] == 0) {

								std::cout << "move: (" << x << ", " << y << ") -> (" << x+2 << ", " << y-1 << ")" << std::endl;

								board[x+2][y-1] = depth;
								++insertion_counter;
							}
						}
					}

					// Moves x-2
					if (x-2 >= 0) {
						
						// Move (-2, +1)
						if (y+1 < n) {
							if (board[x-2][y+1] == 0) {

								std::cout << "move: (" << x << ", " << y << ") -> (" << x-2 << ", " << y+1 << ")" << std::endl;

								board[x-2][y+1] = depth;
								++insertion_counter;
							}
						}
						
						// Move (-2, -1)
						if (y-1 >= 0) {
							if (board[x-2][y-1] == 0) {

								std::cout << "move: (" << x << ", " << y << ") -> (" << x-2 << ", " << y-1 << ")" << std::endl;

								board[x-2][y-1] = depth;
								++insertion_counter;
							}
						}
					}

					// Moves y+2
					if (y+2 < n) {

						// Move (+1, +2)
						if (x+1 < n) {
							if (board[x+1][y+2] == 0) {

								std::cout << "move: (" << x << ", " << y << ") -> (" << x+1 << ", " << y+2 << ")" << std::endl;

								board[x+1][y+2] = depth;
								++insertion_counter;
							}
						}

						// Move (-1, +2)
						if (x-1 >= 0) {
							if (board[x-1][y+2] == 0) {

								std::cout << "move: (" << x << ", " << y << ") -> (" << x-1 << ", " << y+2 << ")" << std::endl;

								board[x-1][y+2] = depth;
								++insertion_counter;
							}
						}
					}

					// Moves y-2
					if (y-2 >= 0) {

						// Move (+1, -2)
						if (x+1 < n) {
							if (board[x+1][y-2] == 0){

								std::cout << "move: (" << x << ", " << y << ") -> (" << x+1 << ", " << y-2 << ")" << std::endl;

								board[x+1][y-2] = depth;
								++insertion_counter;
							}
						}

						// Move (-1, -2)
						if (x-1 >= 0) {
							if (board[x-1][y-2] == 0) {

								std::cout << "move: (" << x << ", " << y << ") -> (" << x-1 << ", " << y-2 << ")" << std::endl;

								board[x-1][y-2] = depth;
								++insertion_counter;
							}
						}
					}

				}
			// End of for
			}

		//If an insertion wasn't made, break the loop
		if (temp == insertion_counter)
			break;
		
		//increment depth by 1
		++depth;
	}

	//Initial point at (0, 0)
	board[0][0] = 0;

	//Print the result
	for (int y = 0; y != n; ++y) {
		for (int x = 0; x != n; ++x)
			std::cout << board[x][y] << " ";
		std::cout << std::endl;
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) move: (2, 1) -> (3, 3) move: (2, 1) -> (1, 3) ...` view save

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 11

Group: 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 12

Group: 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

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
`Current depth: 2 move: (2, 1) -> (4, 2) move: (2, 1) -> (4, 0) move: (2, 1) -> (0, 2) move: (2, 1) -> (0, 0) ...` view save

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