Task: | Ratsun reitit |
Sender: | iRobo |
Submission time: | 2020-10-10 18:55:47 +0300 |
Language: | Java |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 27 |
#2 | ACCEPTED | 31 |
#3 | ACCEPTED | 42 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#7 | ACCEPTED | 0.17 s | 1, 2, 3 | details |
#8 | ACCEPTED | 0.23 s | 2, 3 | details |
#9 | ACCEPTED | 0.27 s | 2, 3 | details |
#10 | ACCEPTED | 0.27 s | 2, 3 | details |
#11 | ACCEPTED | 0.47 s | 3 | details |
#12 | ACCEPTED | 0.86 s | 3 | details |
#13 | ACCEPTED | 0.89 s | 3 | details |
Code
import java.util.Scanner; public class Main { static int[][] chessBoard; static int n; public static void main(String[] args) { Scanner input = new Scanner(System.in); n = input.nextInt(); chessBoard = new int[n+4][n+4]; int x = 0, y = 0; recursiveSolve(1, y, x); for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { System.out.print(chessBoard[i][j]-1 + " "); } System.out.println(); } } public static void recursiveSolve(int depth, int y, int x) { chessBoard[y][x] = depth; if(y+2 < n && y+2 >= 0 && x+1 < n && x+1 >= 0) {if(chessBoard[y+2][x+1] > depth+1 || chessBoard[y+2][x+1] == 0) {recursiveSolve(depth+1,y+2,x+1);}} if(y+2 < n && y+2 >= 0 && x-1 < n && x-1 >= 0) {if(chessBoard[y+2][x-1] > depth+1 || chessBoard[y+2][x-1] == 0) {recursiveSolve(depth+1,y+2,x-1);}} if(y-2 < n && y-2 >= 0 && x+1 < n && x+1 >= 0) {if(chessBoard[y-2][x+1] > depth+1 || chessBoard[y-2][x+1] == 0) {recursiveSolve(depth+1,y-2,x+1);}} if(y-2 < n && y-2 >= 0 && x-1 < n && x-1 >= 0) {if(chessBoard[y-2][x-1] > depth+1 || chessBoard[y-2][x-1] == 0) {recursiveSolve(depth+1,y-2,x-1);}} if(y+1 < n && y+1 >= 0 && x+2 < n && x+2 >= 0) {if(chessBoard[y+1][x+2] > depth+1 || chessBoard[y+1][x+2] == 0) {recursiveSolve(depth+1,y+1,x+2);}} if(y+1 < n && y+1 >= 0 && x-2 < n && x-2 >= 0) {if(chessBoard[y+1][x-2] > depth+1 || chessBoard[y+1][x-2] == 0) {recursiveSolve(depth+1,y+1,x-2);}} if(y-1 < n && y-1 >= 0 && x+2 < n && x+2 >= 0) {if(chessBoard[y-1][x+2] > depth+1 || chessBoard[y-1][x+2] == 0) {recursiveSolve(depth+1,y-1,x+2);}} if(y-1 < n && y-1 >= 0 && x-2 < n && x-2 >= 0) {if(chessBoard[y-1][x-2] > depth+1 || chessBoard[y-1][x-2] == 0) {recursiveSolve(depth+1,y-1,x-2);}} } }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2 |
user output |
---|
0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
5 |
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 |
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 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
6 |
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 ... |
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 ... |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
7 |
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 ... |
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 |
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 ... |
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 |
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 ... |
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 |
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 ... |
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 |
correct output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... |
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 |
correct output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... |
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 |
correct output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... |
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 |
correct output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... |
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 |
correct output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... |
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 |
correct output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... |
user output |
---|
0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ... Truncated |