CF1620E.Replace the Numbers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You have an array of integers (initially empty).
You have to perform q queries. Each query is of one of two types:
- " 1 x " — add the element x to the end of the array;
- " 2 x y " — replace all occurrences of x in the array with y .
Find the resulting array after performing all the queries.
输入格式
The first line contains a single integer q ( 1≤q≤5⋅105 ) — the number of queries.
Next q lines contain queries (one per line). Each query is of one of two types:
- " 1 x " ( 1≤x≤5⋅105 );
- " 2 x y " ( 1≤x,y≤5⋅105 ).
It's guaranteed that there is at least one query of the first type.
输出格式
In a single line, print k integers — the resulting array after performing all the queries, where k is the number of queries of the first type.
输入输出样例
输入#1
7 1 3 1 1 2 1 2 1 2 1 1 1 2 2 1 3
输出#1
3 2 2 3 2
输入#2
4 1 1 1 2 1 1 2 2 2
输出#2
1 2 1
输入#3
8 2 1 4 1 1 1 4 1 2 2 2 4 2 4 3 1 2 2 2 7
输出#3
1 3 3 7
说明/提示
In the first example, the array changes as follows:
[] → [3] → [3,1] → [3,2] → [3,2,2] → [3,2,2,1] → [3,2,2,1,2] → [3,2,2,3,2] .
In the second example, the array changes as follows:
[] → [1] → [1,2] → [1,2,1] → [1,2,1] .
In the third example, the array changes as follows:
[] → [] → [1] → [1,4] → [1,4,2] → [1,4,4] → [1,3,3] → [1,3,3,2] → [1,3,3,7] .