题目链接:http://codeforces.com/contest/501/problem/B
B. Misha and Changing Handles
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
解析:利用map将key作为新名字,value作为旧名字,使其一一对应。
AC代码如下:
#include <iostream>
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <string.h>
#include <sstream>
#include <cctype>
#include <climits>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <vector>
#include <iterator>
#include <algorithm>
#include <stack>
#include <functional>
//cout << "OK" << endl;
#define _clr(x,y) memset(x,y,sizeof(x))
#define _inf(x) memset(x,0x3f,sizeof(x))
#define pb push_back
#define mp make_pair
#define FORD(i,a,b) for (int i=(a); i<=(b); i++)
#define FORP(i,a,b) for (int i=(a); i>=(b); i--)
#define REP(i,n) for (int i=0; i<(n); i++)
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double EULER = 0.577215664901532860;
const double PI = 3.1415926535897932384626;
const double E = 2.71828182845904523536028;
typedef long long LL;
LL pow_mod(LL a,LL n,LL m)
{
if(n == 0) return 1;
LL x = pow_mod(a,n>>1,m);
LL ans = x*x%m;
if(n&1) ans = ans*a%m;
return ans;
}
int gcd(int a,int b){return b == 0 ? a : gcd(b,a%b);}
//http://baike.baidu.com/link?url=iNpv1N7fYmRnscJeG5rhraxpuJZRSkh7Ho21ISTi02iPOYR7RxZ5wWowtAJicsOw47XZkyQu9tS-4GV1cQWj8_
int main(){
map <string, string> mp;
int q;
cin >> q;
while(q--){
string str1,str2;
cin >> str1 >> str2;
//如果旧名字不存在,那么直接将这一对存储在map中
if(mp.find(str1) == mp.end()){
mp[str2] = str1;
}
//如果就名字存在,那么将当前的新名字和旧名字所对应的更旧的名字作为一对存储在map中
else{
mp[str2] = mp[str1];
mp.erase(str1);
}
}
//遍历输出
int cont = mp.size();
cout << cont << endl;
for(map<string,string>::iterator it = mp.begin();it != mp.end(); it++){
cout << it->second << " " << it->first << endl;
}
return 0;
}