1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <string>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>

using namespace std;

int visit[8] = {0,};
vector<string> candiKey;

bool cmp(string a, string b){
    if(a.length() > b.length()) return false;
    else if(a.length() < b.length()) return true;
    else if(a.length() == b.length()){
        if(a > b) return false;
        else return true;
    }
}

void dfs(vector<vector<string>> &relation, int rowCnt, int colCnt, int cnt, int idx){
    if(colCnt < cnt) return;
    else{
        set<string> unique;
        for(int i=0; i<rowCnt; i++){
            string str = "";
            for(int j=0; j<colCnt; j++){
                if(visit[j] == 1) str += relation[i][j];
            }
            unique.insert(str);
        }
        if(unique.size() == rowCnt){
            string str_idx = "";
            for(int i=0; i<colCnt; i++){
                if(visit[i] == 1) str_idx += to_string(i);
            }
            candiKey.push_back(str_idx);
        }
    }

    for(int i=idx; i<colCnt; i++){
        if(visit[i] == 0){
            visit[i] = 1;
            dfs(relation, rowCnt, colCnt, cnt+1, i+1);
            visit[i] = 0;
        }
    }
}
int solution(vector<vector<string>> relation) {
    //relation.clear();
    //relation =    {
    //{
    //{"a","1","aaa","c","ng"},
    //{"a","1","bbb","e","g"},
    //{"c","1","aaa","d","ng"},
    //{"d","2","bbb","d","ng"}}
    int answer = 0;
    int rowCnt = relation.size(); 
    int colCnt = relation[0].size();
    dfs(relation, rowCnt, colCnt, 0, 0);
    sort(candiKey.begin(), candiKey.end(), cmp);

    for(int i=0; i<candiKey.size(); i++){
        string tmp = candiKey[i];
        for(int j=i+1; j<candiKey.size(); j++){
            //제가 말씀드린 부분이 이부분입니다.!!!!!!!
            int sameCnt = 0;
            for(int k=0; k<tmp.length(); k++){
                if(candiKey[j].find(tmp[k]) != string::npos){
                    sameCnt += 1;
                }
            }
            if(sameCnt == tmp.length()){
                candiKey.erase(candiKey.begin()+j);
                j--;
            }
            //여기까지!!!
        }
    }
    answer = candiKey.size();
    return answer;
}

//02 03  013