[Python](PAT)1149 Dangerous Goods Packaging（25 分）

最新推荐文章于 2024-08-21 14:30:53 发布

Amos H

最新推荐文章于 2024-08-21 14:30:53 发布

阅读量373

点赞数

分类专栏： PAT 文章标签： PAT 1149 python

本文链接：https://blog.csdn.net/qq_35499060/article/details/82557319

版权

PAT 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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 (≤104), the number of pairs of incompatible goods, and M (≤100), 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 (≤1,000) 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

题目大意

在相同的一个容器中，有一些物品是不能放在一起的。现在给出N对不能放在一起的物品的搭配以及M个订单表。问这些订单中的物品放在一起是否安全。

分析

使用字典存储不能放在一起的物品的信息，然后遍历整个订单，看是否存在与之配对的不能放在一起的物品。如果没有，则输出Yes，否则输出No

python实现

def main():
    line = input().split(" ")
    n, m= int(line[0]), int(line[1])
    dic = {}
    for x in range(n):
        line = input().split(" ")
        try:
            dic[line[0]].append(line[1])
        except:
            dic[line[0]] = [line[1]]
        try:
            dic[line[1]].append(line[0])
        except:
            dic[line[1]] = [line[0]]
    for x in range(m):
        line = input().split(" ")
        k = int(line[0])
        get = line[1:]
        flag = True
        for i in range(k):
            if flag and get[i] in dic:
                for j in get[i+1:]:
                    if j in dic[get[i]]:
                        flag = False
                        break
        if flag:
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    main()

python解PAT甲级，答案都在这了