PAT (Advanced Level) Practice 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 (≤10000), 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
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m, v;
cin >> n >> m;
map<int, vector<int> >G;
int a, b;
for(int i = 0; i < n; i++){
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int>ans;
int vis[100000];
for(int i = 0; i < m; i++){
memset(vis, 0, sizeof(vis));
ans.clear();
cin >> v;
for(int j = 0; j < v; j++){
cin >> a;
vis[a] = 1;
ans.push_back(a);
}
int f = 1;
for(int j = 0; j < v; j++){
for(int k = 0; k < G[ans[j]].size(); k++){
if(vis[G[ans[j]][k]]){
f = 0;
break;
}
}
}
if(f == 0) cout << "No" << endl;
else cout << "Yes" << endl;
}
}
相關文章
- 1149 Dangerous Goods Packaging (25分)Go
- goodsGo
- Practice
- shell practice 04
- shell practice 06
- shell practice 03
- shell practice 05
- shell practice 07
- 【Scala】Scala之Packaging and ImportsImport
- A potentially dangerous Request.Form value was detected from the clientORMclient
- Practice| 流程控制
- Best Practice in Writing
- SCM605--Free GoodsGo
- IN GST(Goods and Service Tax) localization requirementGoUIREM
- FAQ: Goods Receipt sd 問題Go
- “Docker Practice”讀書筆記Docker筆記
- Oracle ADR packaging incidents(打包事件)OracleIDE事件
- ecshop /goods.php SQL Injection VulGoPHPSQL
- Spring Boot In Practice (0):基礎Spring Boot
- css best practice for big team and projectCSSProject
- Oracle Advanced SecurityOracle
- BAPI_GOODSMVT_CREATE to post Goods MovementAPIGo
- solaris Application Packaging 編寫的小工具APP
- SAP BAPI BAPI_GOODSMVT_CREATE Goods movementAPIGo
- MIGO error:"Goods receipt for purch. order" is not allowedGoError
- Cerbero Suite Advanced 5UI
- Advanced Index CompressionIndex
- AIX(Advanced Interactive eXecutive)AI
- PAT-A Java實現Java
- 【洛谷OJ】【JAVA】P1149 火柴棒等式Java
- CF1149D Abandoning Roads 題解
- wp7 toolkit編譯錯誤 Xap packaging failed編譯AI
- 記一次kafka的high level和low levelKafka
- natas(level0-level14)通關詳細指南(一)
- transaction-level or statement-level consistency; check constraintsAI
- Oracle 12.2 RAC on Linux Best Practice DocumentationOracleLinux
- A+B for Input-Output Practice (IV) (sdut oj)
- Practice5.1 測試與封裝5.1封裝