zoukankan      html  css  js  c++  java
  • CF-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 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

    直接暴力一定会超时,对每次输入的ki个数做去重处理就好。

    AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 const int maxn=2e7+10;
     5 
     6 int n,t,x;
     7 char a[maxn],s[maxn];
     8 
     9 int main(){
    10     cin>>n;
    11     int MAX=-maxn;
    12     while(n--){
    13         cin>>s;
    14         int len=strlen(s);
    15         cin>>t;
    16         int cnt=-maxn; 
    17         for(int i=0;i<t;i++){
    18             cin>>x;
    19             x--;
    20             MAX=max(x+len,MAX); 
    21             for(int i=max(cnt,x);i<x+len;i++){
    22                 a[i]=s[i-x];
    23             }
    24             cnt=x+len;
    25         }
    26     }
    27     //cout<<a<<endl;
    28     for(int i=0;i<MAX;i++){
    29         if(a[i]=='')
    30         cout<<'a';
    31         else
    32         cout<<a[i];
    33     }
    34     return 0;
    35 }
  • 相关阅读:
    渗透测试学习 二十一、 JSP相关漏洞
    渗透测试学习 二十、 其他漏洞汇总之PHP相关漏洞
    渗透测试学习 十九、 XSS跨站脚本漏洞详解 续2
    渗透测试学习 十八、 XSS跨站脚本漏洞详解 续
    渗透测试学习 十七、 XSS跨站脚本漏洞详解
    渗透测试学习 十六、 常见编辑器漏洞解析
    渗透测试学习 十五、 文件上传&&解析漏洞
    渗透测试学习 十四、 脚本木马的制作与原理
    渗透测试学习 十三、 SQLmap使用详解
    渗透测试学习 十二、 其他注入漏洞汇总 续
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/7238772.html
Copyright © 2011-2022 走看看