Slimes

AtCoder

IDabc143_c

Time2000ms

Memory256MB

Difficulty—

There are $N$ slimes lining up from left to right. The colors of these slimes will be given as a string $S$ of length $N$ consisting of lowercase English letters. The $i$\-th slime from the left has the color that corresponds to the $i$\-th character of $S$. Adjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime. Ultimately, how many slimes will be there? ## Constraints * $1 \leq N \leq 10^5$ * $|S| = N$ * $S$ consists of lowercase English letters. ## Input Input is given from Standard Input in the following format: $N$ $S$ [samples]

Samples

Input #1

10
aabbbbaaca

Output #1

5

Ultimately, these slimes will fuse into `abaca`.

Input #2

5
aaaaa

Output #2

1

All the slimes will fuse into one.

Input #3

20
xxzaffeeeeddfkkkkllq

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Slimes",
    "description": {
      "content": "There are $N$ slimes lining up from left to right. The colors of these slimes will be given as a string $S$ of length $N$ consisting of lowercase English letters. The $i$\\-th slime from the left has t",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc143_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ slimes lining up from left to right. The colors of these slimes will be given as a string $S$ of length $N$ consisting of lowercase English letters. The $i$\\-th slime from the left has t...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments