Submission #4655639


Source Code Expand

import bisect

N, K = input().split()
dList = [int(x) for x in input().split()]
useList = [0,1,2,3,4,5,6,7,8,9]
for d in dList:
    useList.remove(d)
result = ''
if int(N[0]) > max(useList):
    # 桁上げが必要
    if useList[0] != 0:
        result += str(useList[0])
    else:
        result += str(useList[1])
    result += str(useList[0])*(len(N)-1)
else:
    for i in range(len(N)):
        a = int(N[i])
        if a in useList:
            result += N[i]
            continue
        else:
            if a > max(useList):
                result = result[:-1]
                result += str(useList[bisect.bisect_right(useList, int(N[i-1]))])
                result += str(useList[0])*(len(N)-i)
            else:
                result += str(useList[bisect.bisect_right(useList, a)])
                result += str(useList[0])*(len(N)-i-1)
            break
print(result)

Submission Info

Submission Time
Task C - Iroha's Obsession
User tonami
Language Python (3.4.3)
Score 0
Code Size 913 Byte
Status RE
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status AC
AC × 7
WA × 1
RE × 2
Set Name Test Cases
Sample
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_X_01.txt, subtask1_X_02.txt, subtask1_X_03.txt, subtask1_X_04.txt, subtask1_X_05.txt, subtask1_X_06.txt, subtask1_X_07.txt, subtask1_X_08.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 18 ms 3064 KB
subtask0_sample_02.txt AC 18 ms 3064 KB
subtask1_X_01.txt AC 17 ms 3064 KB
subtask1_X_02.txt RE 18 ms 3064 KB
subtask1_X_03.txt AC 18 ms 3064 KB
subtask1_X_04.txt WA 18 ms 3064 KB
subtask1_X_05.txt AC 18 ms 3064 KB
subtask1_X_06.txt RE 18 ms 3064 KB
subtask1_X_07.txt AC 18 ms 3064 KB
subtask1_X_08.txt AC 18 ms 3064 KB