codeforces-29C-Mail Stamps【离散化】【STLmap】
来源:互联网 发布:淘宝代运营认证 编辑:程序博客网 时间:2024/06/16 02:39
题目链接:点击打开链接
One day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B», they stamp it with «A B», or «B A». Unfortunately, often it is impossible to send a letter directly from the city of the sender to the city of the receiver, that's why the letter is sent via some intermediate cities. Post officers never send a letter in such a way that the route of this letter contains some city more than once. Bob is sure that the post officers stamp the letters accurately.
There are n stamps on the envelope of Bob's letter. He understands that the possible routes of this letter are only two. But the stamps are numerous, and Bob can't determine himself none of these routes. That's why he asks you to help him. Find one of the possible routes of the letter.
The first line contains integer n (1 ≤ n ≤ 105) — amount of mail stamps on the envelope. Then there follow n lines with two integers each — description of the stamps. Each stamp is described with indexes of the cities between which a letter is sent. The indexes of cities are integers from 1 to 109. Indexes of all the cities are different. Every time the letter is sent from one city to another, exactly one stamp is put on the envelope. It is guaranteed that the given stamps correspond to some valid route from some city to some other city.
Output n + 1 numbers — indexes of cities in one of the two possible routes of the letter.
21 100100 2
2 100 1
33 1100 23 2
100 2 3 1
#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include<vector>using namespace std;const int MAX=1e5+10;int n,pos;int ans[MAX];map<int,int> M; // 离散指针 vector<int> G[MAX]; // 邻接表 bool vis[MAX]; // 标记走过的点 bool find(int x,int cnt) // cnt表示访问不同点的个数 {if(cnt==pos){printf("%d ",ans[x]);return 1;}for(int i=0;i<G[x].size();i++){if(!vis[G[x][i]]){vis[G[x][i]]=1;if(find(G[x][i],cnt+1)){printf("%d ",ans[x]);return 1;}vis[G[x][i]]=0;}}}int main(){while(~scanf("%d",&n)){M.clear(); //注意 map 清空 pos=0;int a,b;for(int i=0;i<MAX;i++)G[i].clear(); // 注意 vector 清空 for(int i=0;i<n;i++){scanf("%d %d",&a,&b);if(M[a]==0) // 离散化 {M[a]=++pos;ans[pos]=a;}if(M[b]==0) // 离散化 {M[b]=++pos;ans[pos]=b;}G[M[a]].push_back(M[b]);G[M[b]].push_back(M[a]);}memset(vis,0,sizeof(vis));int x=1;for(int i=1;i<=pos;i++){if(G[i].size()==1){x=i;}}vis[x]=1;find(x,1);puts("");}return 0;}
- codeforces-29C-Mail Stamps【离散化】【STLmap】
- Codeforces 29C Mail Stamps 【离散化 + DFS】
- Codeforces 29C Mail Stamps【离散化+DFS】
- Codeforces 29C Mail Stamps(离散化 && map初探)
- Codeforces #29 C. Mail Stamps
- CF-29C - Mail Stamps(DFS+离散化)
- codeforces C. Mail Stamps
- codeforces 29C Mail Stamps(dfs)
- 【codeforces】29C—Mail Stamps
- Codeforces 29C:Mail Stamps(STL的应用+DFS)
- Codeforces Beta Round #29 (Div. 2, Codeforces format), problem: (C) Mail Stamps 图论
- cf29C. Mail Stamps
- Codeforces 138C(区间更新+离散化)
- CodeForces 670C Cinema(排序,离散化)
- codeforces 713C dp+离散
- codeforces 156C Almost Arithmetical Progression (离散化+dp)
- CodeForces 13C. Sequence 滚动数组+离散化
- Codeforces 567C Geometric Progression (离散 + DP)
- HDU 2141 Can you find it?
- jdbc-odbc操作dbf文件
- 定时器 Timer和TimerTask详解
- 终极讲解,看了立马懂 --》Spring注解@Component、@Repository、@Service、@Controller @Resource、@Autowired、@Qualifier 解析
- Android 广播机制详解
- codeforces-29C-Mail Stamps【离散化】【STLmap】
- mysql存储过程中使用事务
- sphinx全文搜索
- 字符串转换成一个流
- linux下搭建jboss启动服务
- 1.用SDWebImage为UIImageView加载图片时遇到的问题
- 【vector 的用发说明】
- 线程池原理及创建(C++实现)
- 怎么用myeclipse连上远程mysql数据库