Codeforces 827A. String Reconstruction

A. String Reconstruction
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s. Ivan preferred making a new string to finding the old one.

Ivan knows some information about the string s. Namely, he remembers, that string ti occurs in string s at least ki times or more, he also remembers exactly ki positions where the string ti occurs in string s: these positions are xi, 1, xi, 2, ..., xi, ki. He remembers n such strings ti.

You are to reconstruct lexicographically minimal string s such that it fits all the information Ivan remembers. Strings ti and string s consist of small English letters only.

Input
The first line contains single integer n (1 ≤ n ≤ 105) — the number of strings Ivan remembers.

The next n lines contain information about the strings. The i-th of these lines contains non-empty string ti, then positive integer ki, which equal to the number of times the string ti occurs in string s, and then ki distinct positive integers xi, 1, xi, 2, ..., xi, ki in increasing order — positions, in which occurrences of the string ti in the string s start. It is guaranteed that the sum of lengths of strings ti doesn't exceed 106, 1 ≤ xi, j ≤ 106, 1 ≤ ki ≤ 106, and the sum of all ki doesn't exceed 106. The strings ti can coincide.

It is guaranteed that the input data is not self-contradictory, and thus at least one answer always exists.

Output
Print lexicographically minimal string that fits all the information Ivan remembers.

Examples
input
3
a 4 1 3 5 7
ab 2 1 5
ca 1 4
output
abacaba
input
1
a 1 3
output
aaa
input
3
ab 1 1
aba 1 3
ab 2 3 5
output
ababab

显然 按照提议 对所有$X_{i,j}$按升序排列 然后一次插入即可
需要注意的问题是使用string会RE
而$\sum_{i=1}^{n}t_i<=1e6$,将所有$t_i$放进一个char[]中,分别将$t_i$首尾指针存着作为索引

#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<queue>
#include<list>
#define ll long long
#define pii pair<int,int>
#define MEM(a,x) memset(a,x,sizeof(a))
#define lowbit(x) ((x)&-(x))

using namespace std;

const int inf=0x3f3f3f3f;
const int N = 1e5 + 5;
const int M = 1e6 + 5;
char str[M];

struct S{
    int st;
    char*p,*ed;
}pos[M];

bool cmp(const S&a,const S&b){
    return a.st<b.st;
}

inline void putStr(char*s,char*e){
    while(s<e){
        putchar(*s);
        ++s;
    }
}

void slove(int n,int m){
    sort(pos,pos+m,cmp);
    int size=0;
    for(int i=0;i<m;++i){
        int st=pos[i].st;
        while(size<st){
            putchar('a');
            ++size;
        }
        if(size==st){
            putStr(pos[i].p,pos[i].ed);
            size+=pos[i].ed-pos[i].p;
        }
        else{
            int stIdx=size-st;
            if(pos[i].p+stIdx<pos[i].ed){
                for(char*ch=pos[i].p+stIdx;ch!=pos[i].ed;++ch){
                    putchar(*ch);
                    ++size;
                }
            }
        }
    }
    putchar('\n');
}

int main()
{
    //freopen("/home/lu/code/r.txt","r",stdin);
    int n;
    while(~scanf("%d",&n)){
        int posIdx=0,m=0;
        for(int i=0;i<n;++i){
            scanf("%s",(str+posIdx));
            int len=strlen(str+posIdx);
            char*ps=str+posIdx;
            posIdx+=len;
            char*pe=str+posIdx;
            int k;
            scanf("%d",&k);
            while(k--){
                int st;
                scanf("%d",&st);
                pos[m++]={st-1,ps,pe};
            }
        }
        slove(n,m);
    }
    return 0;
}