HDU 1181 变形课 DFS

来源：互联网发布：淘宝没有流量怎么办编辑：程序博客网时间：2024/04/30 00:47

思路：开始看错了题目，WA了一发之后，裸搜，也是数据弱，要不然我代码怎么能过。

http://acm.hdu.edu.cn/showproblem.php?pid=1181

/*********************************************    Problem : HDU 1181    Author  : NMfloat    InkTime (c) NM . All Rights Reserved .********************************************/#include <map>#include <set>#include <queue>#include <cmath>#include <ctime>#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <algorithm>#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++)#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)#define cls(a,x)   memset(a,x,sizeof(a))#define eps 1e-8using namespace std;const int MOD = 1e9+7;const int INF = 0x3f3f3f3f;const int MAXN = 1e5+5;const int MAXE = 2e5+5;typedef long long LL;typedef unsigned long long ULL;int T,n,m,k;char s[1005][1005];int lens[1005];int vis[1005];int ok1 ;int pos;void dfs(int u) {    if(ok1) return ;    if(s[u][lens[u]-1] == 'm') { ok1 = 1; return ;}    rep(i,1,pos) {        if(!vis[i] && s[i][0] == s[u][lens[u]-1]) {            vis[i] = 1;            dfs(i);            vis[i] = 0;        }    }}void input() {    pos = 1;    while(s[pos][0] != '0') {        scanf("%s",s[++pos]);        lens[pos] = strlen(s[pos]);    }    --pos;}void solve() {    ok1 = 0;    rep(i,1,pos) {        if(ok1) break;        if(s[i][0] == 'b') {            cls(vis,0);            vis[i] = 1;            dfs(i);        }    }    if(ok1) puts("Yes.");    else puts("No.");}int main(void) {    //freopen("a.in","r",stdin);    while(~scanf("%s",s[1])){        lens[1] = strlen(s[1]);    //while(~scanf("%d %d",&n,&m)) {    //while(scanf("%d",&n),n) {        input();        solve();    }    return 0;}

0 0