CodeForces 591B Rebranding(模拟+思维)

 原题传送门：Problem - 591B - Codeforces

 

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 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.

Examples

input

Copy

6 1
police
p m

output

Copy

molice

input

Copy

11 6
abacabadaba
a b
b c
a d
e g
f a
b b

output

Copy

cdcbcdcfcdc

题目大意：就是说先直接你这个字符串多长（直接省去求字符串的长度了），需要调换几次。然后输入字符串，在输入需要调换的两个字符x，y。发现字符串中有x的把这个字符换成y。当然在一次中不能重复换，可以考虑做个标记数组。整体思路有点像映射的感觉

#include <cstring>
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#define sz(v) ((int)v.size())
using namespace std;
const int N=200005;
int main()
{
    ios::sync_with_stdio(false);
    int m, n,vis[26];
    string str;
    string str1, str2; 
    char test[26];
    
    cin >> m >> n;
    cin >> str;
   // int len = sz(str);
   
    for (int i = 0; i < 26; i++)
        test[i] = 'a' + i;
    for (int i = 0; i < n; i++)//根据多组输入用一个缓冲的数据不断实时更新结果
    {
        memset(vis, 0, sizeof(vis));//注意每组的初始化
        cin >> str1 >> str2;
        for (int i = 0; i < 26; i++)
        {
            if (test[i] == str1[0])
            {
                vis[i] = 1;
                test[i] = str2[0];
            }
        }
        for (int j = 0; j < 26; j++)
        {
            if (test[j] == str2[0] && vis[j] == 0)//同时再开一个标记数组避免一个换了数之后被再次变化
            {
                test[j] = str1[0];
            }
        }
    }
    for (int i = 0; i < m; i++)
    {
        cout << test[str[i] - 'a'];//直接不断遍历缓冲的数组
    }
    cout<< endl;
    
    return 0;
}