ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)
来源:互联网 发布:可以制作手机壁纸软件 编辑:程序博客网 时间:2024/05/18 11:11
题目:
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.
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 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.
ross rachel4ross joeyrachel phoebephoebe monicamonica chandler
ross racheljoey racheljoey phoebejoey monicajoey chandler
icm codeforces1codeforces technex
icm codeforcesicm technex
In first example, the killer starts with ross and rachel.
- After day 1, ross is killed and joey appears.
- After day 2, rachel is killed and phoebe appears.
- After day 3, phoebe is killed and monica appears.
- After day 4, monica 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 0x3f3f3f3fusing 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;}
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) 题解(A-E)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A+B
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) C. Molly's Chemicals
- [Updating]ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) C. Molly's Chemicals
- 【解题报告】ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) E. The Holmes Children
- Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer【模拟】
- Codeforces Round #400 (Div. 1 + Div. 2, combined) 776A A Serial Killer
- 【前缀和 && 思维转换】ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)Molly's Chemicals
- Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) A(贪心)
- Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)A+B
- Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) A-C题解
- Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) A. Gotta Catch Em' All!(水题)
- Codeforces Round #397(Div. 1 + Div. 2 combined)A. Neverending competitions【水题】
- p2p技术之tcp内网穿透 java实现版
- JavaWeb的四大域对象
- Leetcode 48
- 前段的一点小心得-label标签
- cordova-plugin-file 文件操作整理(二)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)
- CF:The Fault in Our Cubes(DFS)
- maven3常用命令、java项目搭建、web项目搭建详细图解
- %r和%s该用哪一个
- Ceph 集群 client 节点 rdb配置和使用
- Codeforces Round #401 (Div. 2) A---E
- Rabbitmq集群HA高可用环境部署
- spring源码剖析(九)springMVC源码剖析
- N皇后问题扩张(算法训练 王 后问题)