Tanya and Password - CodeForces 508 D 欧拉路径
来源:互联网 发布:php如何获取js的变量 编辑:程序博客网 时间:2024/06/09 23:53
While dad was at work, a little girl Tanya decided to play with dad's password to his secret database. Dad's password is a string consisting of n + 2 characters. She has written all the possible n three-letter continuous substrings of the password on pieces of paper, one for each piece of paper, and threw the password out. Each three-letter substring was written the number of times it occurred in the password. Thus, Tanya ended up with n pieces of paper.
Then Tanya realized that dad will be upset to learn about her game and decided to restore the password or at least any string corresponding to the final set of three-letter strings. You have to help her in this difficult task. We know that dad's password consisted of lowercase and uppercase letters of the Latin alphabet and digits. Uppercase and lowercase letters of the Latin alphabet are considered distinct.
The first line contains integer n (1 ≤ n ≤ 2·105), the number of three-letter substrings Tanya got.
Next n lines contain three letters each, forming the substring of dad's password. Each character in the input is a lowercase or uppercase Latin letter or a digit.
If Tanya made a mistake somewhere during the game and the strings that correspond to the given set of substrings don't exist, print "NO".
If it is possible to restore the string that corresponds to given set of substrings, print "YES", and then print any suitable password option.
5acaabaabacabbac
YESabacaba
4abcbCbcb1b13
NO
7aaaaaaaaaaaaaaaaaaaaa
YESaaaaaaaaa
题意:将给定的序列连成一个n+2的字符串。
思路:将abc拆成ab和bc,看做是点u和v,找出欧拉路径即可。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;struct node{ int v,next;}edge[200010];int n,Head[100010],in[100010],p[100010],vis[200010],num,num2,tot,ans[200010];char s[10];void add(int u,int v){ edge[++tot].v=v; edge[tot].next=Head[u]; Head[u]=tot;}void dfs(int u){ for(int i=Head[u];i!=-1;i=Head[u]) { if(vis[i]==0) { vis[i]=1; Head[u]=edge[i].next; dfs(edge[i].v); } } ans[num2--]=u;}void solve(){ int i,j,k,u,v,a=0,b=0; scanf("%d",&n); memset(Head,-1,sizeof(Head)); for(i=1;i<=n;i++) { scanf("%s",s); u=s[0]*500+s[1]; v=s[1]*500+s[2]; add(u,v); if(!vis[u]) p[++num]=u,vis[u]=1; if(!vis[v]) p[++num]=v,vis[v]=1; in[u]++; in[v]--; } u=p[1]; for(i=1;i<=num;i++) { v=p[i]; if(in[v]<-1 || in[v]>1) { printf("NO\n"); return; } else if(in[v]==1) a++,u=v; else if(in[v]==-1) b++; } if(!(a==b && a<=1)) { printf("NO\n"); return; } num2=n+1; memset(vis,0,sizeof(vis)); dfs(u); if(num2!=0) { printf("NO\n"); return; } else { printf("YES\n"); printf("%c%c",u/500,u%500); for(i=2;i<=n+1;i++) printf("%c",ans[i]%500); printf("\n"); }}int main(){ solve();}
- Tanya and Password - CodeForces 508 D 欧拉路径
- CodeForces 508D Tanya and Password(欧拉路径)
- CodeForces 508D Tanya and Password欧拉路径
- Codeforces 508D Tanya and Password 欧拉通路Euler
- Codeforces 508D - Tanya and Password (欧拉道路)
- codeforces - 508D - Tanya and Password(欧拉通路)
- Codeforces Round #288 (Div. 2) D.Tanya and Password(欧拉路径)
- Codeforces Round #288 (Div. 2)-D. Tanya and Password(欧拉路径及其打印)
- codeforces Round#288D Tanya and Password 欧拉通路
- 【欧拉回路】 Codeforces 288 D Tanya and Password
- codeforecs--D. Tanya and Password(输出欧拉路径)
- CF 508D(Tanya and Password-欧拉路径,弗罗莱算法)
- 【CF 508D】 Tanya and Password (判欧拉路+输出欧拉路径)
- [CF508D] Tanya and Password && 欧拉路径
- Codeforces 508D Tanya and Password
- Codeforces 508D Tanya and Password
- Codeforces Round #288 (Div. 2)D.Tanya and Password——欧拉通路
- Codeforces Round #288 (Div. 2) D. Tanya and Password (欧拉通路)
- [数据结构]图
- vs2013 debug atl com dll
- 2015-02-20
- 新建xib出现的问题,
- 面向对象的三大特征——封装、继承、多态
- Tanya and Password - CodeForces 508 D 欧拉路径
- 39级台阶问题
- 【Uva 1339】 Ancient Cipher
- Java—使用System.arraycopy()实现数组之间的复制
- android canvas的一些知识
- java之多线程优先级
- Develop Project Charter and It’s Significant Role in Project Management Planning
- swift语言IOS8开发战记21 Core Data2
- 【十八招赢定面试】全文