[2019CCPC哈尔滨] F-Fixing Banners

题目：F-Fixing Banners
题意：
每个测试用例给定6个字符串，看能否用这6个字符串各取1个字符组成“harbin”

思路：
1.深度优先搜索

#include<bits/stdc++.h>
using namespace std;
int vis[10][10];
int v[10];

bool dfs(int step)
{
    if(step == 6)
        return 1;
    for(int i = 0; i < 6; i++)
    {
        if(vis[i][step] && !v[i])
        {
            v[i] = 1;
            if(dfs(step+1))
                return 1;
            v[i] = 0;
        }
    }
    return 0;
}

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        string s[7];
        for(int i = 0; i < 6; i++)
            cin >> s[i];
        memset(vis,0,sizeof(vis));
        memset(v,0,sizeof(v));
        for(int i = 0; i < 6; i++)
        {
            for(int j = 0; j < s[i].size(); i++)
            {
                if(s[i][j] == 'h')
                    vis[i][0] = 1;
                else if(s[i][j] == 'a')
                    vis[i][1] = 1;
                else if(s[i][j] == 'r')
                    vis[i][2] = 1;
                else if(s[i][j] == 'b')
                    vis[i][3] = 1;
                else if(s[i][j] == 'i')
                    vis[i][4] = 1;
                else if(s[i][j] == 'n')
                    vis[i][5] = 1;
            }
        }
        if(dfs(0))
            cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}