codeforces 591B 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 xi by yi, and all the letters yi byxi. 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

//题意，输入长度为n的字符串，再输入m组字符，若字符串中遇到每组的两个字符则相互替换；此题直接暴力会超时，对输入的m组数据处理，每输入一组，同时处理一次；

思想是用栈保存下来一个字符最终会变成的字符；

#include "iostream"
#include "cstring"
#include "string"
#include "stack"
using namespace std;

int main(){
  string s;
  int n,m;
  char a,b;
  while(cin >> n >> m) {
       cin >> s;
       stack<int>r[26]; //制造一个栈，可以记录26个字母
       for(int i = 0; i < 26; i++) r[i].push(i); //进行编号

        for(int i = 0; i < m; i++) {
            cin >> a >> b;
            for(int i = 0; i < 26; i++) {  
                if(r[i].top() == a - 'a')
                    r[i].push(b-'a');
                else if(r[i].top() == b - 'a')
                    r[i].push(a-'a');
            }
        }
      for(int i = 0; i < s.size(); i++) {
          cout << (char)(r[ s[i] - 'a' ].top() + 'a');
      }
      cout << endl;
}
}