Submission #4065490


Source Code Expand

S = input()
T = input()


def check1(s):
    ret = True
    for i in range(len(T)):
        if s[i] != '?' and s[i] != T[i]:
            ret = False
            break
    return ret


candidate = []
for i in range(len(S)-len(T)+1):
    if check1(S[i:i+len(T)]):
        candidate.append(i)

if not candidate:
    print('UNRESTORABLE')
else:
    S = S[:candidate[-1]] + T
    for i in range(len(S)):
        if S[i] == '?':
            S = S[:i] + 'a' + S[i+1:]
    print(S)

Submission Info

Submission Time
Task C - Dubious Document 2
User y011d4
Language Python (3.4.3)
Score 0
Code Size 500 Byte
Status WA
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
WA × 3
Set Name Test Cases
Sample s1.txt, s2.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
in01.txt AC 18 ms 3064 KB
in02.txt AC 18 ms 3064 KB
in03.txt AC 18 ms 3060 KB
in04.txt AC 18 ms 3064 KB
in05.txt WA 18 ms 3064 KB
in06.txt WA 18 ms 3064 KB
in07.txt WA 18 ms 3064 KB
in08.txt AC 18 ms 3064 KB
in09.txt AC 18 ms 3064 KB
in10.txt AC 18 ms 3064 KB
in11.txt AC 18 ms 3064 KB
in12.txt AC 18 ms 3064 KB
s1.txt AC 18 ms 3064 KB
s2.txt AC 18 ms 3064 KB