Submission #415453


Source Code Expand

import copy

N, D, K = map(int, input().split())
movelist = [list(map(int, input().split())) for _ in range(D)]
goallist = [list(map(int, input().split())) for _ in range(K)]
goalday = [0 for _ in range(K)]
day = 0
for m in movelist:
    li = []
    for i in range(len(goallist)):
        if goallist[i][0] < goallist[i][1] and m[0] <= goallist[i][0] < m[1]:
            if goallist[i][1] <= m[1]:
                goallist[i][0] = goallist[i][1]
                li.append(i)
            else:
                goallist[i][0] = m[1]
        elif goallist[i][0] > goallist[i][1] and m[0] < goallist[i][0] <= m[1]:
            if m[0] <= goallist[i][1]:
                goallist[i][0] = goallist[i][1]
                li.append(i)
            else:
                goallist[i][0] = m[0]
    day += 1
    for i in li:
        goalday[i] = str(day)
    if 0 not in goalday:
        break

print("\n".join(goalday))

Submission Info

Submission Time
Task C - 民族大移動
User yumechi
Language Python (3.4.2)
Score 100
Code Size 936 Byte
Status AC
Exec Time 1598 ms
Memory 9968 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 49
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask1_43.txt, subtask1_44.txt, subtask1_45.txt, subtask1_46.txt, subtask1_47.txt, subtask1_48.txt, subtask1_49.txt
Case Name Status Exec Time Memory
sample_01.txt AC 783 ms 7784 KB
sample_02.txt AC 107 ms 7268 KB
sample_03.txt AC 108 ms 7392 KB
subtask1_01.txt AC 168 ms 8932 KB
subtask1_02.txt AC 197 ms 7776 KB
subtask1_03.txt AC 142 ms 8292 KB
subtask1_04.txt AC 169 ms 9316 KB
subtask1_05.txt AC 213 ms 9616 KB
subtask1_06.txt AC 180 ms 9444 KB
subtask1_07.txt AC 171 ms 9188 KB
subtask1_08.txt AC 207 ms 8388 KB
subtask1_09.txt AC 214 ms 9188 KB
subtask1_10.txt AC 124 ms 7780 KB
subtask1_11.txt AC 171 ms 9264 KB
subtask1_12.txt AC 137 ms 8292 KB
subtask1_13.txt AC 145 ms 7524 KB
subtask1_14.txt AC 178 ms 9572 KB
subtask1_15.txt AC 665 ms 9832 KB
subtask1_16.txt AC 383 ms 9824 KB
subtask1_17.txt AC 203 ms 9824 KB
subtask1_18.txt AC 196 ms 9828 KB
subtask1_19.txt AC 232 ms 9828 KB
subtask1_20.txt AC 195 ms 9824 KB
subtask1_21.txt AC 188 ms 9828 KB
subtask1_22.txt AC 197 ms 9824 KB
subtask1_23.txt AC 907 ms 9824 KB
subtask1_24.txt AC 189 ms 9828 KB
subtask1_25.txt AC 455 ms 9828 KB
subtask1_26.txt AC 336 ms 9828 KB
subtask1_27.txt AC 220 ms 9824 KB
subtask1_28.txt AC 192 ms 9824 KB
subtask1_29.txt AC 193 ms 9824 KB
subtask1_30.txt AC 192 ms 9828 KB
subtask1_31.txt AC 240 ms 9824 KB
subtask1_32.txt AC 214 ms 9824 KB
subtask1_33.txt AC 198 ms 9796 KB
subtask1_34.txt AC 190 ms 9828 KB
subtask1_35.txt AC 190 ms 9828 KB
subtask1_36.txt AC 194 ms 9824 KB
subtask1_37.txt AC 186 ms 9968 KB
subtask1_38.txt AC 193 ms 9828 KB
subtask1_39.txt AC 199 ms 9828 KB
subtask1_40.txt AC 194 ms 9828 KB
subtask1_41.txt AC 1453 ms 9828 KB
subtask1_42.txt AC 1483 ms 9824 KB
subtask1_43.txt AC 1434 ms 9844 KB
subtask1_44.txt AC 1598 ms 9824 KB
subtask1_45.txt AC 1366 ms 9836 KB
subtask1_46.txt AC 1427 ms 9824 KB
subtask1_47.txt AC 1475 ms 9828 KB
subtask1_48.txt AC 1390 ms 9824 KB
subtask1_49.txt AC 1558 ms 9816 KB