Submission #1791351


Source Code Expand

import std.stdio;
import std.string;
import std.conv;
import std.bigint;
import std.typecons;
import std.algorithm;
import std.array;
import std.math;
import std.range;
 
void main() {
    auto S = readln.chomp;
    auto T = readln.chomp;
    auto findResult = iota(S.length-T.length+1).find!(i => iota(T.length).all!(j => S[i+j] == T[j] || S[i+j] == '?'));
    if (findResult.length == 0) {
        writeln("UNRESTORABLE");
        return;
    }
    auto minPos = findResult[0];
    foreach (i; 0..minPos) {
        if (S[i] == '?') write("a");
        else write(S[i]);
    }
    write(T);
    foreach (i;minPos+T.length..S.length) {
        if (S[i] == '?') write("a");
        else write(S[i]);
    }
    writeln;
}

Submission Info

Submission Time
Task C - Dubious Document 2
User sobaya
Language D (DMD64 v2.070.1)
Score 0
Code Size 750 Byte
Status WA
Exec Time 1 ms
Memory 256 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 WA 1 ms 256 KB
in02.txt AC 1 ms 256 KB
in03.txt AC 1 ms 256 KB
in04.txt AC 1 ms 256 KB
in05.txt WA 1 ms 256 KB
in06.txt AC 1 ms 256 KB
in07.txt AC 1 ms 256 KB
in08.txt WA 1 ms 256 KB
in09.txt AC 1 ms 256 KB
in10.txt AC 1 ms 256 KB
in11.txt AC 1 ms 256 KB
in12.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB