Cow Parade
면접 대비시간 제한1초메모리 제한1024 MB
격자 위를 남북동서로 이동하는 경로가 주어질 때 지나간 서로 다른 거리가 몇 개인지 센다.
문제
Farmer John's cows are participating in the annual Bovington, Wisconsin Cow Parade. The streets in this city form a rectangular grid: they all run north-south or east-west and are equally spaced. Farmer John's cattle parade through the streets.
The cows, being meticulous record keepers, recorded the path of their parade. They wrote exactly a series of D (1 ≤ D ≤ 1,000) directions, such as "north for 3 blocks", then "east for 2 blocks", etc. The distance traveled was always in the range 1..10,000. See the sample data for some of the silly ways the cows recorded their march.
After the parade, the cows wanted to know how many different streets they paraded on. If they paraded on one street, left it, and later paraded on the same street, they only count that street once.
입력
-
Line 1: A single integer, D
-
Lines 2..N+1: Each line describes a sequence part of the parade route and contains:
- A character representing the direction ('N', 'S', 'E', or 'W')
- the number of blocks travelled in that direction.
출력
- Line 1: A single integer containing the number of unique streets visited by the cows.
힌트
[The "N 1", "N 4", and "S 4" are all on the same street. The others are on different unique streets.