C. String Reconstruction(Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals))

链接:link.
并查集优化可避免重复赋值。

int n,f[2000050];
char s[2000050],t[1000010];
int g(int x){return x==f[x]?x:f[x]=g(f[x]);}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    for(int i=0;i<=2000000;i++)f[i]=i;
    int len=0;
    cin>>n;
    for(int vv=0;vv<n;vv++)
    {
        int k;
        cin>>t>>k;
        int l=strlen(t);
        while(k--)
        {
            int x;cin>>x;
            len=max(len,x+l-1);
            int y=x;
            while((y=g(y))<=x+l-1)
            {
                s[y]=t[y-x];
                f[y]=y+1;
            }
        }
    }
    for(int i=1;i<=len;i++)if(!s[i])s[i]='a';
    cout<<s+1<<"\n";
    return 0;
}