PAT (Advanced Level) Practice 1166 Summit (25 分)
题目
因为只是判断是否是直接相连，所以觉得直接用暴力模拟，而且数据范围也很小。果然，许久不练题，A题的效率都下降了。不过，练题真的是打发时间的好途径。
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
const int N=220;
unordered_set<int> peo[N];
int n, m;int main()
{scanf("%d%d", &n, &m);int k, l, a, b;for(int i=0; i<m; i++){scanf("%d%d", &a, &b);peo[a].insert(b);peo[b].insert(a);}scanf("%d", &k);for(int x=1; x<=k; x++){scanf("%d%d", &l, &a);l-=1;vector<int> v;v.push_back(a);bool flag1=true;for(int j=0; j<l; j++){scanf("%d", &b);for(int i=0; i<(int)v.size(); i++){if(peo[b].find(v[i])==peo[b].end()){flag1=false;break;}}v.push_back(b);}if(!flag1 && l) printf("Area %d needs help.\n", x);else {bool flag2=false;for(int i=1; i<=n; i++){int cnt=0;for(int j=0; j<(int)v.size(); j++){if(peo[i].find(v[j])!=peo[i].end()){cnt+=1;} else {break;}}if(cnt==(int)v.size()){flag2=true;printf("Area %d may invite more people, such as %d.\n", x, i);break;}}if(!flag2)printf("Area %d is OK.\n", x);}}return 0;
}
PAT (Advanced Level) Practice 1166 Summit (25 分)相关推荐
- PAT (Advanced Level) Practice 1043 Is It a Binary Search Tree (25 分) 凌宸1642
PAT (Advanced Level) Practice 1043 Is It a Binary Search Tree (25 分) 凌宸1642 题目描述: A Binary Search Tr ...
- PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642 题目描述: With the 2010 FIFA World Cu ...
- PAT (Advanced Level) Practice 题解代码 - II （1051-1100）
PAT PAT (Advanced Level) Practice - II(1051-1100) -------------------------------------------------- ...
- 19年冬季第二题 PAT甲级 1166 Summit (25分)
7-3 Summit (25分) A summit (峰会) is a meeting of heads of state or government. Arranging the rest area ...
- 【PAT (Advanced Level) Practice】1093 Count PAT‘s (25 分)
1093 Count PAT's (25 分) The string APPAPT contains two PAT's as substrings. The first one is formed ...
- 【PAT (Advanced Level) Practice】1051 Pop Sequence (25 分)
1051 Pop Sequence (25 分) Given a stack which can keep M numbers at most. Push N numbers in the order ...
- 【PAT (Advanced Level) Practice】1149 Dangerous Goods Packaging (25 分)
1149 Dangerous Goods Packaging (25 分) When shipping goods with containers, we have to be careful not ...
- PAT (Advanced Level) Practice 题目集合（1001 ~ 1050）（正在更新）
1001 A+B Format (20 分) 题目大意:计算a+b,结果按照西方的那种写数字的方式输出,从三个数一个逗号那种. #include<bits/stdc++.h> using ...
- 【PAT (Advanced Level) Practice】PAT (Advanced Level) Practice
1006 Sign In and Sign Out (25 分) At the beginning of every day, the first person who signs in the co ...
最新文章
- c语言中注释部分执行,深入C语言内存区域分配(进程的各个段)详解
- 分层设计与领域设计融合架构设计
- 什么是xmlschema
- Android开发环境简单配置
- Java的知识点29—— 文件字符流、字节数组流
- 【竞赛总结】新冠期间饿了么骑士行为预估
- mysql sql len_MySQL的查询计划中ken_len的值计算方法
- 前端学习（1652）：前端系列实战课程之bom
- 7-277 单身狗 (25 分)
- spring扩展点之二：spring中关于bean初始化、销毁等使用汇总,ApplicationContextAware将ApplicationContext注入...
- Git之同一台电脑如何连接多个远程仓库
- delete 和 delete []
- java中判断对象不为空字符串_Java判断对象是否为空(包括null ,)的方法
- python 经典图书排行榜_书榜 | 计算机书籍（5.4-5.10）销售排行榜
- 相关系数计算机计算方法,计算相关系数的公式（相关系数的计算方法）
- 【python 淘宝爬虫】淘宝信誉分抓取
- FFmpeg源码分析：内存管理系统
- ps磁性套索工具如何抠图
- rm -rf *后怎么办？
- ubuntu编译ffmpeg并且demo测试