Codeforces Beta Round #29 (Div. 2, Codeforces format), problem: (C) Mail Stamps 图论
2013-02-25 13:56
651 查看
题意:给定一些边,求出其中的一条通路。保证那些边实在同一条线段上的。
#include<cstdio> #include<utility> #include<map> using namespace std; map<int,int>node; const int LMT=100003; int mp[LMT][3],see[LMT],du[LMT],cnt; int main(void) { int n,u,v,x,y,s=0,pre=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d%d",&u,&v); if(node.find(u)==node.end())node.insert(make_pair(u,cnt++)); if(node.find(v)==node.end())node.insert(make_pair(v,cnt++)); x=node[u];y=node[v]; mp[x][++mp[x][0]]=y; mp[y][++mp[y][0]]=x; see[x]=u;see[y]=v; du[x]++;du[y]++; } for(s=0;s<cnt&&du[s]!=1;s++); for(int i=0;i<cnt;i++) { printf("%d ",see[s]); if(mp[s][1]==pre) { pre=s;s=mp[s][2]; } else { pre=s; s=mp[s][1]; } } printf("\n"); return 0; }
相关文章推荐
- Codeforces Beta Round #25 (Div. 2 Only), problem: (C) Roads in Berland 图论
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) Problem D (Codeforces 828D) - 贪心
- Codeforces 889B (Codeforces Round #445 Div. 1) Restoration of string 图论
- Codeforces Round #425 (Div. 2) Problem A Sasha and Sticks (Codeforces 832A)
- Codeforces Round #425 (Div. 2) Problem B Petya and Exam (Codeforces 832B) - 暴力
- [最短路 主席树 Hash] Codeforces 464E #265 (Div. 1) E. The Classic Problem
- Codeforces Round #427 (Div. 2) Problem D Palindromic characteristics (Codeforces 835D) - 记忆化搜索
- Codeforces Round #439 (Div. 2) Problem B (Codeforces 869B)
- Codeforces Beta Round #27 (Codeforces format, Div. 2)
- codeforces 29C Mail Stamps(dfs)
- Codeforces Beta Round #29 (Div. 2, Codeforces format) C. Mail Stamps 拓扑排序
- Codeforces Round #439 (Div. 2) Problem C (Codeforces 869C) - 组合数学
- Codeforces Beta Round #31 (Div. 2, Codeforces format)——C
- codeforces 789 div2 题解(AB水题,C dp,D图论)
- Codeforces 858F ( Codeforces Round #434 Div. 2 F ) Wizard's Tour 图论dfs
- Codeforces Beta Round #29 (Div. 2, Codeforces format)-D. Ant on the Tree
- Codeforces Beta Round #27 (Codeforces format, Div. 2) D Ring Road 2(二分图染色版)
- [矩阵乘法转图论 强连通] Codeforces 403C #236 (Div. 1) C. Strictly Positive Matrix
- Codeforces Round #439 (Div. 2) Problem E (Codeforces 869E) - 暴力 - 随机化 - 二维树状数组 - 差分
- Mike and gcd problem-codeforces-Round 410 Div2-C