usaco Riding the Fences(欧拉回路模板)
2016-12-02 22:36
417 查看
用flag记录 度数为奇数点,注意重路。
/*
ID:jinbo wu
TASK:fence
LANG:C++
*/
#include<bits/stdc++.h>
using namespace std;
int g[510][510];
stack<int> s;
int d[510];
void euler(int u)
{
for(int v=1;v<=500;v++)
{
if(g[u][v])
{
g[u][v]--;
g[v][u]--;
euler(v);
s.push(v);
}
}
}
int main()
{
int u,v;
int n;
freopen("fence.in","r",stdin);
freopen("fence.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>u>>v;
g[u][v]++;
g[v][u]++;
d[u]++;
d[v]++;
}
int flag=1;
for(int i=1;i<=500;i++)
if(d[i]%2)
{
flag=i;
break;
}
euler(flag);
s.push(flag);
while(!s.empty())
{
cout<<s.top()<<endl;
s.pop();
}
}
/*
ID:jinbo wu
TASK:fence
LANG:C++
*/
#include<bits/stdc++.h>
using namespace std;
int g[510][510];
stack<int> s;
int d[510];
void euler(int u)
{
for(int v=1;v<=500;v++)
{
if(g[u][v])
{
g[u][v]--;
g[v][u]--;
euler(v);
s.push(v);
}
}
}
int main()
{
int u,v;
int n;
freopen("fence.in","r",stdin);
freopen("fence.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>u>>v;
g[u][v]++;
g[v][u]++;
d[u]++;
d[v]++;
}
int flag=1;
for(int i=1;i<=500;i++)
if(d[i]%2)
{
flag=i;
break;
}
euler(flag);
s.push(flag);
while(!s.empty())
{
cout<<s.top()<<endl;
s.pop();
}
}
相关文章推荐
- USACO - Riding the Fences (Fleury算法找欧拉路径/欧拉回路模板)
- 欧拉回路 USACO 3.3.1 Riding the Fences
- 欧拉路径, 欧拉回路 USACO Riding the Fences
- USACO: Chap3 Riding the Fences
- [USACO3.3.1]Riding the Fences
- USACO Riding Fences 欧拉回路
- usaco Riding the Fences
- 求欧拉回路的路径(usaco3.3Riding the Fences)
- USACO3.3.1--Riding the Fences
- USACO-Section 3.3-PROB Riding The Fences
- usaco 3.2 Riding The Fences
- C++&Pascal——【USACO 3.3.1】——Riding the Fences
- USACO Riding The Fences (点最小字典序欧拉路径 Fleury)
- USACO Riding the Fences 解题报告
- USACO / Riding the Fences (欧拉路径)
- usaco Riding the Fences
- USACO 3.3 Riding The Fences
- USACO Riding the fences and C implement
- usaco 3.3 Riding the Fences
- USACO-Section 3.3 Riding the Fences(欧拉回路)