zoukankan      html  css  js  c++  java
  • Codefoces 828C

    C. String Reconstruction
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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 1061 ≤ xi, j ≤ 1061 ≤ 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
    官方题解:

    一开始sort排序,然后依次按顺序放入字符串

    直接看代码(注意,输入需改为scanf格式,否则会超时)

    #include<iostream>
    #include<vector>
    #include<string>
    #include<algorithm>
    #include<string.h>
    #include<stdio.h>
    using namespace std;
    const int maxn=1e6+100;
    
    string s[maxn];
    vector<pair<int ,int> >tmp;
    
    int main()
    {
        int n,k,x;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
                cin>>s[i]>>k;
        for(int j=0;j<k;j++)
        {
            scanf("%d",&x);
            tmp.push_back(make_pair(x,i));
        }
        }
        sort(tmp.begin(),tmp.end());
        string ans;
        int len=1;
        for(int i=0;i<tmp.size();i++)
        {
            int t1=tmp[i].first,t2=tmp[i].second;
            while(t1>len)
            {
                ans+='a';
                len++;
            }//len-t1可以避免重复添加
            for(int j=len-t1;j<s[t2].length();j++)
            {
                ans+=s[t2][j];
                len++;
            }
        }
        cout<<ans<<endl;
        return 0;
    }
    





  • 相关阅读:
    安装图形化界面
    cemtos安装python
    traceback说明
    python常用魔法函数
    python上传文件接口
    文件上传接口
    MongoDB安装与使用
    解决macOS系统向有跳板机的服务器传文件
    mac终端命令sftp
    linux下mysql服务安装
  • 原文地址:https://www.cnblogs.com/bryce1010/p/9387443.html
Copyright © 2011-2022 走看看