Problem:
Score : 500 points

Problem Statement

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

Output

Print the minimum possible length of s.

Sample Input 1

a?c
der
cod

Sample Output 1

7

For example, s could be atcoder.

Sample Input 2

atcoder
atcoder
???????

Sample Output 2

7

a, b, and c may not be distinct.

Solution in Rust (1.15.1) (judge verdict: Accepted)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use itertools::iproduct;
use proconio::input;
use proconio::marker::Chars;
use std::cmp::{max, min};

const MX: usize = 2005;

fn main() {
    input! {
        a: Chars,
        b: Chars,
        c: Chars,
    }

    let mut ans = std::u64::MAX;
    ans = min(ans, solve(&a, &b, &c));
    ans = min(ans, solve(&a, &c, &b));
    ans = min(ans, solve(&b, &a, &c));
    ans = min(ans, solve(&b, &c, &a));
    ans = min(ans, solve(&c, &a, &b));
    ans = min(ans, solve(&c, &b, &a));

    println!("{}", ans);
}

fn solve(a: &[char], b: &[char], c: &[char]) -> u64 {
    let cache_ab = check(a, b);
    let cache_bc = check(b, c);
    let cache_ac = check(a, c);

    let f = |start, cache: &Vec<bool>| {
        if start >= cache.len() {
            true
        } else {
            cache[start]
        }
    };

    let mut ans: u64 = MX as u64 * 3;
    for (i, j) in iproduct!(0..MX, 0..MX) {
        if !f(i, &cache_ab) {
            continue
        }
        if !f(j, &cache_bc) {
            continue
        }
        if !f(i + j, &cache_ac) {
            continue
        }

        let mut now: u64 = 0;
        now = max(now, a.len() as u64);
        now = max(now, (i + b.len()) as u64);
        now = max(now, (i + j + c.len()) as u64);
        ans = min(ans, now);
    }

    ans
}

fn check(a: &[char], b: &[char]) -> Vec<bool> {
    let mut ret = vec![];
    for start in 0..a.len() {
        let mut ok = true;
        for i in start..a.len() {
            let j = i - start;
            if j >= b.len() {
                break;
            } else if a[i] == '?' || b[j] == '?' {
                continue;
            } else if a[i] != b[j] {
                ok = false;
            }
        }
        ret.push(ok);
    }

    ret
}
*/

fn main() {
    let exe = "/tmp/bin441E786D";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";