UVALive - 2965 Jurassic Remains （LA）

Jurassic Remains

Time Limit: 18000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit]   [Go Back]   [Status]

Description

 

Paleontologists in Siberia have recently found a number of fragments of Jurassic period dinosaur skeleton. The paleontologists have decided to forward them to the paleontology museum. Unfortunately, the dinosaur was so huge, that there was no box that the fragments would fit into. Therefore it was decided to split the skeleton fragments into separate bones and forward them to the museum where they would be reassembled. To make reassembling easier, the joints where the bones were detached from each other were marked with special labels. Meanwhile, after packing the fragments, the new bones were found and it was decided to send them together with the main fragments. So the new bones were added to the package and it was sent to the museum.

However, when the package arrived to the museum some problems have shown up. First of all, not all labels marking the joints were distinct. That is, labels with letters `A' to `Z' were used, and each two joints that had to be connected were marked with the same letter, but there could be several pairs of joints marked with the same letter.

Moreover, the same type of labels was used to make some marks on the new bones added to the box. Therefore, there could be bones with marked joints that need not be connected to the other bones. The problem is slightly alleviated by the fact that each bone has at most one joint marked with some particular letter.

Your task is to help the museum workers to restore some possible dinosaur skeleton fragments. That is, you have to find such set of bones, that they can be connected to each other, so that the following conditions are true:

• If some joint is connected to the other joint, they are marked with the same label.
• For each bone from the set each joint marked with some label is connected to some other joint.
• The number of bones used is maximal possible.

Note that two bones may be connected using several joints.

Input

Input consists of several datasets. The first line of each dataset contains N - the number of bones (1N24). Next N lines contain bones descriptions: each line contains a non-empty sequence of different capital letters, representing labels marking the joints of the corresponding bone.

Output

For each dataset, on the first line of the output print L - the maximal possible number of bones that could be used to reassemble skeleton fragments. After that output L integer numbers in ascending order - the bones to be used. Bones are numbered starting from one, as they are given in the input file.

Sample Input

6
ABD
EG
GE
ABE
AC
BCD

Sample Output

5
1 2 3 5 6

::中途相遇法

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <map>
 using namespace std;
 #define REP(i,n) for(int i=0; i<(n); i++)
 #define FOR(i,s,t) for(int i=(s); i<(t); i++)
 typedef long long ll;
 const int N = ;
 map<int , int > table;
 int A[N],n;

 int bitcount(int x){//计算十进制数转化成2进制后1的个数
     return x==? : bitcount(x/) + (x&);
 }

 void solve(){
     char s[];
     REP(i,n){
         scanf("%s", s);
         A[i] = ;
         for(int j=; s[j] != '\0'; j++) A[i] ^= (<<(s[j] - 'A'));
     }

     table.clear();
     int n1 = n/ , n2 = n-n1;
     REP(i,<<n1){//1<<n1=2^n1种情况,枚举前n1个字符串的所有情况,如i = 3，二进制为011表示选前两个字符串的情况
           int x = ;
           REP(j,n1) if(i & (<<j)) x ^= A[j];
           if(!table.count(x) || bitcount(table[x]) < bitcount(i)) table[x] = i;
           //table[x]保存的是xor值为x的，bitcount尽量大的子集
     }

     int ans = ;
     REP(i,<<n2){//枚举后n2个字符串的所有情况
          int x = ;
          REP(j,n2) if(i & (<<j) ) x ^= A[j + n1];
          if(table.count(x) && bitcount(ans) < bitcount(table[x]) + bitcount(i)) ans = (i<<n1)^table[x];
     }

     printf("%d\n",bitcount(ans));
     REP(i,n) if(ans & (<<i)) printf("%d ", i+);
     puts("");
 }

 int main(){
 //    freopen("in.txt","r",stdin);
     while(scanf("%d",&n)>&&n)
         solve();
     return ;
 }