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-8;
const double PI = atan(1.0)*4;
const int inf = 2139062143 / 2;

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

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

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

        vector <int> getKeys(vector <string> tab){
            m = sz(tab[0]); n = sz(tab);
            for (int i = 0; i < m; ++ i){
                pat[i].clear();
                for (int j = 0; j < n; ++ j)
                    for (int k = j+1; k < n; ++ k)
                        if (tab[k][i] != tab[j][i])
                            pat[i].pb (make_pair(k, j));
            }
            
            clr0 (v);
            vi ans; ans.pb (100); ans.pb (-1);
            for (int i = 0; i < (1<<m); ++ i){
                for (int j = 0; j < m; ++ j)
                    if (v[i^(1<<j)]) v[i] = 1;
                if (v[i]) continue;
                
                if (gao(i)){
                    ans[0] = min(ans[0], __builtin_popcount(i));
                    ans[1] = max(ans[1], __builtin_popcount(i));
                    v[i] = 1;
                }
            }
            if (ans[0] == 100) ans.clear();
            return ans;
        }
        
// BEGIN CUT HERE
    public:
    void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) 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 << "	Expected: " << print_array(Expected) << endl; cerr << "	Received: " << print_array(Received) << endl; } }
    void test_case_0() { string Arr0[] = {
"ABC",
"ABC",
"ABC"
}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = { }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(0, Arg1, getKeys(Arg0)); }
    void test_case_1() { string Arr0[] = {
"ABC",
"ABD",
"ABE"
}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {1, 1 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(1, Arg1, getKeys(Arg0)); }
    void test_case_2() { string Arr0[] = {
"ABC",
"ACD",
"BBE"
}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {1, 2 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(2, Arg1, getKeys(Arg0)); }
    void test_case_3() { string Arr0[] = {"A","B"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {1, 1 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(3, 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[0]))); int Arr1[] = {1, 3 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); verify_case(4, Arg1, getKeys(Arg0)); }

// END CUT HERE

};

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