Codeforces 827A. String Reconstruction
来源:互联网 发布:java web 中文乱码 编辑:程序博客网 时间:2024/06/06 22:32
A. String Reconstructiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvan 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.InputThe 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.OutputPrint lexicographically minimal string that fits all the information Ivan remembers.Examplesinput3a 4 1 3 5 7ab 2 1 5ca 1 4outputabacabainput1a 1 3outputaaainput3ab 1 1aba 1 3ab 2 3 5outputababab
显然 按照提议 对所有
需要注意的问题是使用string会RE
而
#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;}
阅读全文
0 0
- Codeforces 827A. String Reconstruction
- CodeFroces 827A.String Reconstruction
- String Reconstruction CodeForces
- Codeforces 827A/828C String Reconstruction[线段树单点更新]
- codeforce 827A String Reconstruction(模拟)
- CodeForces 828C String Reconstruction
- Codeforces 828 C String Reconstruction
- codeforces 828C. String Reconstruction
- Codeforces #423-Div. 2-C. String Reconstruction
- Codeforces Round #423 C. String Reconstruction
- Codeforces 828 C. String Reconstruction 思维
- CodeForces 828C String Reconstruction(思维)
- Codeforces Round #423 C. String Reconstruction
- codeforces 828 c String Reconstruction(扫描线+string)
- Codeforces Round #423 (Div. 2) C. String Reconstruction(字符串)
- Codeforces Round #423 (Div. 2) C. String Reconstruction
- Codeforces 828C String Reconstruction【思维+并查集】
- Codeforces #848C: String Reconstruction 题解之花样虐题
- 随便打打
- CAD的格式转换和批量打印技巧
- Java企业应用开发框架Spring框架简介
- 刚学c两个礼拜,写的推箱子(控制台版本)
- Android 生成keystore,两种方式
- Codeforces 827A. String Reconstruction
- yarn与hadoop概略
- 再谈Struts1.x的运行机制
- Tomcat配置&SSL
- pyspider中内容选择器常用方法汇总
- 逻辑回归(Logistic Regression)
- [刷题]Codeforces Round #389(Div. 2)
- 多个 ul / ol (无序列表/有序列表)的嵌套时的重叠问题
- 杭电2018母牛的故事