Submission #1548199


Source Code Expand

x1,y1,x2,y2,n,*a=`dd`.split.map &:to_i
xf=yf=1
x1>x2&&(x1,x2,xf=x2,x1,-1)
y1>y2&&(y1,y2,yf=y2,y1,-1)
v=a.each_slice(2).select{|x,y|x1<=x&&x<=x2&&y1<=y&&y<=y2}.map{|x,y|[x*xf,y*yf]}.sort
d=[1<<30]*s=v.size
v.each{|x,y|i=(0...s).bsearch{|i|d[i]>=y};d[i]=y}
n=(0...s).bsearch{|i|d[i]>=1<<30}||s
p 100.0*(x2-x1+y2-y1)-20*n+5*(n+(n>[x2-x1,y2-y1].min ? 1:0))*Math::PI

Submission Info

Submission Time
Task C - Fountain Walk
User leafmoon
Language Ruby (2.3.3)
Score 900
Code Size 369 Byte
Status AC
Exec Time 1442 ms
Memory 44020 KB

Compile Error

./Main.rb:1: warning: `&' interpreted as argument prefix
./Main.rb:7: warning: shadowing outer local variable - i

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 47
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt
Case Name Status Exec Time Memory
sample_01.txt AC 9 ms 2040 KB
sample_02.txt AC 8 ms 2044 KB
sample_03.txt AC 7 ms 2044 KB
subtask_1_01.txt AC 7 ms 2044 KB
subtask_1_02.txt AC 7 ms 2044 KB
subtask_1_03.txt AC 7 ms 2044 KB
subtask_1_04.txt AC 7 ms 2044 KB
subtask_1_05.txt AC 7 ms 2044 KB
subtask_1_06.txt AC 7 ms 2044 KB
subtask_1_07.txt AC 7 ms 2044 KB
subtask_1_08.txt AC 7 ms 2044 KB
subtask_1_09.txt AC 82 ms 13064 KB
subtask_1_10.txt AC 163 ms 29452 KB
subtask_1_11.txt AC 48 ms 8324 KB
subtask_1_12.txt AC 1437 ms 43948 KB
subtask_1_13.txt AC 177 ms 31632 KB
subtask_1_14.txt AC 85 ms 13196 KB
subtask_1_15.txt AC 46 ms 7820 KB
subtask_1_16.txt AC 1442 ms 43944 KB
subtask_1_17.txt AC 144 ms 25232 KB
subtask_1_18.txt AC 123 ms 21388 KB
subtask_1_19.txt AC 120 ms 21000 KB
subtask_1_20.txt AC 1437 ms 43952 KB
subtask_1_21.txt AC 1437 ms 43944 KB
subtask_1_22.txt AC 1442 ms 43940 KB
subtask_1_23.txt AC 1442 ms 43948 KB
subtask_1_24.txt AC 8 ms 2044 KB
subtask_1_25.txt AC 8 ms 2044 KB
subtask_1_26.txt AC 8 ms 2044 KB
subtask_1_27.txt AC 8 ms 2044 KB
subtask_1_28.txt AC 251 ms 36748 KB
subtask_1_29.txt AC 252 ms 37640 KB
subtask_1_30.txt AC 1429 ms 43832 KB
subtask_1_31.txt AC 991 ms 44020 KB
subtask_1_32.txt AC 979 ms 43896 KB
subtask_1_33.txt AC 974 ms 43892 KB
subtask_1_34.txt AC 973 ms 43896 KB
subtask_1_35.txt AC 1003 ms 43964 KB
subtask_1_36.txt AC 986 ms 43960 KB
subtask_1_37.txt AC 993 ms 43960 KB
subtask_1_38.txt AC 992 ms 43960 KB
subtask_1_39.txt AC 993 ms 43960 KB
subtask_1_40.txt AC 991 ms 43960 KB
subtask_1_41.txt AC 986 ms 43964 KB