题目链接:https://vjudge.net/contest/349864#problem/B
思路:
数据小,暴力一下就好了,构造情况太复杂没想出来。
代码:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
char ss[N];
struct Node{
int x,y;
}cur[N];
int n,tot,b[N];
bool vis[N],fg;
void dfs(int rt)
{
if(rt == tot)
{
fg = true;
for(int i=1;i<=tot;i++)
{
int id = b[i];
for(int j=1;j<=cur[id].y;j++) printf("%c",(char)(cur[id].x + 'a'));
}
printf("\n");
return ;
}
if(fg == true) return ;
for(int i=1;i<=tot;i++)
{
if(vis[i] == true) continue;
if(rt != 0 && abs(cur[ b[rt] ].x - cur[i].x) == 1) continue;
b[rt+1] = i;
vis[i] = true;
dfs(rt+1);
vis[i] = false;
}
}
int main(void)
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%s",ss);
n = strlen(ss);
sort(ss,ss+n);
tot = 0;
for(int i=0;i<n;i++)
{
vis[i] = false;
int cnt = 1;
cur[++tot].x = ss[i] - 'a';
while(i+1<n && ss[i] == ss[i+1]) i++,cnt++;
cur[tot].y = cnt;
}
fg = false;
dfs(0);
if(fg == false) printf("No answer\n");
}
return 0;
}