[sicily online]1155. Can I Post the lette(图的深度优先搜索)

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<fstream>
#include<stack>
#include<bitset>
using namespace std;

int main()
{
	int n,m;
	while(cin>>n&&n!=0)
	{
		cin>>m;
		map<int,vector<int> > gra;
		vector<bool> flag(n);
		for(int i=0;i<m;i++)
		{
			int x,y;
			cin>>x>>y;
			gra[x].push_back(y);
		}//read edge
		bool result=false;
		flag[0]=true;
		stack<int> st;
		st.push(0);
		while(!st.empty())//深度优先遍历
		{
			int top=st.top();
			st.pop();
			if(top==n-1)
			{
				result=true;
				break;
			}
			for(int i=0;i<gra[top].size();i++)
			{
				if(flag[gra[top][i]]==true)
					continue;
				flag[gra[top][i]]=true;
				st.push(gra[top][i]);
			}
		}
		if(result)
			cout<<"I can post the letter"<<endl;
		else 
			cout<<"I can't post the letter"<<endl;
	}
}