| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 983531 | 2024-05-15T16:05:22 Z | canadavid1 | 어르신 집배원 (BOI14_postmen) | C++14 | 0 ms | 0 KB |
#pragma GCC optimize(3)
#include <iostream>
#include <vector>
#include <unordered_set>
struct Road
{
int a,b;
bool visit;
bool full_visit;
};
struct Node
{
std::unordered_set<int> roads;
};
int main()
{
int N,M;
std::cin >> N >> M;
std::vector<Node> nodes(N+1);
std::vector<Road> roads(M);
for(auto& i : roads)
{
std::cin >> i.a >> i.b;
nodes[i.a].roads.insert(i.b);
nodes[i.b].roads.insert(i.b);
}
std::vector<std::vector<int>> os;
int s = 1;
while(s <= N)
{
auto& out = os.emplace_back();
while(s <= N && nodes[s].roads.size()==0) s++;
if(s>N) break;
out.push_back(s);
while(out.size()==1||out.back()!=out.front())
{
auto n = *nodes[out.back()].roads.begin();
nodes[n].roads.erase(out.back());
nodes[out.back()].roads.erase(n);
out.push_back(n);
}
}
std::vector<std::vector<int>> res;
for(auto v : os)
{
std::unordered_set<int> seen;
std::vector<int> out;
for(auto i : v)
{
if(seen.count(i))
{
auto& w = res.emplace_back();
w.push_back(i);
while(out.back()!=i)
{
w.push_back(out.back());
seen.erase(out.back());
out.pop_back();
}
}
else
{
seen.insert(i);
out.push_back(i);
}
}
}
for(auto v : res)
{
for(auto i : v) std::cout << i << " ";
std::cout << "\n";
}
}