#include
#include
#include
#include
#include
using namespace std;
#define debug(x) cout#pragma warning(disable:4996)
int dx[4] = {-1,0, 1, 0};
int dy[4] = {0, 1, 0,-1};
bool help(int n, int m, int col) {
//N 0 E 1 S 2 W 3
vector> a(n,vector (m,-1));
vector> v(n,vector (m,-1));
for (size_t i = 0; i for (size_t j = 0; j char c;
cin >> c;
switch (c)
{
case 'N':a[i][j] = 0; break;
case 'E':a[i][j] = 1; break;
case 'S':a[i][j] = 2; break;
case 'W':a[i][j] = 3; break;
default:
break;
}
}
}
int x = 0;
int y = col - 1;
int cnt = 0;
bool out = true;
while (x >= 0 && x = 0 && y int d = a[x][y];
if (v[x][y] >= 0) {
cout out = false;
break;
}
v[x][y] = cnt;
x += dx[d], y += dy[d];
cnt++;
}
if (out) {
cout }
return true;
}
int main()
{
int n, m, col;
//freopen("../in1.txt","r",stdin);
while (cin >> n >> m >> col) {
if (n == 0 && m==0 && col==0) {
break;
}
help(n,m,col);
}
return 0;
}
服务器托管,北京服务器托管,服务器租用,机房机柜带宽租用
咨询:董先生
电话13051898268 QQ/微信93663045!
上一篇: POJ 2632 Crashing Robots【模拟】
下一篇: 树的三种遍历:递归+非递归