CF-799B
B. T-shirt buyingtime limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
InputThe 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.
OutputPrint 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.
Examplesinput5
300 200 400 500 911
1 2 1 2 3
2 1 3 2 1
6
2 3 1 2 1 1output200 400 300 500 911 -1input2
1000000000 1
1 1
1 2
2
2 1output1 1000000000
题意:
有n件T恤,每件含有三个属性价格v,正面颜色f和反面颜色b。
现有m个顾客,每个顾客有要买最喜欢的颜色中最便宜的一件。
用set对所有衣服储存并排序,卖出一件就将这件删除。
附AC代码:
#include<bits/stdc++.h>
using namespace std; const int N=2e5+; struct node{
int v,f,b;
}a[N]; set<int> s[]; int main(){
int n,m;
cin>>n;
for(int i=;i<=n;i++){
cin>>a[i].v;
}
for(int i=;i<=n;i++){
cin>>a[i].f;
}
for(int i=;i<=n;i++){
cin>>a[i].b;
}
for(int i=;i<=n;i++){
s[a[i].f].insert(a[i].v);
s[a[i].b].insert(a[i].v);
}
cin>>m;
for(int i=;i<=m;i++){
int x;
cin>>x;
if(s[x].size()==){
cout<<"-1"<<" ";
continue;
}
else{
int temp=*(s[x].begin());
cout<<temp<<" ";
for(int j=;j<=;j++){
s[j].erase(temp);
}
}
}
return ;
}
最新文章
- Linux防火墙配置(iptables, firewalld)
- #8.10.16总结# 属性选择符 伪对象选择符 CSS的常用样式
- AutoIT 实现Firefox下载
- C# 从入门到精通
- Codeforces Round #121 (Div. 2)
- C#应用Newtonsoft.Json操作json[2]-反序列化不定类型
- 解决vim中鼠标右键无法复制的问题
- J2EE开发常用开源框架技术(转)
- UGUI 下拉滚动框
- imgur.py
- 程序启动读取和关闭时保存应用程序设置(QSettings)
- GCD 信号量 dispatch_semaphore_t
- 分布式定时任务 -- elastic-job
- PHP类和函数注释大全
- expdp/impdp使用
- Mango 基础知识
- linux下内核的配置和编译(2017-1-17)
- 代码统计工具cloc
- sourceTree跳过注册
- mysql字段集合中如何去除其中一个元素