RT，WA on test 117

#include <bits/stdc++.h>

#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
//#define int long long
#define LL long long
#define ULL unsigned long long
#define ls(k) k << 1
#define rs(k) k << 1 | 1

const int N = 1e7 + 3, M = 2e6 + 10, K = 120;
const ULL p = 13331, mod = 1e9 + 7;

using namespace std;

inline int rd() {
	int xx=0,ff=1;
	char ch=getchar();
	while(ch<'0' or ch>'9'){if(ch=='-')ff=-1;ch=getchar();}
	while(ch>='0' and ch<='9'){xx=xx*10-'0'+ch;ch=getchar();}
	return xx*ff;
}

int n, m, cnt;

int root[K], ans[M];

int ls[N], rs[N];

void update(int &k, int l, int r, int pos)

{
	if (l > pos or r < pos) return ;
	if (!k) k = ++ cnt;
	if (l == r) return ;
	int mid = (l + r) >> 1;
	update(ls[k], l, mid, pos), update(rs[k], mid + 1, r, pos);
}

int merge(int a, int b)

{
	if(!a or !b)return a | b;
	ls[a] = merge(ls[a], ls[b]);
	rs[a] = merge(rs[a], rs[b]);
	return a;
}

void modify(int &a, int &b, int l, int r, int x, int y)

{
	if (!a) return ;
	if (l > y || r < x) return ;
	if (l >= x && r <= y)
	{
		b = merge(a, b);a = 0;
		return ;
	}
	if (!b) b = ++ cnt;
	int mid = (l + r) >> 1;
	modify(ls[a], ls[b], l, mid, x, y), modify(rs[a], rs[b], mid + 1, r, x, y);
}

void print(int k, int l, int r, int c)

{
	if (!k) return ;
	if (l == r) 
	{
		ans[l] = c;
		return ;
	}
	int mid = (l + r) >> 1;
	print(ls[k], l, mid, c), print(rs[k], mid + 1, r, c);
}

signed main()

{
    IOS;

	n = rd(); 
	for (int i = 1, x; i <= n; i ++ )
	{
		x = rd();
		update(root[x], 1, n, i);
	}
	m = rd();
	while (m -- )
	{
		int l, r, x, y;
		l = rd(), r = rd(), x = rd(), y = rd();
		if (x == y) continue;
		x = root[x], y = root[y];
		modify(x, y, 1, n, l, r);
	}
	for (int i = 1; i <= 100; i ++ ) print(root[i], 1, n, i);
	for (int i = 1; i <= n; i ++ ) cout << ans[i] << ' ';
}