usaco 3.2 Riding The Fences

最新推荐文章于 2022-08-16 12:12:43 发布

rayafjyblue

最新推荐文章于 2022-08-16 12:12:43 发布

阅读量414

点赞数

CC 4.0 BY-SA版权

分类专栏：图论文章标签： input c

本文链接：https://blog.youkuaiyun.com/rayafjyblue/article/details/6594674

图论专栏收录该内容

2 篇文章

订阅专栏

本文详细介绍了使用C++实现的一种图遍历算法，通过寻找奇数度节点来确定起点，并运用深度优先搜索策略完成图的遍历过程。该算法适用于解决特定类型的图论问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*
ID:rayafjy1
PROG:fence
LANG:C++
*/
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
#define MAX_N 501
#define MAX_M 1024

using namespace std;
vector<int> stack;
int minn, maxx, s, du[MAX_N], map[MAX_N][MAX_N * 2], size[MAX_N];

void input() {
    int m, a, b;
    scanf("%d", &m);
    memset(map, 0, sizeof(map));
    memset(size, 0, sizeof(size));
    minn = MAX_N;
    maxx = 0;
    while (m--) {
        scanf("%d%d", &a, &b);
        map[a][size[a]++] = b;
        map[b][size[b]++] = a;
        minn = min(minn, a);
        minn = min(minn, b);
        maxx = max(maxx, a);
        maxx = max(maxx, b);
    }
    for (int i = minn; i <= maxx; i++)sort(map[i], map[i] + size[i]);
}

void find (int &s) {
    memset(du, 0, sizeof(du));
    int i;
    for (i = minn; i <= maxx; i++) du[i] += size[i];
    s = 1;
    for (i = minn; i <= maxx; i++) if (du[i] % 2) {s = i; break;}
}

bool dfs (int x) {
    int i, j;
    for (i = 0; i < size[x]; i++) {
        int t = map[x][i];
        if (t == -1) continue;
        map[x][i] = -1;
        for (j = 0; j < size[t]; j++)
            if (map[t][j] == x) {map[t][j] = -1;break;}
        dfs(t);
    }
    stack.push_back(x);
    return 0;
}

void dosolve() {
    find(s);
    dfs(s);
    for (int i = (int)stack.size() - 1; i >= 0; i--) printf("%d\n", stack[i]);
}

int main() {
    freopen("fence.in", "r", stdin);
    freopen("fence.out", "w", stdout);
    input();
    dosolve();
    return 0;
}