Codeforces Round #327 (Div. 2) (B. Rebranding 字符串的操作)

本文详细阐述了某小型企业进行品牌重塑的过程，包括雇佣设计师、替换字母等关键步骤，最终揭示重塑后的企业名称。

B. Rebranding

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 x_i by y_i, and all the letters y_i by x_i. 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 x_i coincides with y_i. 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 x_i and y_i.

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:

$\text{[math]}$

题意：给出一个字符串，然后给出一系列的操作，把x与y字母交换

思路：利用一个数组存储26个字母,然后就在这个数组上交换。输出的时候直接替换

#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");
    }
    return 0;
}