Discussion @ 2010. Sasha the Young Grandmaster @ Timus Online Judge

Novopashin 37 Test [2] // Problem 2010. Sasha the Young Grandmaster 14 Apr 2015 01:38

1508090114 i got AC，perhaps be useful for you // Problem 2010. Sasha the Young Grandmaster 23 Jan 2017 11:39

spidey #wa 20 What's wrong ? [1] // Problem 2010. Sasha the Young Grandmaster 16 Feb 2016 12:30

This is my code

import java.util.*;

public class Task_2010 {
static void kingStep(int n, int x, int y){
long countKing = 0;
if((x - 1) > 0) countKing++;
if((x - 1) > 0 && y + 1 <= n) countKing++;
if((y + 1) <= n) countKing++;
if((x + 1) <= n && (y + 1) <= n) countKing++;
if((x + 1) <= n) countKing++;
if((x + 1) <= n && (y - 1) > 0) countKing++;
if((y - 1) > 0) countKing++;
if((x - 1) > 0 && (y - 1) > 0) countKing++;
System.out.println("King: " + countKing);
}
static void knightStep(int n, int x, int y){
long countKnight = 0;
if((x - 2) > 0 && (y + 1) <= n) countKnight++;
if((x - 2) > 0 && (y - 1) > 0) countKnight++;
if((y + 2) <= n && (x - 1) > 0) countKnight++;
if((y + 2) <= n && (x + 1) <= n) countKnight++;
if((x + 2) <= n && (x + 1) <= n) countKnight++;
if((x + 2) <= n && (y - 1) > 0) countKnight++;
if((y - 2) > 0 && (x + 1) <= n) countKnight++;
if((y - 2) > 0 && (x - 1) > 0) countKnight++;
System.out.println("Knight: " + countKnight);
}
static long bishopStep(int n, int x, int y) {
long countBishop = 0;
int left = x - 1;
int right = n - x;
if(y + left <= n){
    countBishop += left;
} else countBishop += n - y;
if(y + right <= n){
    countBishop += right;
} else countBishop += n - y;
if(y - left > 0){
    countBishop += left;
} else countBishop += y - 1;
if(y - right > 0){
    countBishop += right;
} else countBishop += y - 1;
System.out.println("Bishop: " + countBishop);
return countBishop;
}
static long rookStep(int n, int x, int y){
long countRook = (x - 1) + (n - x) + (y - 1) + (n - y);
System.out.println("Rook: " + countRook);
return countRook;

}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();

kingStep(n,x,y);
knightStep(n,x,y);
long queen = (bishopStep(n,x,y) + rookStep(n,x,y));
System.out.println("Queen: " + queen);

}
}

shadow_monk Re: #wa 20 What's wrong ? // Problem 2010. Sasha the Young Grandmaster 27 Nov 2016 17:30

опечатка в knightStep.

Egor An interesting way of coding it // Problem 2010. Sasha the Young Grandmaster 18 Nov 2016 02:11

IlushaMax If you need good tests see it: // Problem 2010. Sasha the Young Grandmaster 10 Jul 2016 14:09

Ivan Metelev UFU SESC Give me some tests please [4] // Problem 2010. Sasha the Young Grandmaster 28 Oct 2014 07:14

I have WA#16, give me some tests please

Edited by author 09.11.2014 18:38

Ivan Metelev No subject [3] // Problem 2010. Sasha the Young Grandmaster 9 Nov 2014 17:56

Edited by author 09.11.2014 18:35

Edited by author 09.11.2014 18:35

Ivan Metelev Re: No subject [2] // Problem 2010. Sasha the Young Grandmaster 1 Jun 2016 11:12

I can poste my bad code, can someone help me?

var
a, b, n, x, y: int64;

begin
readln(n, x, y);
write('King: ');
if n = 1 then writeln(0) else
if ((x = 1) and (y = 1)) or ((x = n) and (y = 1)) or ((x = 1) and (y = n)) or ((x = n) and (y = n)) then writeln(3) else
if (x = 1) or (y = 1) or (x = n) or (y = n) then writeln(5) else writeln(8);
write('Knight: ');
if (n = 1) or (n = 2) or ((n = 3) and (x = 2) and (y = 2)) then writeln(0) else
if (((y = 1) and (x = 1)) or ((y = n) and (x = n)) or ((y = 1) and (x = n)) or ((y = n) and (x = 1))) or (n = 3) and ((x = 2) or (y = 2)) then writeln(2) else
if ((x = 2) and ((y = 1) or (y = n))) or ((x = n - 1) and ((y = 1) or (y = n)) or ((y = 2) and ((x = 1) or (x = n))) or ((Y = N - 1) and ((x = 1) or (x = n)))) then writeln(3) else
if (((x >= 3) and (x <= n - 2)) and ((y = 1) or (y = n))) or (((y >= 3) and (y <= n - 2)) and ((x = 1) or (x = n))) or ((x = 2) and ((y = 2) or (y = n - 1)) or ((x = n - 1) and ((y = 2) or (y = n - 1)))) then writeln(4) else
if (((x >= 3) and (x <= n - 2)) and ((y = 2) or (y = n - 1))) or (((y >= 3) and (y <= n - 2)) and ((x = 1) or (x = n))) then writeln(6) else writeln(8);

if n = 1 then a := 0 else
if (n - x >= x) and (n - x >= n - y) and (n - x >= y) then a := (n - 1) + 2 * (x - 1) else
if (x >= n - x) and (x >= n - y) and (x >= y) then a := (n - 1) + 2 * (n - x) else
if (y >= x) and (y >= n - y) and (y >= n - x) then a := (n - 1) + 2 * (n - y) else
if (n - y >= x) and (n - y >= n - x) and (n - y >= y) then a := (n - 1) + 2 * (y - 1);
if n = 1 then b := 0 else b := (n - 1) * 2;
writeln('Bishop: ', a);
writeln('Rook: ', b);
writeln('Queen: ', a + b);
end.

Edited by author 01.06.2016 11:32

d_m Re: No subject [1] // Problem 2010. Sasha the Young Grandmaster 2 Jun 2016 14:44

I don't know where is problem in your code. But you can insert in the beginning something like that:

if x > (n + 1) div 2 then x := n + 1 - x;
if y > (n + 1) div 2 then y := n + 1 - y;

and remove all comparisons with n. It will make your code much simpler.

Jane Soboleva (SumNU) Re: No subject // Problem 2010. Sasha the Young Grandmaster 2 Jun 2016 17:15

A much more simple approach would be creating something like
function InBounds(x0, y0, xshift, yshift: longint): boolean;
begin
    inc(x0, xshift); inc(y0, yshift);
    InBounds:=((x0 >= 1) and (x0 <= N) and (y0 >= 1) and (y0 <= N));
end;
This will allow to check king and knight in a much more simple and elegant way.
King:
res:=-1;
for i:=-1 to 1 do
    for j:=-1 to 1 do
        if InBounds(x0, y0, i, j) then inc(res);
writeln('King: ', res);
Knight:
res:=0;
for i:=1 to 2 do //length before turn
    for j:=0 to 1 do //sign 1
        for k:=0 to 1 do begin //sign 2
            if InBounds(x0, y0, (j + j - 1) * i, (k + k - 1) * (3 - i)) then inc(res);
        end;
writeln('Knight: ', res);

For rook, it's always N + N - 2, even for N = 1, so there was no need to specifically bring up that case...
Queen is rook + bishop, and bishop i'd say is the "hardest" part here, but well, you just take the minimum of squares he can move to in each 4 directions, just be attentive...
Good luck!

spidey Test #20 // Problem 2010. Sasha the Young Grandmaster 19 Feb 2016 17:59

picture Test #15 // Problem 2010. Sasha the Young Grandmaster 19 Dec 2015 16:24

[kubsu] Eugene Kudinov WA8 Help // Problem 2010. Sasha the Young Grandmaster 26 Nov 2015 21:34

Roman Samokhin WA 10 some ideas>? // Problem 2010. Sasha the Young Grandmaster 9 Jan 2015 06:02

Frank Test #8. Can you give me more test? [1] // Problem 2010. Sasha the Young Grandmaster 22 Aug 2014 17:37

6eJIa9IzZzTeHb TL #33 // Problem 2010. Sasha the Young Grandmaster 9 Jul 2014 05:15

NickC8 Some tests [3] // Problem 2010. Sasha the Young Grandmaster 16 Nov 2013 02:53

Discussion of Problem 2010. Sasha the Young Grandmaster