Submission #31770604


Source Code Expand

□ = Array.new(1500){[]}<<[[0,0]]
○ = 200.step(2,-2).map{|d|
	l = (d..1500).find{|l| □[l][0] }
	x,y = □[l].pop
	(x+d).step(x+l-d,d){|x|
		□[d]<<[x,y]
	}
	(y+d).step(y+l-d,d){|y|
		□[d]<<[x,y]
	}
	□[l-d]<<[x+d,y+d] if d<l
	next [x,y]
}.reverse
puts ○.map.with_index(1){|(x,y),r| "#{x+r} #{y+r}" }

Submission Info

Submission Time
Task F - 100個の円
User ds14050
Language Ruby (2.7.1)
Score 100
Code Size 325 Byte
Status AC
Exec Time 60 ms
Memory 14392 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 1
Set Name Test Cases
All test.txt
Case Name Status Exec Time Memory
test.txt AC 60 ms 14392 KiB