Codeforces Round #413,B. T-shirt buying

题目链接:http://codeforces.com/contest/799/problem/B

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 p_i, a_i and b_i, where p_i is the price of the i-th t-shirt, a_i is front color of the i-th t-shirt and b_i is back color of the i-th t-shirt. All values p_i are distinct, and values a_i and b_i 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 c_j.

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 p₁, p₂, ..., p_n (1 ≤ p_i ≤ 1 000 000 000), where p_i equals to the price of the i-th t-shirt.

The following line contains sequence of integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 3), where a_i equals to the front color of the i-th t-shirt.

The following line contains sequence of integers b₁, b₂, ..., b_n (1 ≤ b_i ≤ 3), where b_i 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 c₁, c₂, ..., c_m (1 ≤ c_j ≤ 3), where c_j 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

Copy

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

Output

Copy

200 400 300 500 911 -1 

Input

Copy

2
1000000000 1
1 1
1 2
2
2 1

Output

Copy

1 1000000000 

题目大意:

有n件T-shirt，然后给出你每件T-shit的价格以及它的前面和后面的颜色。有m个人要来买的T-shirt，给出了自己喜欢的颜色，只要一件T-shirt的前面或者后面的颜色满足要求，那么他就会买价格最便宜的内件T-shirt。没有符合要求的T-shirt就输出-1.让你模拟这个过程。

思路：

有20万个数据，直接爆搜肯定超时。最好写的应该是用开3个set，每个set维护一种颜色。每次只需要找到set的首部元素输出，然后将所有的set中的已经卖出的T-shirt都删除。我用的是队列，用3个队列维护3种颜色，不过开始要按照价格排个序，然后每个队列存储一个颜色对应的所有的T-shirt编号。还需要开个vis数组维护是否已经出售。这比set慢一点就是一次查询完成是能够维护一个队列，其他队列还需要遍历内些已经出售完的，而set可以直接删除key值3*n*log(n)就能完成。

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
#define ll long long
using namespace std;
const int N =2e5+5;
struct node
{
    int p1,a1,b1;
};
node p[N];
queue<int>a1,a2,a3;
bool vis[N];
bool cmp(node x,node y)
{
    return x.p1<y.p1;
}
int main()
{
    int n;
    scanf("%d",&n);
    int cnt1=0,cnt2=0,cnt3=0;
    for(int i=0;i<n;i++)
    scanf("%d",&p[i].p1);
    for(int i=0;i<n;i++)
    scanf("%d",&p[i].a1);
    for(int i=0;i<n;i++)
    scanf("%d",&p[i].b1);
    sort(p,p+n,cmp);
    for(int i=0;i<n;i++)
    {
        if(p[i].a1==1||p[i].b1==1)
        a1.push(i);
        if(p[i].a1==2||p[i].b1==2)
        a2.push(i);
        if(p[i].a1==3||p[i].b1==3)
        a3.push(i);
    }
    int m;
    scanf("%d",&m);
    for(int i=0;i<m;i++)
    {
        int num;
        scanf("%d",&num);
        if(num==1)
        {
           int flag=0;
           while(!a1.empty())
           {
               int nnn=a1.front();
               a1.pop();
               if(!vis[nnn])
               {
                   flag=1;
                   printf("%d ",p[nnn].p1);
                   vis[nnn]=1;
                   break;
               }
           }
           if(!flag)
           printf("-1 ");
        }
        else if(num==2)
        {
            int flag=0;
            while(!a2.empty())
            {
               int nnn=a2.front();
               a2.pop();
               if(!vis[nnn])
               {
                   flag=1;
                   printf("%d ",p[nnn].p1);
                   vis[nnn]=1;
                   break;
               }
           }
           if(!flag)
            printf("-1 ");
        }
        else
        {
            int flag=0;
            while(!a3.empty())
            {
               int nnn=a3.front();
               a3.pop();
               if(!vis[nnn])
               {
                   flag=1;
                   printf("%d ",p[nnn].p1);
                   vis[nnn]=1;
                   break;
               }
            }
            if(!flag)
            printf("-1 ");
        }
    }
    cout<<endl;
    return 0;
}