CF - 799B. T-shirt buying - STL的set应用

1.题目描述：

B. T-shirt buying

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All values pi are distinct, and values ai and bi are integers from 1 to 3.

m buyers will come to the shop. Each of them wants to buy exactly one t-shirt. For the j-th buyer we know his favorite color cj.

A buyer agrees to buy a t-shirt, if at least one side (front or back) is painted in his favorite color. Among all t-shirts that have colors acceptable to this buyer he will choose the cheapest one. If there are no such t-shirts, the buyer won't buy anything. Assume that the buyers come one by one, and each buyer is served only after the previous one is served.

You are to compute the prices each buyer will pay for t-shirts.

Input

The first line contains single integer n (1 ≤ n ≤ 200 000) — the number of t-shirts.

The following line contains sequence of integers p1, p2, ..., pn (1 ≤ pi ≤ 1 000 000 000), where pi equals to the price of the i-th t-shirt.

The following line contains sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 3), where ai equals to the front color of the i-th t-shirt.

The following line contains sequence of integers b1, b2, ..., bn (1 ≤ bi ≤ 3), where bi equals to the back color of the i-th t-shirt.

The next line contains single integer m (1 ≤ m ≤ 200 000) — the number of buyers.

The following line contains sequence c1, c2, ..., cm (1 ≤ cj ≤ 3), where cj equals to the favorite color of the j-th buyer. The buyers will come to the shop in the order they are given in the input. Each buyer is served only after the previous one is served.

Output

Print to the first line m integers — the j-th integer should be equal to the price of the t-shirt which the j-th buyer will buy. If the j-th buyer won't buy anything, print -1.

Examples

input

5
300 200 400 500 911
1 2 1 2 3
2 1 3 2 1
6
2 3 1 2 1 1

output

200 400 300 500 911 -1 

input

2
1000000000 1
1 1
1 2
2
2 1

output

1 1000000000

2.题意概述：

告诉你每个人喜欢的衣服的颜色; 然后告诉你每件衣服的正面和背面的颜色以及它的价格; 只要某件衣服的正面或背面是某个人喜欢的颜色; 则那个人就会喜欢它; 然后每个人挑自己最喜欢的且最便宜的衣服买; 给你每个人来的先后顺序; 让你求出每个人买的衣服的价格; 
3.解题思路：

定义3个set，代表三种颜色，每次取出对应的set的头节点，然后把那件衣服另外一面的颜色,在另外一个set中删去(或者,先不删去,记录某件衣服有没有被买去,然后每次取头结点,知道遇到一件没有被买去的衣服为止) 

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 200100
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
struct node
{
	int p, a, b;
} c[maxn];
set<int> col[3];
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n, m;
	while (~scanf("%d", &n))
	{
		for (int i = 0; i < 3; i++)
			col[i].clear();
		for (int i = 1; i <= n; i++)
			scanf("%d", &c[i].p);
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", &c[i].a);
			col[c[i].a - 1].insert(c[i].p);
		}
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", &c[i].b);
			col[c[i].b - 1].insert(c[i].p);
		}
		scanf("%d", &m);
		bool first = 1;
		while (m--)
		{
			int x;
			scanf("%d", &x);
			if (!col[x - 1].size())
			{
				if (first)
				{
					printf("%d", -1);
					first = 0;
				}
				else
					printf(" %d", -1);
				continue;
			}
			set<int>::iterator it = col[x - 1].begin();
			int ans = *it;
			for (int i = 0; i < 3; i++)
				if (col[i].count(ans))
					col[i].erase(ans);
			if (first)
			{
				printf("%d", ans);
				first = 0;
			}
			else
				printf(" %d", ans);
		}
		puts("");
	}

#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}