HDU ACM 1181 变形课 (广搜BFS + 动态数组vector)-------第一次使用动态数组vector

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int MAX = 30;

int main()
{
vector <int> map[MAX];
bool used[MAX] = {0};
char str[110];
while(cin>>str)
{

int mark = 0;
if(str[0] == '0')
{
queue <int> q;
q.push('b' - 'a');
used['b' - 'a'] = 1;
while(!q.empty())
{
int mid = q.front();
q.pop();
int i;
for(i=0;i<map[mid].size();i++)
{
if(!used[map[mid][i]])
{
q.push(map[mid][i]);
used[map[mid][i]] = 1;
if(map[mid][i] == 'm'-'a')
{
mark = 1;
break;
}
}
}
if(mark)
{
break;
}
}
if(mark)
{
cout<<"Yes."<<endl;
}
else
{
cout<<"No."<<endl;
}
memset(used,0,sizeof(used));
int i;
for(i=0;i<MAX;i++)
{
map[i].clear();
}
}
else
{
map[str[0] - 'a'].push_back(str[strlen(str) - 1] - 'a');
}
}
}