결혼식 - 5567
문제https://www.acmicpc.net/problem/5567느낀점기본적인 그래프 문제풀이#include #include #include #include int main(){ int n, m; int start, end; std::map> friends; std::cin >> n; std::cin >> m; std::vector invited(501, false); for (int i = 0; i > start >> end; friends[start].push_back(end); friends[end].push_back(start); } for (auto &pair : friends) { if (pair.f..
2025.02.12