Three Substrings

AtCoder

IDpanasonic2020_e

Time2000ms

Memory256MB

Difficulty—

Snuke has a string $s$. From this string, Anuke, Bnuke, and Cnuke obtained strings $a$, $b$, and $c$, respectively, as follows: * Choose a non-empty (contiguous) substring of $s$ (possibly $s$ itself). Then, replace some characters (possibly all or none) in it with `?`s. For example, if $s$ is `mississippi`, we can choose the substring `ssissip` and replace its $1$\-st and $3$\-rd characters with `?` to obtain `?s?ssip`. You are given the strings $a$, $b$, and $c$. Find the minimum possible length of $s$. ## Constraints * $1 \leq |a|, |b|, |c| \leq 2000$ * $a$, $b$, and $c$ consists of lowercase English letters and `?`s. ## Input Input is given from Standard Input in the following format: $a$ $b$ $c$ [samples]

Samples

Input #1

a?c
der
cod

Output #1

7

For example, $s$ could be `atcoder`.

Input #2

atcoder
atcoder
???????

Output #2

7

$a$, $b$, and $c$ may not be distinct.

API Response (JSON)

{
  "problem": {
    "name": "Three Substrings",
    "description": {
      "content": "Snuke has a string $s$. From this string, Anuke, Bnuke, and Cnuke obtained strings $a$, $b$, and $c$, respectively, as follows: *   Choose a non-empty (contiguous) substring of $s$ (possibly $s$ itse",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "panasonic2020_e"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke has a string $s$. From this string, Anuke, Bnuke, and Cnuke obtained strings $a$, $b$, and $c$, respectively, as follows:\n\n*   Choose a non-empty (contiguous) substring of $s$ (possibly $s$ itse...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments