【PAT甲级A1149】Dangerous Goods Packaging (25分)（c++）

最新推荐文章于 2026-06-25 16:47:30 发布

原创最新推荐文章于 2026-06-25 16:47:30 发布 · 217 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#数据结构

pat 专栏收录该内容

152 篇文章

订阅专栏

博客围绕1149 Dangerous Goods Packaging问题展开，该问题要求判断物品清单中是否存在不能放在一起的物品。给出了输入输出规格及示例，解题思路是用map映射记录不相容单品，遍历清单时用哈希表记录物品，查看映射中是否有已标记物品。

1149 Dangerous Goods Packaging (25分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：400 ms
内存限制：64 MB

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⁴ ), 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

题意：

所给成对的物品不能放在同一个清单里。

思路：

用map映射记录不能放一起的单品。遍历清单时，用哈希表记录清单的物品，然后查看每个物品的映射里有没有已经被标记的。

参考代码：

#include <cstdio>
#include <vector>
#include <unordered_map>

using namespace std;

int main() {
    int n, m, k, a, b;
    scanf("%d%d", &n, &m);
    unordered_map<int, vector<int>> mp;
    for (int i = 0; i < n; i++) {
        scanf("%d%d", &a, &b);
        mp[a].push_back(b);
        mp[b].push_back(a);
    }
    for (int i = 0; i < m; i++) {
        scanf("%d", &k);
        bool flag = false;
        vector<int> v(k), hashtable(100000, 0);
        for (int j = 0; j < k; j++) {
            scanf("%d", &v[j]);
            hashtable[v[j]] = 1;
        }
        for (int j = 0; j < k && !flag; j++)
            for (int t = 0; t < mp[v[j]].size(); t++)
                if (hashtable[mp[v[j]][t]] == 1)flag = true;
        printf("%s\n", flag ? "No" : "Yes");
    }
    return 0;
}

如有错误，欢迎指正