Submission #11286459
Source Code Expand
Copy
K, N = gets.split(' ').map(&:to_i)A = gets.split(' ').map(&:to_i)A << (A.min + K)diff = []N.times do |i|diff << A[i + 1] - A[i]endputs K - diff.max
K, N = gets.split(' ').map(&:to_i)
A = gets.split(' ').map(&:to_i)
A << (A.min + K)
diff = []
N.times do |i|
diff << A[i + 1] - A[i]
end
puts K - diff.max
Submission Info
| Submission Time | |
|---|---|
| Task | C - Traveling Salesman around Lake |
| User | msm10 |
| Language | Ruby (2.3.3) |
| Score | 300 |
| Code Size | 167 Byte |
| Status | AC |
| Exec Time | 140 ms |
| Memory | 17028 KB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01, sample_02 |
| All | hand_01, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, random_09, random_10, random_11, random_12, random_13, random_14, random_15, random_16, random_17, random_18, random_19, random_20, sample_01, sample_02 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| hand_01 | AC | 132 ms | 17028 KB |
| random_01 | AC | 86 ms | 11580 KB |
| random_02 | AC | 131 ms | 16900 KB |
| random_03 | AC | 131 ms | 16900 KB |
| random_04 | AC | 32 ms | 4736 KB |
| random_05 | AC | 131 ms | 16900 KB |
| random_06 | AC | 131 ms | 17028 KB |
| random_07 | AC | 128 ms | 16516 KB |
| random_08 | AC | 131 ms | 16900 KB |
| random_09 | AC | 140 ms | 16900 KB |
| random_10 | AC | 67 ms | 9088 KB |
| random_11 | AC | 131 ms | 17028 KB |
| random_12 | AC | 132 ms | 17028 KB |
| random_13 | AC | 132 ms | 17028 KB |
| random_14 | AC | 132 ms | 17028 KB |
| random_15 | AC | 132 ms | 17028 KB |
| random_16 | AC | 132 ms | 17028 KB |
| random_17 | AC | 133 ms | 17028 KB |
| random_18 | AC | 133 ms | 17028 KB |
| random_19 | AC | 133 ms | 17028 KB |
| random_20 | AC | 132 ms | 17028 KB |
| sample_01 | AC | 7 ms | 1788 KB |
| sample_02 | AC | 7 ms | 1788 KB |