2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

*3300

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Admissible Map

time limit per test

3 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputA map is a matrix consisting of symbols from the set of 'U', 'L', 'D', and 'R'.

A map graph of a map matrix $$$a$$$ is a directed graph with $$$n \cdot m$$$ vertices numbered as $$$(i, j)$$$ ($$$1 \le i \le n; 1 \le j \le m$$$), where $$$n$$$ is the number of rows in the matrix, $$$m$$$ is the number of columns in the matrix. The graph has $$$n \cdot m$$$ directed edges $$$(i, j) \to (i + di_{a_{i, j}}, j + dj_{a_{i, j}})$$$, where $$$(di_U, dj_U) = (-1, 0)$$$; $$$(di_L, dj_L) = (0, -1)$$$; $$$(di_D, dj_D) = (1, 0)$$$; $$$(di_R, dj_R) = (0, 1)$$$. A map graph is valid when all edges point to valid vertices in the graph.

An admissible map is a map such that its map graph is valid and consists of a set of cycles.

A description of a map $$$a$$$ is a concatenation of all rows of the map — a string $$$a_{1,1} a_{1,2} \ldots a_{1, m} a_{2, 1} \ldots a_{n, m}$$$.

You are given a string $$$s$$$. Your task is to find how many substrings of this string can constitute a description of some admissible map.

A substring of a string $$$s_1s_2 \ldots s_l$$$ of length $$$l$$$ is defined by a pair of indices $$$p$$$ and $$$q$$$ ($$$1 \le p \le q \le l$$$) and is equal to $$$s_ps_{p+1} \ldots s_q$$$. Two substrings of $$$s$$$ are considered different when the pair of their indices $$$(p, q)$$$ differs, even if they represent the same resulting string.

Input

In the only input line, there is a string $$$s$$$, consisting of at least one and at most $$$20\,000$$$ symbols 'U', 'L', 'D', or 'R'.

Output

Output one integer — the number of substrings of $$$s$$$ that constitute a description of some admissible map.

Examples

Input

RDUL

Output

2

Input

RDRU

Output

0

Input

RLRLRL

Output

6

Note

In the first example, there are two substrings that can constitute a description of an admissible map — "RDUL" as a matrix of size $$$2 \times 2$$$ (pic. 1) and "DU" as a matrix of size $$$2 \times 1$$$ (pic. 2).

In the second example, no substring can constitute a description of an admissible map. E. g. if we try to look at the string "RDRU" as a matrix of size $$$2 \times 2$$$, we can find out that the resulting graph is not a set of cycles (pic. 3).

In the third example, three substrings "RL", two substrings "RLRL" and one substring "RLRLRL" can constitute an admissible map, some of them in multiple ways. E. g. here are two illustrations of substring "RLRLRL" as matrices of size $$$3 \times 2$$$ (pic. 4) and $$$1 \times 6$$$ (pic. 5).

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/17/2024 22:19:49 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|