ACM: poj 1903

Jurassic Remains

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

The first line of the input contains N -- the number of bones (1 <= N <= 24). Next N lines contain bones descriptions: each line contains a non-empty sequence of di#erent capital letters, representing labels marking the joints of the corresponding bone.

Output

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

Sample Input

6


ABD
EG
GE
ABE
AC
BCD

Sample Output

5


1 2 3 5 6



题意: 在给出n个序列中, 尽量选出多的字符串, 使得全部字母出现为偶数. 输出选择个数和

     选择字符串序号.



解题思路:(刘汝佳-训练指南的方法)

     1. 只关注每个字母出现的奇数和偶数的情况, 用0/1表示, 1: 表示出现奇数, 0: 出现偶数.

        记录每个字符串的每个字符出现的奇数偶数情况.

     2. 选择前n/2个字符串, 枚举出全部的所有可以组成的异或值, 接着找出剩下的字符串找出,

        跟前n/2个字符串中, 同样的异或值, 因为异或值一样表示这样组合起来全部的字母都是

        偶数.

     3. 这种策略叫: 中途相遇法.



代码:

#include <cstdio>

#include <iostream>

#include <cstring>

#include <map>