Submission #51705862

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
K,X1,Y1,X2,Y2 = $<.read.split.map(&:to_i)
dx,dy = [(X2-X1).abs,(Y2-Y1).abs].sort
dy -= dx
kx,rx = dx.divmod K
ky,ry = dy.divmod K+K
f,t = false,true
warn [kx+ky+ky,[rx,rx+ry],K].inspect
p kx+ky+ky+case [0<rx,0<ry]
when [f,f]; 0
when [t,f]; 1
when [f,t]; 2
when [t,t]; [rx,ry].minmax.then{|m,x| x+x+m<=K+K } ? 2 : 3
end
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

K,X1,Y1,X2,Y2 = $<.read.split.map(&:to_i)
dx,dy = [(X2-X1).abs,(Y2-Y1).abs].sort
dy -= dx
kx,rx = dx.divmod K
ky,ry = dy.divmod K+K
f,t = false,true
warn [kx+ky+ky,[rx,rx+ry],K].inspect
p kx+ky+ky+case [0<rx,0<ry]
when [f,f]; 0
when [t,f]; 1
when [f,t]; 2
when [t,t]; [rx,ry].minmax.then{|m,x| x+x+m<=K+K } ? 2 : 3
end

Submission Info

Judge Result