Gym-102411E Equidistant

原题链接：

https://vjudge.net/problem/Gym-102411E

AC代码：

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>

using namespace std;
const int INF = 0x3fffffff;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6 + 10;

void __init__() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
} //head


int n, m;
vector<int> mp[maxn];
queue<int> q;
int dis[maxn];
int num[maxn];

int bfs() {
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        if (num[u] == m) {
            cout << "YES" << endl;
            cout << u << endl;
            return 1;
        }
        int siz = mp[u].size();
        for (int i = 0; i < siz; i++) {
            int v = mp[u][i];
            if (dis[v] == -1) {
                dis[v] = dis[u] + 1;
                num[v] += num[u];
                q.push(v);
            } else if (dis[v] == dis[u] + 1) {
                num[v] += num[u];
            }
        }
    }
    return 0;
}


int main() {
    __init__();
    cin >> n >> m;
    int u, v;
    for (int i = 1; i < n; i++) {
        cin >> u >> v;
        mp[u].push_back(v);
        mp[v].push_back(u);
    }
    int t;
    memset(dis, -1, sizeof(dis));
    memset(num, 0, sizeof(num));
    for (int i = 0; i < m; i++) {
        cin >> t;
        dis[t] = 0;
        num[t] = 1;
        q.push(t);
    }
    if (!bfs())
        cout << "NO" << endl;

    return 0;
}

思路：用队列从m个城市开始每次BFS扫一层，记录深度和被同一层（深度相同）扫过的次数，如果有哪个点被相同深度的搜索扫过m次，就意味着这个点对于m个城市来说深度相同，也即距离相同