riba2534的博客

qq:735632581

ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)

题目:

A. A Serial Killer
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.

The killer starts with two potential victims on his first day, selects one of these two, kills selected victim and replaces him with a new person. He repeats this procedure each day. This way, each day he has two potential victims to choose from. Sherlock knows the initial two potential victims. Also, he knows the murder that happened on a particular day and the new person who replaced this victim.

You need to help him get all the pairs of potential victims at each day so that Sherlock can observe some pattern.

Input

First line of input contains two names (length of each of them doesn't exceed 10), the two initials potential victims. Next line contains integer n (1 ≤ n ≤ 1000), the number of days.

Next n lines contains two names (length of each of them doesn't exceed 10), first being the person murdered on this day and the second being the one who replaced that person.

The input format is consistent, that is, a person murdered is guaranteed to be from the two potential victims at that time. Also, all the names are guaranteed to be distinct and consists of lowercase English letters.

Output

Output n + 1 lines, the i-th line should contain the two persons from which the killer selects for the i-th murder. The (n + 1)-th line should contain the two persons from which the next victim is selected. In each line, the two names can be printed in any order.

Examples
input
ross rachel
4
ross joey
rachel phoebe
phoebe monica
monica chandler
output
ross rachel
joey rachel
joey phoebe
joey monica
joey chandler
input
icm codeforces
1
codeforces technex
output
icm codeforces
icm technex
Note

In first example, the killer starts with ross and rachel.

  • After day 1ross is killed and joey appears.
  • After day 2rachel is killed and phoebe appears.
  • After day 3phoebe is killed and monica appears.
  • After day 4monica is killed and chandler appears.
思路:

对拍思想,本来写的有点长,最后发现这题tm这么简单。。。存存代码

代码:

#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define N 200+20
#define M 100000+20
#define inf 0x3f3f3f3f
using namespace std;
int main()
{
    string s1,s2,s3,s4;
    cin>>s1>>s2;
    int n;
    cin>>n;
    cout<<s1<<" "<<s2<<endl;
    for(int i=1; i<=n; i++)
    {
        cin>>s3>>s4;
        if(s3==s1)
            s1=s4;
        else
            s2=s4;
        cout<<s1<<" "<<s2<<endl;
    }
    return 0;
}


阅读更多
版权声明:欢迎转载~转载请注明出处! https://blog.csdn.net/riba2534/article/details/57084311
文章标签: codeforces 水题
个人分类: 【Codeforces】
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭