Submission #16618964
Source Code Expand
N,Q = gets.split.map(&:to_i)
STX = N.times.map{
s,t,x = gets.split.map(&:to_i)
next s-x,t-x,x
}.sort_by!{|s,| s }
D = Q.times.map{ gets.to_i }
min = []
puts D.map{|d|
while ! STX.empty? && STX[0][0] <= d
_,t,x = STX.shift
i = min.bsearch_index{|_,xm| x<xm }||min.size
j = min.bsearch_index{|tm,| t<tm }||min.size
min[i...j] = i<=j ? [[t,x]] : []
end
min.shift(min.index{|tm,| d<tm }||min.size)
next min.empty? ? -1 : min[0][1]
}
Submission Info
| Submission Time | |
|---|---|
| Task | E - Roadwork |
| User | ds14050 |
| Language | Ruby (2.7.1) |
| Score | 500 |
| Code Size | 465 Byte |
| Status | AC |
| Exec Time | 721 ms |
| Memory | 35536 KiB |
Judge Result
| Set Name | All | Sample | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 500 / 500 | 0 / 0 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| All | killer_01, killer_02, killer_03, killer_04, random_dense, random_max, random_small_01, random_small_02, random_small_03, random_small_04, random_small_05, random_small_06, random_small_07, random_small_08, sample_01 |
| Sample | sample_01 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| killer_01 | AC | 679 ms | 35156 KiB |
| killer_02 | AC | 681 ms | 35120 KiB |
| killer_03 | AC | 694 ms | 35536 KiB |
| killer_04 | AC | 362 ms | 24080 KiB |
| random_dense | AC | 721 ms | 35172 KiB |
| random_max | AC | 696 ms | 35200 KiB |
| random_small_01 | AC | 64 ms | 14044 KiB |
| random_small_02 | AC | 59 ms | 14256 KiB |
| random_small_03 | AC | 68 ms | 14328 KiB |
| random_small_04 | AC | 67 ms | 14392 KiB |
| random_small_05 | AC | 65 ms | 14120 KiB |
| random_small_06 | AC | 65 ms | 14308 KiB |
| random_small_07 | AC | 67 ms | 14244 KiB |
| random_small_08 | AC | 64 ms | 14052 KiB |
| sample_01 | AC | 68 ms | 14208 KiB |