PAT甲级-2021秋-第3题-DFS遍历-AC代码

7-3 Playground Exploration (25 分)

A playground is equipped with ball pits and tents connected by tunnels. Kids can crawl through the tunnels to meet their friends at a spot with a tent or a ball pit.
Now let’s mark each meeting spot (a tent or a ball pit) by a number. Assume that once a kid starts to explore the playground from any meeting spot, he/she will always choose the next destination with the smallest number, and he/she would never want to visit the same spot twice. Your job is to help the kids to find the best starting spot so they can explore as many spots as they can.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers $N$ ($\le 100$), the total number of spots, and $M$, the number of tunnels. Then $M$ lines follow, each describes a tunnel by giving the indices of the spots (from $1$ to $N$) at the two ends.

Output Specification:

Print in a line the best starting spot which leads to the maximum number of spots, and the number of spots a kid can explore. If the solution is not unique, output the one with the smallest index. There must be exactly 1 space between the two numbers, and there must be no extra space at the beginning or the end of the line.

Sample Input:

8 10
1 2
3 4
5 8
1 4
6 1
3 7
2 4
5 3
2 8
2 5

Sample Output:

6 7

Hint:

Actually there are two solutions. Kids can either start from 6 and go through 1->2->4->3->5->8, or from 7 to 3->4->1->2->5->8, both can visit 7 spots. Since 6 is a smaller index, we output 6 as the starting spot.

满分题解

/**
 * 题目：PAT_A实战-XFS-简单-2021秋-DFS遍历
 *
 * 说明：
 * 1. 输入：n,m, m行边(u,v)
 * 2. 任务：如上所述
 * 3. 输出：最佳起点，能遍历到的最多点数
 *
 * 技巧：
 * 1. 当时想先暴力做这题然后等着超时的，没想到过了，甚至有点小失望（后来想想N那么小，能暴力也很合理）；
 *    图论的题的难度奠定了PAT甲级的难度，所以这次考试偏简单
 *
 */
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<climits>
using namespace std;

#define MAXN        109

int n;
int m;
int w[MAXN][MAXN];

int vis[MAXN];
int cnt;
int cnt_max;
int s_ret;

void dfs(int u)
{
    vis[u] = 1;
    ++cnt;
    for (int v = 1; v <= n; ++v) {
        if (vis[v] == 0 && w[u][v] == 1) {
            dfs(v);
            break;
        }
    }
    vis[u] = 2;
}

int main(void)
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            w[i][j] = INT_MAX;
        }
    }
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        w[u][v] = w[v][u] = 1;
    }

    cnt_max = 0;
    for (int s = 1; s <= n; ++s) {
        cnt = 0;
        memset(vis, 0, sizeof(vis));
        dfs(s);
        if (cnt_max < cnt) {
            cnt_max = cnt;
            s_ret = s;
        }
    }

    cout << s_ret << " " << cnt_max;
    return 0;
}