Wannafly模拟赛3 生物课程

题目链接：点击打开链接

思路：水题，按照三种无向图的结构特点判断，具体为判断节点度数：X有一个4度节点，其他的节点最多为2度；Y有一个3度节点，其他的节点最多为2度；I的节点度数最多为2度。还可以看出另一个约束条件为：图是连通的，加上没有重边和自环的限制，其实就是说明三种图均为树形结构。

// 生物课程2 运行/限制：27ms/1000ms
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int degree[505];
int main() {
	int n, m, x, y;
	while (scanf("%d%d", &n, &m) != EOF) {
		memset(degree, 0, sizeof(degree));
		for (int i = 0; i < m; i++) {
			scanf("%d%d", &x, &y);
			degree[x]++;
			degree[y]++;
		}
		if (n != m + 1) {//不是树结构
			printf("NotValid\n");
			continue;
		}
		sort(degree + 1, degree + n + 1,greater<int>());
		//x：最大度数，y：次大度数
		x = degree[1], y = degree[2];
		if (x == 4 && (y == 2 || y == 1)) {//X
			printf("X\n");
		}
		else if (x == 3 && (y == 2 || y == 1)) {//Y
			printf("Y\n");
		}
		else if (x == 2 || x == 1) {//I
			printf("I\n");
		}
		else {
			printf("NotValid\n");
		}
	}
	return 0;
}

开始写的时候，没注意到树形结构，用bfs判断的连通，麻烦了不少......

// 生物课程 运行/限制：35ms/1000ms
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
//前向星存图
struct node {
	int to, next;
}edges[501000];
int cnt, head[505];
int degree[505];//度数
int count;//用于搜索
bool cmp(int a, int b) {
	return a > b;
}
void add(int x, int y) {
	cnt++;
	edges[cnt].to = y;
	edges[cnt].next = head[x];
	head[x] = cnt;
}
void bfs(int x) {
	queue<int> q;
	int book[505];
	memset(book, 0, sizeof(book));
	q.push(x);
	book[x] = 1;
	while (!q.empty()) {
		int t = q.front();
		q.pop();
		for (int i = head[t]; i; i = edges[i].next) {
			if (!book[edges[i].to]) {
				::count++;
				q.push(edges[i].to);
				book[edges[i].to] = 1;
			}
		}
	}
}
int main(){
	int n, m, x, y;
	while (scanf("%d%d", &n, &m) != EOF) {
		cnt = 0;
		memset(head, 0, sizeof(head));
		memset(degree, 0, sizeof(degree));
		for (int i = 0; i < m; i++) {
			scanf("%d%d", &x, &y);
			add(x, y);
			add(y, x);
			degree[x]++;
			degree[y]++;
		}
		::count = 1;
		bfs(1);//bfs判连通
		if (::count != n) {//不连通
			printf("NotValid\n");
			continue;
		}
		sort(degree + 1, degree + n + 1,cmp);
		x = degree[1], y = degree[2];
		if (x == 4 && (y == 2 || y == 1)) {
			printf("X\n");
		}
		else if (x == 3 && (y == 2 || y == 1)) {
			printf("Y\n");
		}
		else if (x == 2 || x == 1) {
			printf("I\n");
		}
		else {
			printf("NotValid\n");
		}
	}
    return 0;
}