|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 |
#include <iostream> #include <map> #include <stack> #include <queue> #include <string> #include <cstring> #define INF 1000000000 using namespace std; string row[205]; bool trace[205][205]; int N; struct node{ int x; int y; }; int floodFillDfs(node a) { //stack<node> s; queue<node> s; map<int,int> mp; s.push(a); int i,j; int r =0; while(!s.empty()) { node t= s.front();//s.top(); s.pop(); i=t.x; j=t.y; if(i>=N || i<0) continue; if(j>=N || j<0) continue; if(trace[i][j]) continue; trace[i][j]=1; if(row[i][j]=='w') { mp[j]=1; //cout<<"ij = "<<i<<" "<<j<<"\n"; } t.x =i-1; t.y = j; if(row[i][j]=='w') s.push(t); t.x =i-1; t.y = j-1; if(row[i][j]=='w') s.push(t); t.x =i+1; t.y = j+1; if(row[i][j]=='w') s.push(t); t.x =i+1; t.y = j; if(row[i][j]=='w') s.push(t); t.x =i; t.y = j-1; if(row[i][j]=='w') s.push(t); t.x =i; t.y = j+1; if(row[i][j]=='w') s.push(t); } return mp.size(); } int main() { int res; bool flag=false; int kase = 1; while(cin>>N) { if(N==0) break; for(int i=0;i<N;i++) { cin>>row[i]; } for(int i=0;i<205;i++) for(int j=0;j<205;j++) trace[i][j]=false; flag =false; for(int i=0;i<N && flag==false;i++) { if(row[i][0]=='w') { res=0; memset(trace,false,sizeof(trace)); node t; t.x=i;t.y=0; res=floodFillDfs(t); //cout<<res<<"\n"; if(res==N) { flag=1; //cout<<"i "<<i<<"\n"; break; } } } if(flag) cout<<kase++<<" W\n"; else cout<<kase++<<" B\n"; } return 0; } |
This can be done using both stack or queue.