Codeforces 725C By Assassin

C. Hidden Word
time limit per test:2 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output
Let’s define a grid to be a set of tiles with 2 rows and 13 columns. Each tile has an English letter written in it. The letters don't have to be unique: there might be two or more tiles with the same letter written on them. Here is an example of a grid:

ABCDEFGHIJKLM
NOPQRSTUVWXYZ

We say that two tiles are adjacent if they share a side or a corner. In the example grid above, the tile with the letter 'A' is adjacent only to the tiles with letters 'B', 'N', and 'O'. A tile is not adjacent to itself.

A sequence of tiles is called a path if each tile in the sequence is adjacent to the tile which follows it (except for the last tile in the sequence, which of course has no successor). In this example, "ABC" is a path, and so is "KXWIHIJK". "MAB" is not a path because 'M' is not adjacent to 'A'. A single tile can be used more than once by a path (though the tile cannot occupy two consecutive places in the path because no tile is adjacent to itself).

You’re given a string s which consists of 27 upper-case English letters. Each English letter occurs at least once in s. Find a grid that contains a path whose tiles, viewed in the order that the path visits them, form the string s. If there’s no solution, print "Impossible" (without the quotes).

Input
The only line of the input contains the string s, consisting of 27 upper-case English letters. Each English letter occurs at least once in s.

Output
Output two lines, each consisting of 13 upper-case English characters, representing the rows of the grid. If there are multiple solutions, print any of them. If there is no solution print "Impossible".
Examples

Input
ABCDEFGHIJKLMNOPQRSGTUVWXYZ

Output
YXWVUTGHIJKLM
ZABCDEFSRQPON

Input
BUVTYZFQSNRIWOXXGJLKACPEMDH

Output
Impossible

这个题目的思路很简单，就是必有两个相同的字母，如果两个相同的字母是相邻的，一定是不能的！然后我们把两个相同字母中间的折半放到两行中（我是放到了后面），然后依次放第一个之前和第二哥之后的，注意！可能之前的或者之后的不够需要另一个补上来，如样例1！

上代码，估计看不太懂。。有点绕。。。

#include<bits/stdc++.h>
#define input freopen("input.txt","r",stdin)
using namespace std;
int pos[26];
int main()
{
    input;
    string s;
    int i,j;
    int start=0,end=0;
    char c[3][14];
    while(cin>>s)
    {
        for(i=0;i<=26;i++) pos[i]=-1;  //初始化，我已经不相信memset了。。。 
        for(i=0;i<=26;i++)
        {
            if(pos[s[i]-'A'+1]==-1)  //我这里每次记录向前错了一位，其实没必要 
                pos[s[i]-'A'+1]=i;
            else if(pos[s[i]-'A'+1]!=-1){ 
                start=pos[s[i]-'A'+1];
                end=i;
                break;   //找到了就跳出，否则找的是26 
            }
        }
        if(end==start+1){  //相邻的是不可能的 
            cout<<"Impossible"<<endl;
            continue;
        }
        int down,up,zhong=end-start-1;   //将需要拆的分成上下两份 
        if(zhong%2==1){
            down=zhong/2+1;
            up=zhong/2;
        }
        else
            down=up=zhong/2;
        c[1][13-up]=s[start];  //放重复值 
        for(i=0;i<up;i++)
            c[1][13-up+i+1]=s[start+i+1];
        for(i=0;i<down;i++)
            c[2][13-i]=s[start+up+i+1];
        int addstart=0;
        for(i=13-up-1;i>=1;i--){ 
            if(end+1<=26){
                end++;
                c[1][i]=s[end];
            }
            else{
                c[1][i]=s[addstart++];
            }
        }
        for(i=1;i<=13-down;i++) {
            if(end+1<=26){
                end++;
                c[2][i]=s[end];
            }
            else
                c[2][i]=s[addstart++];
        }
        for(j=1;j<=2;j++){
            for(i=1;i<=13;i++)
                cout<<c[j][i];
            cout<<endl;
        }
    }
    return 0; 
}