18秋第二题 PAT甲级 1149 Dangerous Goods Packaging（25 分）处理不当容易超时

浒鱼鱼

于 2020-02-13 14:19:08 发布

阅读量745

点赞数 4

分类专栏： PAT甲级文章标签：数据结构算法 c++

本文链接：https://blog.csdn.net/allisonshing/article/details/104294582

版权

这道PAT甲级题目要求根据输入的不兼容商品对和待运输的商品列表，判断每个列表中的商品是否可以放在同一个容器中。容易超时的解决方案是逐一查询每个商品的违禁品，而更好的方法是使用哈希思想，通过构建标记数组来避免超时。

摘要由CSDN通过智能技术生成

题目

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 (≤10^4), 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: