PAT甲级——1166 Summit (25 分)

思路：
模拟，用两位vector表示edge相连关系
然后，看是否两两相连和是否有其他点与其都相连

src

// 不需要并查
#include<bits/stdc++.h>
using namespace std;vector<vector<int>> edge(250, vector<int>(250, 0));int main() {int n, m;cin >> n >> m;for(int i = 0; i < m; i++) {int x, y;cin >> x >> y;edge[x][y] = edge[y][x] = 1;}int k;cin >> k;for(int i = 1; i <= k; i++) {int l;cin >> l;vector<int> v(l);for(int j = 0; j < l; j++)cin >> v[j];bool flag1 = true;for(int j = 0; j < l; j++) {for(int k = j + 1; k < l; k++){//cout << v[j] << " " << v[k] << " " << edge[v[j]][v[k]] << endl;if(edge[v[j]][v[k]] == 0) {flag1 = false;break;}}if(flag1 == false) break;}bool flag2 = false;int minn = -1;for(int j = 1; j <= n; j++) {int k;for(k = 0; k < l; k++) {if(j == v[k]) break;if(j != v[k] && edge[j][v[k]] == 0) break;}if(k == l) {flag2 = true;minn = j;break;}}if(flag1 == false) printf("Area %d needs help.\n", i);else if(flag2) printf("Area %d may invite more people, such as %d.\n", i, minn);else printf("Area %d is OK.\n", i);}
}

PAT甲级——1166 Summit (25 分)相关推荐

19年冬季第二题 PAT甲级 1166 Summit (25分)
7-3 Summit (25分) A summit (峰会) is a meeting of heads of state or government. Arranging the rest area ...
1166 Summit (25 分) PAT
A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit ...
PAT (Advanced Level) Practice 1166 Summit (25 分)
题目因为只是判断是否是直接相连,所以觉得直接用暴力模拟,而且数据范围也很小.果然,许久不练题,A题的效率都下降了.不过,练题真的是打发时间的好途径. #include <bits/stdc++ ...
PAT A1162 7-3 Summit (25分)
A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit ...
PAT 甲级 A1010 Radix (25 分)
题目传送门这个题用二分做,我自己写的二分呢太菜了,只能拿到19分,不放出来丢人了.后面看了yxc的代码,美妙绝伦哈. 慢慢来拜读一下. #include "bits/stdc++.h&qu ...
PAT甲级 1166 Summit
update202302 for(j = 1; j <= N; j++) 编号从1~N,要记得加上<= #include<iostream> #include<uno ...
PAT甲级 1032 Sharing (25分) 测试点5陷阱
题目 1032 Sharing 分析 suffix是后缀,题目的意思是求两个单词的公共后缀的第一个字符的地址.我看有些博客说求的是首个共用结点的地址,我觉得是不对的. 晴神/柳神的解法,是把第一个单词 ...
1166 Summit (25 point(s)) PAT甲级
1166 Summit (25 point(s)) 题目 A summit (峰会) is a meeting of heads of state or government. Arranging t ...
PAT甲级1147 Heaps (30 分)：[C++题解]堆、树的遍历、dfs、完全二叉树建树
文章目录题目分析题目来源题目分析来源:acwing 分析:给定完全二叉树,判断是否是堆,需要区分大根堆,小根堆.后面是输出后序遍历. AC代码 #include<bits/stdc++. ...

PAT甲级——1166 Summit (25 分)

PAT甲级——1166 Summit (25 分)相关推荐

最新文章

热门文章