Submission #11485959

Source Code Expand

K, N = map(int, input().split())
A = list(map(int, input().split()))

A_aida = []
for i in range(N-1):
    A_aida.append(A[i+1]-A[i])

A_aida.append((K-A[-1]) + A[0])

print(K - max(A_aida))

Submission Info

Submission Time
Task C - Traveling Salesman around Lake
User Yukisuni
Language Python (3.4.3)
Score 300
Code Size 201 Byte
Status AC
Exec Time 117 ms
Memory 25840 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 23
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 113 ms 24728 KiB
random_01 AC 82 ms 16936 KiB
random_02 AC 110 ms 24560 KiB
random_03 AC 117 ms 25804 KiB
random_04 AC 37 ms 7592 KiB
random_05 AC 112 ms 24908 KiB
random_06 AC 117 ms 24764 KiB
random_07 AC 110 ms 22876 KiB
random_08 AC 114 ms 25840 KiB
random_09 AC 112 ms 24900 KiB
random_10 AC 66 ms 13604 KiB
random_11 AC 110 ms 24820 KiB
random_12 AC 116 ms 24756 KiB
random_13 AC 113 ms 24724 KiB
random_14 AC 114 ms 24732 KiB
random_15 AC 114 ms 24724 KiB
random_16 AC 113 ms 24724 KiB
random_17 AC 112 ms 24732 KiB
random_18 AC 111 ms 24724 KiB
random_19 AC 112 ms 24724 KiB
random_20 AC 113 ms 23576 KiB
sample_01 AC 17 ms 2940 KiB
sample_02 AC 17 ms 2940 KiB