11580번: Footprint

#include <iostream>

using namespace std;

int main()

{

bool foot[2001][2001];

for (int i = 0; i < 2001; ++i)

for (int j = 0; j < 2001; ++j)

foot[i][j] = 0;

int x = 1000, y = 1000, count = 1, l;

char message[1001];

foot[x][y] = 1;

cin >> l >> message;

for (int i = 0; i < l; ++i)

{

switch (message[i])

{

case 'E':++x; break;

case 'W':--x; break;

case 'S':--y; break;

case 'N':++y; break;

}

if (foot[x][y] == 0)

{

foot[x][y] = 1;

++count;

}

}

cout << count;

}