Codeforeces 501B map的入门

传送门：点击打开链接

B. Misha and Changing Handles

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Misha hacked the Codeforces site. Then he decided to let all the users change their handles. A user can now change his handle any number of times. But each new handle must not be equal to any handle that is already used or that was used at some point.

Misha has a list of handle change requests. After completing the requests he wants to understand the relation between the original and the new handles of the users. Help him to do that.

Input

The first line contains integer q (1 ≤ q ≤ 1000), the number of handle change requests.

Next q lines contain the descriptions of the requests, one per line.

Each query consists of two non-empty strings old and new, separated by a space. The strings consist of lowercase and uppercase Latin letters and digits. Strings old and new are distinct. The lengths of the strings do not exceed 20.

The requests are given chronologically. In other words, by the moment of a query there is a single person with handle old, and handle new is not used and has not been used by anyone.

Output

In the first line output the integer n — the number of users that changed their handles at least once.

In the next n lines print the mapping between the old and the new handles of the users. Each of them must contain two strings, old and new, separated by a space, meaning that before the user had handle old, and after all the requests are completed, his handle is new. You may output lines in any order.

Each user who changes the handle must occur exactly once in this description.

Sample test(s)

Input

5
Misha ILoveCodeforces
Vasya Petrov
Petrov VasyaPetrov123
ILoveCodeforces MikeMirzayanov
Petya Ivanov

Output

3
Petya Ivanov
Misha MikeMirzayanov
Vasya VasyaPetrov123

题意：给出一些改变句柄的操作（按时间递增的顺序），新的句柄不能是已经存在过的句柄。最后按字典序输出最初的句柄的值和最后的句柄的值。

思路：建立一个map。第一个域存的是最初的句柄值，第二个域存这个句柄的最新的值。处理每个请求时，先遍历一次map的第二个域，如果存在，直接更改。如果没有，就新建一个映射插入map即可。

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<set>
#include<cmath>
#include<string>
#include<map>
using namespace std;
int main()
{
    map<string,string> m;
    int n;
    scanf("%d",&n);
    while(n--)
    {
        string s1,s2;
        cin>>s1>>s2;
        map<string,string>::iterator it=m.begin();
        while(it!=m.end())
        {
            if(it->second==s1) break;
            it++;
        }
        if(it!=m.end())
        {
            it->second=s2;
        }
        else m[s1]=s2;
    }
    int size=m.size();
    printf("%d\n",size);
    map<string,string>::iterator  it;
    for(it=m.begin();it!=m.end();it++)
    {
        cout<<it->first<<' '<<it->second<<endl;
    }
    return 0;
}