变形课（DFS）

水题

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<list>
#include<set>
#include<cmath>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 1e9;
const int maxn = 1000 + 15;
int n,m,T,cnt,d[maxn][maxn],c[maxn],vis[maxn];
char s[maxn][maxn];
bool dfs(int cur, char ch) {
    if(ch == 'm') return true;
    for(int i=0;i<cnt;i++) {
        if(!vis[i] && s[i][0] == ch) {
            vis[i] = 1;
            char v = s[i][c[i]-1];
            if(dfs(i,v)) return true;
            vis[i] = 0;
        }
    }
    return false;
}
int main() {
    while(~scanf("%s",s[0])) {
        cnt = 1; c[cnt-1] = strlen(s[0]);
        if(s[0][0] == '0') ;
        else while(true) {
            scanf("%s",s[cnt++]);
            if(s[cnt-1][0] == '0') break;
            c[cnt-1] = strlen(s[cnt-1]);
        }
        memset(vis,0,sizeof(vis));
        bool ok = false;
        for(int i=0;i<cnt;i++) {
            if(s[i][0] == 'b') {
                vis[i] = 1;
                if(dfs(i,s[i][c[i]-1])) { ok = true; break; }
                vis[i] = 0;
            }
        }
        if(ok) printf("Yes.\n");
        else printf("No.\n");
    }
}