提出 #16316230

---

ソースコード 拡げる

// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std, core.bitop;
// dfmt on
void main()
{
    auto input = stdin.byLine.map!split.joiner;

    string S;
    S = input.front.to!string;
    input.popFront;

    string T;
    T = input.front.to!string;
    input.popFront;

    solve(S, T);
}

void solve(string S, string T)
{
    iota(S.length - T.length + 1).map!(x => eval(S[x .. x + T.length], T))
        .reduce!min().writeln;
}

long eval(string s, string t)
{
    dprint(s, t);
    long ret;
    foreach (i; 0 .. s.length)
    {
        ret += s[i] != t[i];
    }
    return ret;
}

提出情報

ジャッジ結果