Submission #2702101


Source Code Expand

s = input()
t = input()

def match(s1, t):
    return all(a in (b, '?') for a, b in zip(s1, t))

substrings = [s[i:i+len(t)] for i in range(len(s)-len(t)+1)]
res = 'UNRESTORABLE'
for ss in reversed(substrings):
    if match(ss, t):
        left, _, right = s.rpartition(ss)
        res = left + t + right
        res = res.replace('?', 'a')
        break
print(res)

Submission Info

Submission Time
Task C - Dubious Document 2
User zehnpaard
Language Python (3.4.3)
Score 300
Code Size 379 Byte
Status AC
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 14
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 17 ms 3064 KB
in02.txt AC 17 ms 3060 KB
in03.txt AC 17 ms 3064 KB
in04.txt AC 17 ms 3060 KB
in05.txt AC 17 ms 2940 KB
in06.txt AC 17 ms 3060 KB
in07.txt AC 17 ms 3060 KB
in08.txt AC 17 ms 3064 KB
in09.txt AC 17 ms 3060 KB
in10.txt AC 17 ms 3060 KB
in11.txt AC 17 ms 2940 KB
in12.txt AC 17 ms 3064 KB
s1.txt AC 17 ms 3060 KB
s2.txt AC 17 ms 3060 KB