就是欧拉回路加上字符串处理啦,不知道为何洛谷上难度会提高/省选-
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int d[501],map[501][501],ans[2001]; int n,m,s1=1e9,s2=1e9,cnt=0; int ch_n(char ch){return (ch>='A'&&ch<='Z')?ch-'A'+1:ch-'a'+27;} char n_ch(int n){return n<=26?n+'A'-1:n+'a'-27;} void solve(int i){ for(int j=1;j<=m;j++) if(map[i][j]){ map[i][j]--; map[j][i]--; solve(j); } ans[++cnt]=i; } int main() { scanf("%d",&n); for(int i=1;i<=n;i++){ char c[2];scanf("%s",c); int x=ch_n(c[0]),y=ch_n(c[1]); map[x][y]++;map[y][x]++; d[x]++;d[y]++; if(x>m)m=x;if(y>m)m=y; } int t=0; for(int i=1;i<=m;i++){ if(d[i]&1){ if(s1==1e9)s1=i;t++; } if(d[i]&&s2==1e9)s2=i; } if(t!=0&&t!=2){puts("No Solution");return 0;} if(s1==1e9)s1=s2;solve(s1); if(cnt-1!=n){puts("No Solution");return 0;} for(int i=cnt;i>=1;i--)printf("%c",n_ch(ans[i])); return 0; }
本文由Yzyet编写,网址为www.cnblogs.com/Yzyet。非Yzyet同意,禁止转载,侵权者必究。