zoukankan      html  css  js  c++  java
  • CF-799B

    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 piai 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 

    题意:

    有n件T恤,每件含有三个属性价格v,正面颜色f和反面颜色b。

    现有m个顾客,每个顾客有要买最喜欢的颜色中最便宜的一件。

    用set对所有衣服储存并排序,卖出一件就将这件删除。

    附AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 const int N=2e5+10;
     5 
     6 struct node{
     7     int v,f,b;
     8 }a[N];
     9 
    10 set<int> s[5];
    11 
    12 int main(){
    13     int n,m;
    14     cin>>n;
    15     for(int i=1;i<=n;i++){
    16         cin>>a[i].v;
    17     }
    18     for(int i=1;i<=n;i++){
    19         cin>>a[i].f;
    20     }
    21     for(int i=1;i<=n;i++){
    22         cin>>a[i].b;
    23     }
    24     for(int i=1;i<=n;i++){
    25         s[a[i].f].insert(a[i].v);
    26         s[a[i].b].insert(a[i].v);
    27     }
    28     cin>>m;
    29     for(int i=1;i<=m;i++){
    30         int x;
    31         cin>>x;
    32         if(s[x].size()==0){
    33             cout<<"-1"<<" ";
    34             continue;
    35         }
    36         else{
    37             int temp=*(s[x].begin());
    38             cout<<temp<<" ";
    39             for(int j=1;j<=3;j++){
    40                 s[j].erase(temp);
    41             }
    42         }
    43     }
    44     return 0;
    45 } 
  • 相关阅读:
    从零开始搭建VUE项目
    推送类型
    spring整合消息队列rabbitmq
    Terracotta
    MYSQL INNODB 存储引擎
    Java 各种读取文件方法以及文件合并
    spring-security用户权限认证框架
    Spring Bean初始化过程
    使用PLSQL客户端登录ORACLE时报ORA-12502和ORA-12545错误的解决方案
    计算机语言基础概况
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/6847367.html
Copyright © 2011-2022 走看看