zoukankan      html  css  js  c++  java
  • Rebranding(模拟+思维)

    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

    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

    代码:

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    #include<queue>
    #include<stack>
    #include<map>
    #include<set>
    #include<vector>
    #include<cmath>
    
    const int maxn=1e5+5;
    typedef long long ll;
    using namespace std;
    string str;
    char a[35];
    int  main()
    {
    	std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        int n,m;
        cin>>n>>m;
        cin>>str;
        for(int t=0;t<26;t++)
        {
        	a[t]='a'+t;
    	}
    	string s1,s2; 
    	int vis[35];
        for(int t=0;t<m;t++)
        {
        	cin>>s1>>s2;
        	memset(vis,0,sizeof(vis));
        	for(int j=0;j<26;j++)
        	{
        		if(a[j]==s1[0])
        		{
        			vis[j]=1;
        			a[j]=s2[0];
    			}
    		}
    		for(int j=0;j<26;j++)
    		{
    			if(a[j]==s2[0]&&vis[j]==0)
    			{
    				a[j]=s1[0];
    			}
    		}	
    	}
        for(int t=0;t<n;t++)
        {
        	cout<<a[str[t]-'a']; 
    	}
       
        
        return 0;
    }
    
  • 相关阅读:
    明年,我们依然年轻
    总有些东西会如台风一样的来
    ora00257错误处理方法
    ORACLE登录错误的解决方法
    C#中public new void add()的new在这里的意义
    Oracle Form Builder配置问题的一些总结
    作为程序员,你应该知道的职场晋升之路
    ORA01034错误的解决方法
    【转】JQUERY刷新页面
    【转】对C# 中堆栈,堆,值类型,引用类型的理解
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781759.html
Copyright © 2011-2022 走看看