變形課
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 15961 Accepted Submission(s): 5752
Harry已經將他所會的所有咒語都列成了一個表,他想讓你幫忙計算一下他是否能完成老師的作業,將一個B(ball)變成一個M(Mouse),你知道,如果他自己不能完成的話,他就只好向Hermione請教,並且被迫聽一大堆好好學習的道理.
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 2000
struct Node{
char start;
char end;
};
Node b[maxn];
int vis[maxn];
int cnt;
void dfs(char x);
bool flag ;
int main(){
char tmp[maxn];
cnt = 0;
flag = false;
while(scanf("%s",tmp) != EOF){
if(strcmp(tmp,"0")== 0){
printf("No.\n");
continue;
}
cnt =1;
int len = strlen(tmp);
b[cnt-1].start = tmp[0];
b[cnt-1].end = tmp[len-1];
while(scanf("%s",tmp)!=EOF){
if(strcmp(tmp,"0")==0) break;
cnt++;
int len = strlen(tmp);
b[cnt-1].start = tmp[0];
b[cnt-1].end = tmp[len-1];
}
flag = false;
memset(vis,0,sizeof(vis));
dfs('b');
if(flag){
printf("Yes.\n");
}else{
printf("No.\n");
}
}
return 0;
}
void dfs(char x){
if(flag){
return ;
}
if(x == 'm'){
flag = true;
return ;
}
for(int i = 0; i < cnt; i++){
if(vis[i] == 0 &&b[i].start == x){
vis[i] = 1;
dfs(b[i].end);
vis[i] = 0;
}
}
}