Codeforces Round #327 (Div. 2) B. Rebranding
2015-10-26 09:48
267 查看
B. Rebrandingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe name of one small but proud corporation consists of n lowercase English letters. The Corporation has decided to try rebranding —an active marketing strategy, that includes a set of measures to change either the brand (both for the company and the goods it produces) or its components: the name, the logo, the slogan. They decided to start with the name.For this purpose the corporation has consecutively hired m designers. Once a company hires the i-thdesigner, he immediately contributes to the creation of a new corporation name as follows: he takes the newest version of the name and replaces all the letters xiby yi,and all the letters yi by xi.This results in the new version. It is possible that some of these letters do no occur in the string. It may also happen that xi coincideswith yi.The version of the name received after the work of the last designer becomes the new name of the corporation.Manager Arkady has recently got a job in this company, but is already soaked in the spirit of teamwork and is very worried about the success of the rebranding. Naturally, he can't wait to find out what is the new name the Corporation will receive.Satisfy Arkady's curiosity and tell him the final version of the name.InputThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 200 000) —the length of the initial name and the number of designers hired, respectively.The second line consists of n lowercase English letters and represents the original name of the corporation.Next m lines contain the descriptions of the designers' actions: the i-thof them contains two space-separated lowercase English letters xiand yi.OutputPrint the new name of the corporation.Sample test(s)input
6 1 police p moutput
moliceinput
11 6 abacabadaba a b b c a d e g f a b boutput
cdcbcdcfcdc
这是一道很水的题目,但是当时就硬生生地超时了,为什么呢,原因就在于输出,如果最后的输出是用printf将数组中的元素一个一个输出的话,就肯定会超时,但是用了printf("%s",ans); 就不会出现超时的情况。后来我又发现了用getchar和putchar输出是最快的,不管中间搞得多复杂,用getchar和putchar输出是肯定没有问题的。
#include <iostream>using namespace std;char t[200000+10];char ans[125];int main(){int i,j,k,m,n;scanf("%d %d",&m,&n);scanf("%s",t);char a, b;for(i=0;i<125;i++)ans[i]=i;for(k=0;k<n;k++){scanf(" %c %c",&a,&b);for(i='a';i<='z';i++){if(ans[i]== a ){ans[i] = b;}else if(ans[i] ==b ){ans[i] = a;}}}for(j=0;j<m;j++)t[j]=ans[t[j]];printf("%s",t);return 0;}[/code]
相关文章推荐
- jquery&easyui
- Tomcat报45秒无法启动错误修改方法
- 九度OJ 1168:字符串的查找删除 (查找)
- iOS开发 -GameKit蓝牙开发
- JAVA之代码混淆proguard基础(三)从异常堆栈中还原 ProGuard 混淆过的代码
- PHP操作MySQL数据库
- 九度OJ 1167:数组排序 (排序)
- PHP字符串操作之trim/rtrim/ltrim
- 设计模式-工厂模式
- ios 网络字节顺序的转换HTOS
- 九度OJ 1167:数组排序 (排序)
- 苏州Oracle社招面经
- eclipse 异常 Subversion Native Library Not Available解决方案
- 二进制转换为十进制
- 花生采摘
- JSP取得绝对路径
- python中文显示报错
- 手机开发web?native?hybrid?
- NGINX引入线程池 性能提升9倍
- LeetCode OJ:Construct Binary Tree from Inorder and Postorder Traversal(从中序以及后序遍历结果中构造二叉树)