CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Ratsun reitit
Sender:	pvartiovaara
Submission time:	2020-09-29 16:12:22 +0300
Language:	C++ (C++11)
Status:	READY
Result:	27

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

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	TIME LIMIT EXCEEDED	--	2, 3	details
#9	TIME LIMIT EXCEEDED	--	2, 3	details
#10	TIME LIMIT EXCEEDED	--	2, 3	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details

Code

#include <bits/stdc++.h>
#include <cstring>
#include <queue>

#define DEBUG
#define MP(x, y) std::make_pair(x, y)

int n;

bool outOfBounds(int a, int b) {
	if (a < 0 || b < 0) { return true; }
	if (a > n-1 || b > n-1) { return true; }
	return false;
}

int main() {
	std::cin>> n;
	int res[n][n]; /* this is [y][x] */
	memset(res, -1, sizeof(res[0][0])*n*n);
	// now we have the board initialized

	std::queue<std::pair<std::pair<int,int>,int> > comp; /* queue for the nodes to be computed ((x, y), iter) */
	comp.push(MP(MP(0,0), 0)); /* push starting point */

	int c = 0;
	std::pair<int,int> coord;
	while (!comp.empty()) {
		//std::cout<< "stack size: " << comp.size() << std::endl;
		coord = comp.front().first;
		c = comp.front().second;
		comp.pop();
		//std::cerr<< "current coords: " << coord.first << ' ' << coord.second << std::endl;
		//std::cerr<< "value at current coords: " << res[coord.first][coord.second] << std::endl;
		if (res[coord.second][coord.first] != -1) {
			if (res[coord.second][coord.first] < c) { continue; } /* already visited */
		}
		res[coord.second][coord.first] = c;
		c++;
		if(!outOfBounds(coord.first+1, coord.second-2)) { comp.push(MP(MP(coord.first+1, coord.second-2), c)); } /* top right */
		if(!outOfBounds(coord.first-1, coord.second-2)) { comp.push(MP(MP(coord.first-1, coord.second-2), c)); } /* top left */
		if(!outOfBounds(coord.first+2, coord.second+1)) { comp.push(MP(MP(coord.first+2, coord.second+1), c)); } /* right bottom */
		if(!outOfBounds(coord.first+2, coord.second-1)) { comp.push(MP(MP(coord.first+2, coord.second-1), c)); } /* right top */
		if(!outOfBounds(coord.first+1, coord.second+2)) { comp.push(MP(MP(coord.first+1, coord.second+2), c)); } /* bottom right */
		if(!outOfBounds(coord.first-1, coord.second+2)) { comp.push(MP(MP(coord.first-1, coord.second+2), c)); } /* bottom left */
		if(!outOfBounds(coord.first-2, coord.second-1)) { comp.push(MP(MP(coord.first-2, coord.second-1), c)); } /* left up */
		if(!outOfBounds(coord.first-2, coord.second+1)) { comp.push(MP(MP(coord.first-2, coord.second+1), c)); } /* left down */
		//std::cout<< "stack size: " << comp.size() << std::endl;
	}
	for (int y = 0; y < n; y++) {
		for (int x = 0; x < n; x++) {
			std::cout<< res[y][x] << ' ';
		}
		std::cout<< std::endl;
	}
	return 0;
}

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

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

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

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