zoukankan      html  css  js  c++  java
  • 1149 Dangerous Goods Packaging (25 分)

    When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in serious trouble. For example, oxidizing agent (氧化剂) must not be packed with flammable liquid (易燃液体), or it can cause explosion.

    Now you are given a long list of incompatible goods, and several lists of goods to be shipped. You are supposed to tell if all the goods in a list can be packed into the same container.

    Input Specification:

    Each input file contains one test case. For each case, the first line gives two positive integers: N (≤), the number of pairs of incompatible goods, and M (≤), the number of lists of goods to be shipped.

    Then two blocks follow. The first block contains N pairs of incompatible goods, each pair occupies a line; and the second one contains M lists of goods to be shipped, each list occupies a line in the following format:

    K G[1] G[2] ... G[K]
     

    where K (≤) is the number of goods and G[i]'s are the IDs of the goods. To make it simple, each good is represented by a 5-digit ID number. All the numbers in a line are separated by spaces.

    Output Specification:

    For each shipping list, print in a line Yes if there are no incompatible goods in the list, or No if not.

    Sample Input:

    6 3
    20001 20002
    20003 20004
    20005 20006
    20003 20001
    20005 20004
    20004 20006
    4 00001 20004 00002 20003
    5 98823 20002 20003 20006 10010
    3 12345 67890 23333
     

    Sample Output:

    No
    Yes
    Yes
     
     
    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=1000010;
    vector<int> v[maxn];//也可以换成:map<int,vector<int> > v;
    int main(){
        int n,m,a,b;
        cin>>n>>m;
        for(int i=0;i<n;i++){
            cin>>a>>b;
            v[a].push_back(b);
            v[b].push_back(a);
        }
        int k,temp;
        for(int i=0;i<m;i++){
            cin>>k;
            set<int> s;
            int flag=true;
            for(int j=0;j<k;j++){
                cin>>temp;
                s.insert(temp);
            }
            for(set<int>::iterator it=s.begin();it!=s.end();it++){
                for(int i=0;i<v[*it].size();i++){
                    if(s.find(v[*it][i])!=s.end()){
                        flag=false;
                        break;
                    }
                }
            }
            if(flag==true){
                printf("Yes
    ");
            }
            else{
                printf("No
    ");
            }
        }
        return 0;
    }
  • 相关阅读:
    Navicat Preminm12 连接Oracle数据库失败或闪退
    kafka tool报错:Error fetching datea.Offset out of range
    kafka修改默认端口号
    post发送请求,body格式
    一、线程基础、线程之间的共享和协作(1)
    jQuery(三) 动画操作一
    jQuery(二) 选择器
    jQuery(一)
    javascript面向过程与面向对象
    鼠标跟随动画: event
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14457183.html
Copyright © 2011-2022 走看看