백준 2660번 회장뽑기 C++

https://www.acmicpc.net/problem/2660

2660번: 회장뽑기

 

bfs

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long; 

int n;
int minScore = 987654321;
vector<int> ans;
vector<vector<bool>> graph;
vector<bool> found;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    graph = vector<vector<bool>>(n + 1, vector<bool>(n + 1, false));
    while (true) {
        int a, b;
        cin >> a >> b;
        if (a == -1 && b == -1) break;
        graph[a][b] = true;
        graph[b][a] = true;
    }
    for (int i = 1; i <= n; i++) {
        found = vector<bool>(n + 1, false);
        int tmpScore = 0;
        queue<pair<int, int>> q;
        q.push({ i,0 });
        found[i] = true;
        while (!q.empty()) {
            auto curr = q.front();
            q.pop();
            tmpScore = max(tmpScore, curr.second);
            for (int i = 1; i <= n; i++) {
                if (graph[curr.first][i] == false) continue;
                if (found[i]) continue;
                found[i] = true;
                q.push({ i,curr.second + 1 });
            }
        }
        if (tmpScore < minScore) {
            ans.clear();
            minScore = tmpScore;
            ans.push_back(i);
        }
        else if (tmpScore == minScore) {
            ans.push_back(i);
        }
    }
    cout << minScore << " " << ans.size() << "\n";
    for (auto a : ans) {
        cout << a << " ";
    }
}