Codeforces Round #327 (Div. 2) (B. Rebranding 字符串的操作)
2015-11-14 16:23
441 查看
分类: 模拟 CF2015-10-26
14:22 58人阅读 评论(0) 收藏 举报
[align=center]B. Rebranding[/align]
[align=center]time limit per test[/align]
[align=center]2 seconds[/align]
[align=center]memory limit per test[/align]
[align=center]256 megabytes[/align]
[align=center]input[/align]
[align=center]standard input[/align]
[align=center]output[/align]
[align=center]standard output[/align]
The 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-th designer, 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 xi by 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 coincides
with 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.
Input
The 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-th of them contains two space-separated lowercase English letters xi and yi.
Output
Print the new name of the corporation.
Sample test(s)
Input
Output
Input
Output
Note
In the second sample the name of the corporation consecutively changes as follows:
题意:给出一个字符串,然后给出一系列的操作,把x与y字母交换
思路:利用一个数组存储26个字母,然后就在这个数组上交换。输出的时候直接替换
[cpp] view
plaincopyprint?
#include<bits/stdc++.h>
using namespace std;
const int maxn=200011;
const int inf=1<<27;
#define LL long long
#define P pair<int,int>
#define pb push_back
#define cl(a,b) memset(a,b,sizeof(a));
char s[maxn];
int op[27];
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
scanf("%s",s);
cl(mp,0);
for(int i=0;i<27;i++)op[i]=i;
for(int i=0;i<m;i++){
char a[2],b[2];
scanf("%s%s",a,b);
swap(op[a[0]-'a'],op[b[0]-'a']);
}
for(int i=0;i<n;i++){
for(int j=0;j<27;j++)if(op[j]==s[i]-'a'){
printf("%c",j+'a');
}
}
printf("\n");
}
14:22 58人阅读 评论(0) 收藏 举报
[align=center]B. Rebranding[/align]
[align=center]time limit per test[/align]
[align=center]2 seconds[/align]
[align=center]memory limit per test[/align]
[align=center]256 megabytes[/align]
[align=center]input[/align]
[align=center]standard input[/align]
[align=center]output[/align]
[align=center]standard output[/align]
The 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-th designer, 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 xi by 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 coincides
with 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.
Input
The 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-th of them contains two space-separated lowercase English letters xi and yi.
Output
Print the new name of the corporation.
Sample test(s)
Input
6 1 police p m
Output
molice
Input
11 6 abacabadaba a b b c a d e g f a b b
Output
cdcbcdcfcdc
Note
In the second sample the name of the corporation consecutively changes as follows:
题意:给出一个字符串,然后给出一系列的操作,把x与y字母交换
思路:利用一个数组存储26个字母,然后就在这个数组上交换。输出的时候直接替换
[cpp] view
plaincopyprint?
#include<bits/stdc++.h>
using namespace std;
const int maxn=200011;
const int inf=1<<27;
#define LL long long
#define P pair<int,int>
#define pb push_back
#define cl(a,b) memset(a,b,sizeof(a));
char s[maxn];
int op[27];
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
scanf("%s",s);
cl(mp,0);
for(int i=0;i<27;i++)op[i]=i;
for(int i=0;i<m;i++){
char a[2],b[2];
scanf("%s%s",a,b);
swap(op[a[0]-'a'],op[b[0]-'a']);
}
for(int i=0;i<n;i++){
for(int j=0;j<27;j++)if(op[j]==s[i]-'a'){
printf("%c",j+'a');
}
}
printf("\n");
}
相关文章推荐
- shell入门-变量
- org.hibernate.criterion.Example;
- 对新民主主义社会的探索
- js读取并解析JSON类型数据的方法
- oracle11g 查看空表及数据库导出报“ EXP-00003: 未找到段 (0,0)
- redhat7安装mysql-server(mysqld)
- iOS 从allCount个元素中取出myCount个元素的所有排列组合
- 【转载自W3CPLUS】如何将页脚固定在页面底部
- iOS 后台 播放h5 视频、音频  解决方案
- opencv实现图像细化效果
- sicily 1209. Sequence Sum Possibi
- ios面向切面AOP(下) swift版本
- Keil编译错误error:L6050U
- 3Sum Closest
- STL迭代器简介
- 【HTTP协议系列4】服务器日志之X_Forwarded_For
- 最佳启动Acitivity
- C++STL之迭代器
- Guest Speaker on 2015 WinHEC Shenzhen 秋季大会
- npm 私有模块的管理使用