Submission #6093256


Source Code Expand

N = int(input())
T =[ list(map(list,input().split("-"))) for i in range(N)]

for i in range(N):
    for j in range(2):
        t = int(T[i][j][-1])
        if j == 0:
            if t > 0 and t < 5:
                T[i][j][-1] = "0"
            elif t <10 and t >5:
                T[i][j][-1] = "5"
        elif j == 1:
            if t > 0 and t < 5:
                T[i][j][-1] = "5"
            elif t <10 and t >5:
                T[i][j][-1] = "0"
                if T[i][j][-2] == "5":
                    T[i][j][-2] = "0"
                    if int(T[i][j][0]+T[i][j][1])<9:
                        s = str(int(T[i][j][0]+T[i][j][1])+1)
                        T[i][j][0] = 0
                        T[i][j][1] = s
                    elif int(T[i][j][0]+T[i][j][1]) > 8:
                        s = str(int(T[i][j][0]+T[i][j][1])+1)
                        T[i][j][0] = s[0]
                        T[i][j][1] = s[1]
                else:
                    T[i][j][-2] = str(int(T[i][j][-2]) +1)

Ti = []
for i in range(N):
   Ti.append([(int("".join(map(str,T[i][0])))),(int("".join(map(str,T[i][1]))))])

Ti = sorted(Ti,key=lambda x:x[0])

start = Ti[0][0]
end = Ti[0][1]
ans = []
for i in range(1,N):
    if Ti[i][0] > end:
        ans.append([start,end])
        start = Ti[i][0]
        end = Ti[i][1]
    else:
        end = max(end ,Ti[i][1])
    
ans.append([start,end])
for a in ans:
    if a[0] < 1000:
        s = "0"*(4 - len(str(a[0]))) + str(a[0])
    else:
        s = str(a[0])
    if a[1] < 1000:
        e = "0"*(4 - len(str(a[1]))) + str(a[1])
    else:
        e = str(a[1])
    print(s+"-"+e)
   

Submission Info

Submission Time
Task D - 感雨時刻の整理
User alexara1123
Language Python (3.4.3)
Score 100
Code Size 1686 Byte
Status AC
Exec Time 332 ms
Memory 20960 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 17 ms 3192 KB
00_sample_02.txt AC 17 ms 3192 KB
00_sample_03.txt AC 17 ms 3192 KB
cho_cho_chokudai.txt AC 332 ms 18916 KB
chokudai_ga_cho.txt AC 271 ms 20580 KB
test_01.txt AC 19 ms 3192 KB
test_02.txt AC 19 ms 3192 KB
test_03.txt AC 19 ms 3192 KB
test_04.txt AC 19 ms 3192 KB
test_05.txt AC 19 ms 3192 KB
test_06.txt AC 19 ms 3304 KB
test_07.txt AC 19 ms 3192 KB
test_08.txt AC 18 ms 3192 KB
test_09.txt AC 23 ms 3304 KB
test_10.txt AC 23 ms 3432 KB
test_11.txt AC 22 ms 3304 KB
test_12.txt AC 21 ms 3304 KB
test_13.txt AC 19 ms 3192 KB
test_14.txt AC 22 ms 3304 KB
test_15.txt AC 23 ms 3432 KB
test_16.txt AC 19 ms 3192 KB
test_17.txt AC 22 ms 3304 KB
test_18.txt AC 19 ms 3192 KB
test_19.txt AC 21 ms 3304 KB
test_20.txt AC 22 ms 3304 KB
test_21.txt AC 285 ms 20696 KB
test_22.txt AC 283 ms 20836 KB
test_23.txt AC 284 ms 20708 KB
test_24.txt AC 284 ms 20836 KB
test_25.txt AC 289 ms 20824 KB
test_26.txt AC 282 ms 20576 KB
test_27.txt AC 266 ms 19940 KB
test_28.txt AC 286 ms 20948 KB
test_29.txt AC 18 ms 3192 KB
test_30.txt AC 18 ms 3192 KB
test_31.txt AC 57 ms 5736 KB
test_32.txt AC 18 ms 3192 KB
test_33.txt AC 190 ms 14960 KB
test_34.txt AC 17 ms 3192 KB
test_35.txt AC 20 ms 3304 KB
test_36.txt AC 289 ms 20952 KB
test_37.txt AC 283 ms 20452 KB
test_38.txt AC 283 ms 20832 KB
test_39.txt AC 292 ms 20960 KB
test_40.txt AC 289 ms 20708 KB
test_41.txt AC 252 ms 19684 KB
test_42.txt AC 267 ms 19940 KB
test_43.txt AC 253 ms 20068 KB