CF508D:Tanya and Password(欧拉通路 & 输出路径)
来源:互联网 发布:cellsens软件 编辑:程序博客网 时间:2024/05/18 02:00
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个长度为3的字符串,问能否组成总长度为N+2的字符串,如abcde=abc+bcd+cde,能就输出给字符串。
思路:每个字串后两位要跟另一个串的前两位一样才能接起来,那么将每个串的前两位和后两位拆开Hash后建边,跑一遍欧拉通路就行。
//referencr:UniqueColor# include <bits/stdc++.h># define pb push_backusing namespace std;const int maxn = 2e5+30;vector<int>edge[maxn];int cnt[maxn], in[maxn], out[maxn];string ans;void dfs(int x){ while(cnt[x] < edge[x].size()) dfs(edge[x][cnt[x]++]); ans += (char)(x%256);}int main(){ int n, u, v; char s[5]; scanf("%d",&n); for(int i=0; i<n; ++i) { scanf("%s",s); u = s[0]*256+s[1]; v = s[1]*256+s[2]; edge[u].pb(v); ++out[u]; ++in[v]; } int _s=0, _e=0, st=u;//有可能起点和终点的入出度差均为0。 for(int i=0; i<maxn; ++i) { int sub = in[i] - out[i]; if(sub == -1) ++_s, st=i; else if(sub == 1) ++_e; else if(sub != 0)return 0*puts("NO"); } if(_s>1 || _e>1 || _s + _e == 1) return 0*puts("NO"); dfs(st); ans += (char)(st/256); if(ans.size() != n+2) puts("NO"); else { puts("YES"); reverse(ans.begin(), ans.end()); cout << ans << endl; } return 0;}
- CF508D:Tanya and Password(欧拉通路 & 输出路径)
- [CF508D] Tanya and Password && 欧拉路径
- codeforces - 508D - Tanya and Password(欧拉通路)
- codeforecs--D. Tanya and Password(输出欧拉路径)
- Codeforces 508D Tanya and Password 欧拉通路Euler
- codeforces Round#288D Tanya and Password 欧拉通路
- 【CF 508D】 Tanya and Password (判欧拉路+输出欧拉路径)
- Tanya and Password - CodeForces 508 D 欧拉路径
- 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 #288 (Div. 2) D.Tanya and Password(欧拉路径)
- CF 508D(Tanya and Password-欧拉路径,弗罗莱算法)
- Codeforces Round #288 (Div. 2)-D. Tanya and Password(欧拉路径及其打印)
- Codeforces 508D - Tanya and Password (欧拉道路)
- 【欧拉回路】 Codeforces 288 D Tanya and Password
- codeforces 508D Tanya and Password (有向图欧拉通路)
- 源码剖析——LinkedHashMap
- Hbase单机安装部署
- Spring 事务
- xiaoxin juju needs help
- 10个JavaScript难点,闭包,立即执行函数等
- CF508D:Tanya and Password(欧拉通路 & 输出路径)
- Java多线程编程实战指南(核心篇)读书笔记(四)
- JS作用域与new关键字——长期更新
- Callable和Future的应用
- NYOJ 55 懒省事的小明(哈弗曼树 队列)
- Handler,Looper,Message的理解与困惑
- python dataframe逻辑取值
- 使用Itext对PDF图片进行缩放和移动
- 心情之向上