### Woburn Challenge 2018-19 Round 1 - Junior Division

## Problem 4: Germaphobia

H.S. High School has `N` (2 ≤ `N` ≤ 100) classrooms in a row, numbered from 1 to `N` in order. There's a common hallway outside the classrooms with a door to each one, meaning that it's possible to move from the hallway to any classroom (or vice versa) by passing through a door. There's also a door between each pair of adjacent classrooms `i` and `i` + 1 (for each 1 ≤ `i` ≤ `N` − 1), meaning that it's possible to move between them in either direction by passing through that door.

For example, if `N` = 4, the school layout looks as follows (with the 4 numbered classrooms at the top, the hallway at the bottom, and doors indicated in brown):

Today, Bob has `M` (1 ≤ `M` ≤ 100) classes to attend, one after another, with the `i`-th one held in classroom `C _{i}` (1 ≤

`C`≤

_{i}`N`). Multiple classes throughout the day may be held in the same classroom, but no pair of consecutive classes are held in the same classroom as one another (in other words,

`C`≠

_{i}`C`

_{i + 1}for each 1 ≤

`i`≤

`M`− 1).

Upon entering the school in the morning, Bob finds himself in the hallway, and will then need to move into his `M` classes' classrooms in order (in other words, he'll need to visit classroom `C`_{1}, then classroom `C`_{2}, and so on). He may freely visit other classrooms or the hallway in between the classes he needs to attend. After attending the `M`-th class, Bob will need to move back into the hallway before heading home.

Bob is well aware of the alarming volume of germs present on school doorknobs, so he'd like to pass through as few doors as possible throughout the day. Help Bob determine the minimum number of doors he must pass through in total.

### Input Format

The first line of input consists of two space-separated integers, `N` and `M`.

`M` lines follow, the `i`-th of which consists of a single integer, `C _{i}`, for

`i`= 1..

`M`.

### Output Format

Output a single integer, the minimum number of doors which Bob must pass through in total.

### Sample Input

4 5 2 3 1 4 3

### Sample Output

8

### Sample Explanation

One optimal route Bob might take is as follows:

Hallway → **Classroom 2** → **Classroom 3** → Classroom 2 → **Classroom 1** → Hallway → **Classroom 4** → **Classroom 3** → Hallway

All Submissions

Best Solutions

**Point Value:** 7 (partial)

**Time Limit:** 2.00s

**Memory Limit:** 16M

**Added:** Nov 17, 2018

**Author:** SourSpinach

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

It's quiet in here...