Preparando MOJI

Mass Change Queries

3000ms 524288K

Description:

You are given an array a consisting of n integers. You have to process q queries to this array; each query is given as four numbers l, r, x and y, denoting that for every i such that l ≤ i ≤ r and ai = x you have to set ai equal to y.

Print the array after all queries are processed.

Input:

The first line contains one integer n (1 ≤ n ≤ 200000) — the size of array a.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 100) — the elements of array a.

The third line contains one integer q (1 ≤ q ≤ 200000) — the number of queries you have to process.

Then q lines follow. i-th line contains four integers l, r, x and y denoting i-th query (1 ≤ l ≤ r ≤ n, 1 ≤ x, y ≤ 100).

Output:

Print n integers — elements of array a after all changes are made.

Sample Input:

5
1 2 3 4 5
3
3 5 3 5
1 5 5 1
1 5 1 5

Sample Output:

5 2 5 4 5 

Informação

Codeforces

Provedor Codeforces

Código CF911G

Tags

data structures

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:22:05

Relacionados

Nada ainda