SRM 386(1-250pt)

DIV1 250pt

题意：题意很难翻译。。。。其实就是一个暴力。。。在看到有一个限制条件的范围为1-10的时候就该想到是暴力，我却半天没想到。。。。

tag:brute-force

 // BEGIN CUT HERE
 /*
  * Author:  plum rain
  * score :
  */
 /*

  */
 // END CUT HERE
 #line 11 "CandidateKeys.cpp"
 #include <sstream>
 #include <stdexcept>
 #include <functional>
 #include <iomanip>
 #include <numeric>
 #include <fstream>
 #include <cctype>
 #include <iostream>
 #include <cstdio>
 #include <vector>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <cstdlib>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <list>
 #include <string>
 #include <utility>
 #include <map>
 #include <ctime>
 #include <stack>

 using namespace std;

 #define clr0(x) memset(x, 0, sizeof(x))
 #define clr1(x) memset(x, -1, sizeof(x))
 #define pb push_back
 #define sz(v) ((int)(v).size())
 #define all(t) t.begin(),t.end()
 #define zero(x) (((x)>0?(x):-(x))<eps)
 #define out(x) cout<<#x<<":"<<(x)<<endl
 #define tst(a) cout<<a<<" "
 #define tst1(a) cout<<#a<<endl
 #define CINBEQUICKER std::ios::sync_with_stdio(false)

 typedef vector<int> vi;
 typedef vector<string> vs;
 typedef vector<double> vd;
 typedef pair<int, int> pii;
 typedef long long int64;

 const double eps = 1e-;
 const double PI = atan(1.0)*;
 const int inf =  / ;

 class CandidateKeys
 {
     public:
         bool v[];
         int n, m, u[][];
         vector<pii > pat[];

         bool gao(int sta)
         {
             clr0 (u);
             for (int i = ; i < m; ++ i) if (sta & (<<i)){
                 for (int j = ; j < sz(pat[i]); ++ j){
                     int t1 = pat[i][j].first, t2 = pat[i][j].second;
                     u[t1][t2] =  u[t2][t1] = ;
                 }
             }

             for (int i = ; i < n; ++ i)
                 for (int j = i+; j < n; ++ j)
                     if (!u[i][j]) return ;
             return ;
         }

         vector <int> getKeys(vector <string> tab){
             m = sz(tab[]); n = sz(tab);
             for (int i = ; i < m; ++ i){
                 pat[i].clear();
                 for (int j = ; j < n; ++ j)
                     for (int k = j+; k < n; ++ k)
                         if (tab[k][i] != tab[j][i])
                             pat[i].pb (make_pair(k, j));
             }

             clr0 (v);
             vi ans; ans.pb (); ans.pb (-);
             for (int i = ; i < (<<m); ++ i){
                 for (int j = ; j < m; ++ j)
                     if (v[i^(<<j)]) v[i] = ;
                 if (v[i]) continue;

                 if (gao(i)){
                     ans[] = min(ans[], __builtin_popcount(i));
                     ans[] = max(ans[], __builtin_popcount(i));
                     v[i] = ;
                 }
             }
             if (ans[] == ) ans.clear();
             return ans;
         }

 // BEGIN CUT HERE
     public:
     void run_test(int Case) { if ((Case == -) || (Case == )) test_case_0(); if ((Case == -) || (Case == )) test_case_1(); if ((Case == -) || (Case == )) test_case_2(); if ((Case == -) || (Case == )) test_case_3(); if ((Case == -) || (Case == )) test_case_4(); }
     //void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_2();}
     private:
     template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
     void verify_case(int Case, const vector <int> &Expected, const vector <int> &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: " << print_array(Expected) << endl; cerr << "\tReceived: " << print_array(Received) << endl; } }
     void test_case_0() { string Arr0[] = {
 "ABC",
 "ABC",
 "ABC"
 }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[]))); int Arr1[] = { }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[]))); verify_case(, Arg1, getKeys(Arg0)); }
     void test_case_1() { string Arr0[] = {
 "ABC",
 "ABD",
 "ABE"
 }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[]))); int Arr1[] = {,  }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[]))); verify_case(, Arg1, getKeys(Arg0)); }
     void test_case_2() { string Arr0[] = {
 "ABC",
 "ACD",
 "BBE"
 }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[]))); int Arr1[] = {,  }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[]))); verify_case(, Arg1, getKeys(Arg0)); }
     void test_case_3() { string Arr0[] = {"A","B"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[]))); int Arr1[] = {,  }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[]))); verify_case(, Arg1, getKeys(Arg0)); }
     void test_case_4() { string Arr0[] = {
 "AABB",
 "BABA",
 "CAAB",
 "DAAA",
 "EBBB",
 "FBBA",
 "GBAB",
 "HBAA"
 }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[]))); int Arr1[] = {,  }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[]))); verify_case(, Arg1, getKeys(Arg0)); }

 // END CUT HERE

 };

 // BEGIN CUT HERE
 int main()
 {
 //    freopen( "a.out" , "w" , stdout );
     CandidateKeys ___test;
     ___test.run_test(-);
        return ;
 }
 // END CUT HERE