POJ 3007 Organize Your Train part II （字典树 静态）

Organize Your Train part II

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6478		Accepted: 1871

Description

RJ Freight, a Japanese railroad company for freight operations has recently constructed exchange lines at Hazawa, Yokohama. The layout of the lines is shown in Figure 1.

Figure 1: Layout of the exchange lines

A freight train consists of 2 to 72 freight cars. There are 26 types of freight cars, which are denoted by 26 lowercase letters from "a" to "z". The cars of the same type are indistinguishable from each other, and each car's direction doesn't matter either. Thus, a string of lowercase letters of length 2 to 72 is sufficient to completely express the configuration of a train.

Upon arrival at the exchange lines, a train is divided into two sub-trains at an arbitrary position (prior to entering the storage lines). Each of the sub-trains may have its direction reversed (using the reversal line). Finally, the two sub-trains are connected in either order to form the final configuration. Note that the reversal operation is optional for each of the sub-trains.

For example, if the arrival configuration is "abcd", the train is split into two sub-trains of either 3:1, 2:2 or 1:3 cars. For each of the splitting, possible final configurations are as follows ("+" indicates final concatenation position):

  [3:1]
    abc+d  cba+d  d+abc  d+cba
  [2:2]
    ab+cd  ab+dc  ba+cd  ba+dc  cd+ab  cd+ba  dc+ab  dc+ba
  [1:3]
    a+bcd  a+dcb  bcd+a  dcb+a

Excluding duplicates, 12 distinct configurations are possible.

Given an arrival configuration, answer the number of distinct configurations which can be constructed using the exchange lines described above.

Input

The entire input looks like the following.

the number of datasets = m
1st dataset 
2nd dataset 
... 
m-th dataset

Each dataset represents an arriving train, and is a string of 2 to 72 lowercase letters in an input line.

Output

For each dataset, output the number of possible train configurations in a line. No other characters should appear in the output.

Sample Input

4
aa
abba
abcd
abcde

Sample Output

1
6
12
18

Source

Japan 2006 Domestic

 

题目大意：就是一个字符串拆成两部分，然后任何一个可以旋转，然后两个的位置可以变动，所以总共有8种组合，问总共能拼成多少个不同的字符串。

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

struct Trie{
    int cnt;
    int next[26];
}root[1000010];

char str[110];
int len,top,ans;

void init(int k){
    for(int i=0;i<26;i++)
        root[k].next[i]=-1;
    root[k].cnt=0;
}

void InsertTrie(int p){
    for(int i=0;i<len;i++){
        int id=str[i]-'a';
        if(root[p].next[id]==-1){
            root[p].next[id]=top;
            init(top);
            top++;
        }
        p=root[p].next[id];
    }
    if(root[p].cnt==0){
        ans++;
        root[p].cnt++;
    }
}

int main(){

    //freopen("input.txt","r",stdin);

    char s1[110],s2[110],s3[110],s4[110],s5[110];
    int head,t;
    scanf("%d",&t);
    while(t--){
        scanf("%s",s1);
        len=strlen(s1);
        ans=0;
        head=0;
        top=1;
        init(head);
        int i,j;
        for(i=1;i<len;i++){
            for(j=0;j<i;j++){
                s2[j]=s1[j];
                s4[i-1-j]=s2[j];
            }
            s2[i]=''; s4[i]='';
            for(j=i;j<len;j++){
                s3[j-i]=s1[j];
                s5[len-1-j]=s3[j-i];
            }
            s3[j-i]='';   s5[j-i]='';
            strcpy(str,s2); strcat(str,s3);
            InsertTrie(head);

            strcpy(str,s2); strcat(str,s5);
            InsertTrie(head);

            strcpy(str,s3); strcat(str,s2);
            InsertTrie(head);

            strcpy(str,s3); strcat(str,s4);
            InsertTrie(head);

            strcpy(str,s4); strcat(str,s3);
            InsertTrie(head);

            strcpy(str,s4); strcat(str,s5);
            InsertTrie(head);

            strcpy(str,s5); strcat(str,s2);
            InsertTrie(head);

            strcpy(str,s5); strcat(str,s4);
            InsertTrie(head);
        }
        printf("%d
",ans);
    }
    return 0;
}