Submission #6142372


Source Code Expand

#coding: utf-8
import sys
L = sys.stdin.readlines()
N = int(L[0])

aqua = []
timez= []

for i in range(1, N+1):
    aqua.append(L[i].split('-'))

for i in range(0, N):
    tmp = []
    for j in range(2):
        # if (j == 0):
        #     hour = aqua[i][j][0] + aqua[i][j][1]
        #     minu = 0
        #     if (0 < int(aqua[i][j][3]) <= 4):
        #         minu = int(aqua[i][j][2]) * 10
        #     elif (int(aqua[i][j][3]) == 0 or int(aqua[i][j][3]) == 5):
        #         minu = str(aqua[i][j][2]) + str(aqua[i][j][3])
        #     elif (5 < int(aqua[i][j][3]) <= 9):
        #         minu = str(aqua[i][j][2]) + '5'
        # 
        # elif (j == 1):
        #     hour = aqua[i][j][0] + aqua[i][j][1]
        #     minu = 0
        #     if (0 < int(aqua[i][j][3]) <= 4):
        #         minu = str(aqua[i][j][2]) + '5'
        #     elif (int(aqua[i][j][3]) == 0 or int(aqua[i][j][3]) == 5):
        #         minu = str(aqua[i][j][2]) + str(aqua[i][j][3])
        #     elif (5 < int(aqua[i][j][3]) <= 9):
        #         minu = (int(aqua[i][j][2]) + 1) * 10
        if(j == 0):
            hour = aqua[i][j][0] + aqua[i][j][1]
            minu = 0
            if(0<int(aqua[i][j][3])<=4):
                minu = str(aqua[i][j][2]) + '0'
            elif(int(aqua[i][j][3])==0 or int(aqua[i][j][3])==5):
                minu = str(aqua[i][j][2])+str(aqua[i][j][3])
            elif(5<int(aqua[i][j][3])<=9):
                minu = str(aqua[i][j][2]) + '5'

        elif(j == 1):
            hour = aqua[i][j][0] + aqua[i][j][1]
            minu = 0
            if(0<int(aqua[i][j][3])<=4):
                minu = str(aqua[i][j][2]) + '5'
            elif(int(aqua[i][j][3])==0 or int(aqua[i][j][3])==5):
                minu = str(aqua[i][j][2])+str(aqua[i][j][3])
            elif(5<int(aqua[i][j][3])<=9):
                minu = str(int(aqua[i][j][2]) + 1) + '0'
        if(str(minu)=='60'):
            minu = '00'
            hour = int(hour)+1

        times = str(hour) + str(minu)
        tmp.append(times)
    timez.append(tmp)

for i in range(N):
    for j in range(2):
        timez[i][j] = int(timez[i][j])

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

start = timez[0][0]
ends = timez[0][1]
ans = []

if(N>=2):
    for i in range(1, N):
        if(start <= timez[i][0] <= ends):
            if(ends <= timez[i][1]):
                ends = timez[i][1]
                if(i == N-1):
                    ans.append((start, ends))
            else:
                if (i == N - 1):
                    ans.append((start, ends))
        else:
            ans.append((start, ends))
            start = timez[i][0]
            ends = timez[i][1]
            if(i == N-1):
                ans.append((start, ends))
else:
    ans.append((start, ends))

for i in range(len(ans)):
    for j in range(2):
        if(len(str(ans[i][j]))==1):
            tmp = '000'+str(ans[i][j])
        elif(len(str(ans[i][j]))==2):
            tmp = '00'+str(ans[i][j])
        elif(len(str(ans[i][j]))==3):
            tmp = '0'+str(ans[i][j])
        else:
            tmp = ans[i][j]

        print(tmp, end='')
        if (j%2 != 1):
            print('-', end='')
        else:
            print('')

Submission Info

Submission Time
Task D - 感雨時刻の整理
User berserker
Language Python (3.4.3)
Score 100
Code Size 3319 Byte
Status AC
Exec Time 278 ms
Memory 21644 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 18 ms 3320 KB
00_sample_02.txt AC 18 ms 3320 KB
00_sample_03.txt AC 18 ms 3320 KB
cho_cho_chokudai.txt AC 262 ms 21380 KB
chokudai_ga_cho.txt AC 264 ms 21508 KB
test_01.txt AC 20 ms 3368 KB
test_02.txt AC 20 ms 3368 KB
test_03.txt AC 20 ms 3368 KB
test_04.txt AC 20 ms 3368 KB
test_05.txt AC 20 ms 3368 KB
test_06.txt AC 20 ms 3320 KB
test_07.txt AC 19 ms 3320 KB
test_08.txt AC 19 ms 3320 KB
test_09.txt AC 22 ms 3368 KB
test_10.txt AC 23 ms 3368 KB
test_11.txt AC 21 ms 3368 KB
test_12.txt AC 21 ms 3320 KB
test_13.txt AC 19 ms 3320 KB
test_14.txt AC 22 ms 3368 KB
test_15.txt AC 24 ms 3368 KB
test_16.txt AC 19 ms 3320 KB
test_17.txt AC 22 ms 3368 KB
test_18.txt AC 20 ms 3320 KB
test_19.txt AC 21 ms 3320 KB
test_20.txt AC 22 ms 3320 KB
test_21.txt AC 278 ms 21644 KB
test_22.txt AC 268 ms 21644 KB
test_23.txt AC 259 ms 21644 KB
test_24.txt AC 270 ms 21644 KB
test_25.txt AC 266 ms 21640 KB
test_26.txt AC 274 ms 21632 KB
test_27.txt AC 259 ms 21260 KB
test_28.txt AC 272 ms 21632 KB
test_29.txt AC 18 ms 3320 KB
test_30.txt AC 18 ms 3320 KB
test_31.txt AC 56 ms 5800 KB
test_32.txt AC 18 ms 3320 KB
test_33.txt AC 179 ms 15272 KB
test_34.txt AC 18 ms 3320 KB
test_35.txt AC 20 ms 3320 KB
test_36.txt AC 270 ms 21644 KB
test_37.txt AC 267 ms 21644 KB
test_38.txt AC 260 ms 21628 KB
test_39.txt AC 257 ms 21632 KB
test_40.txt AC 269 ms 21636 KB
test_41.txt AC 264 ms 21252 KB
test_42.txt AC 260 ms 21636 KB
test_43.txt AC 258 ms 21516 KB