CCC '26 J4 - Snail Path

Time limit: 3.0s\\nMemory limit: 1G\\nCanadian Computing Competition: 2026 Stage 1, Junior #4

A snail is crawling across an infinite grid of equally sized squares.\\nIt can crawl horizontally (east and west) or vertically (north and south), but it cannot crawl diagonally.\\nAs the snail crawls, it leaves a trail of slime which makes the squares of the grid it touches slimy.\\nFor example, after the snail below crawls east 3 squares, there will be 4 slimy squares as shown.

Input Specification

The first line of input contains a positive integer, M, representing the number of movements taken by the snail.\\nThe next M lines will specify the snail's movements, in order.\\nEach movement will contain an uppercase directional letter (N, E, S, or W), followed by a positive integer less than or equal to 20 representing the number of squares the snail crawls in that direction.\\nThe following table shows how the 15 available marks are distributed:

Output Specification

Output the non-negative integer, T, which is the number of times the snail enters a slimy square.

Sample Input 1

Sample Output 1

Explanation for Sample Output 1

The diagram shows the snail's path. Whenever the snail enters a slimy square, a numbered circle is placed along the path.\\nNotice that a single slimy square can be entered multiple times.

Sample Input 2

Output for Sample Input 2

Explanation of Output for Sample Output 2

The snail's path will consist of 38 slimy squares. However, the snail never returns to a square after leaving it, so the snail never enters a slimy square.