Submission #1517789

---

Source Code Expand

import std.stdio, std.string, std.array, std.conv, std.algorithm, std.typecons, std.range, std.container, std.math, std.algorithm.searching;

void main(){
    auto kn=readln().chomp.split.map!(to!int).array;
    auto k=kn[0];
    auto n=kn[1];

    string[string] vws;
    foreach(i;0..n){
        auto vw=readln().chomp.split.array;
        vws[vw[0]]=vw[1];
    }

    auto numbers=iota(1,k+1).map!(to!string).map!"a[0]".array;
    for(int count=0;;++count)
    {
        int[char] lenSet;
        foreach(i,num;numbers){lenSet[num]=(count/(3^^i))%3+1;}
        auto res=validate(vws,lenSet);
        if(res!=null){
            foreach(num;numbers)writeln(res[num]);
            return;
        }
    }
}

auto validate(string[string] vws, int[char] lengthSet){
    string[char] resultSet;

    bool check(char key, string str){
        if(key in resultSet)return resultSet[key]==str;
        resultSet[key]=str;
        return true;
    }

    foreach(keys,line; vws){
        auto index=0;
        foreach(key;keys){
            auto len=lengthSet[key];
            if(line.length<index+len)return null;
            if(!check(key,line[index..index+len]))return null;
            index+=len;
        }
        if(index!=line.count)return null;
    }
    return resultSet;
}

Submission Info

Judge Result