0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 21:08:47 +00:00
Baoshuo Ren 2022-06-24 18:59:14 +08:00
parent 21e2411af5
commit 799b57e9f4
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A
3 changed files with 67 additions and 0 deletions

61
AcWing/1124/1124.cpp Normal file
View File

@ -0,0 +1,61 @@
#include <iostream>
#include <algorithm>
#include <limits>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 505;
int m, g[N][N], d[N];
int min = std::numeric_limits<int>::max(),
max = std::numeric_limits<int>::min();
int cnt, ans[N << 1];
void dfs(int u) {
for (int i = min; i <= max; i++) {
if (g[u][i]) {
g[u][i]--, g[i][u]--;
dfs(i);
}
}
ans[++cnt] = u;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> m;
while (m--) {
int u, v;
cin >> u >> v;
g[u][v]++, g[v][u]++;
d[u]++, d[v]++;
min = std::min({min, u, v});
max = std::max({max, u, v});
}
int s = min;
for (int i = min; i <= max; i++) {
if (d[i] & 1) {
s = i;
break;
}
}
dfs(s);
for (int i = cnt; i; i--) {
cout << ans[i] << endl;
}
return 0;
}

BIN
AcWing/1124/data/1.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
AcWing/1124/data/1.in (Stored with Git LFS) Normal file

Binary file not shown.