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 competitive::prelude::*;

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

    let ans = [&a, &b, &c]
        .iter()
        .permutations(3)
        .map(|p| solve(p[0], p[1], p[2]))
        .min()
        .unwrap();

    echo!(ans);
}

fn mk_table(a: &[char], b: &[char]) -> Vec<bool> {
    let mut ret = vec![false; a.len() + 1];

    for ofs in 0..=a.len() {
        let mut ok = true;
        for i in ofs..min(a.len(), ofs + b.len()) {
            if !matches(a[i], b[i - ofs]) {
                ok = false;
                break;
            }
        }
        ret[ofs] = ok;
    }

    ret
}

fn solve(a: &[char], b: &[char], c: &[char]) -> usize {
    let ab = mk_table(a, b);
    let ac = mk_table(a, c);
    let bc = mk_table(b, c);

    let mut ret = a.len() + b.len() + c.len();
    for ob in 0..=a.len() {
        for oc in ob..=max(ob + b.len(), a.len()) {
            if ab[ob] && (oc >= ac.len() || ac[oc]) && (oc - ob >= bc.len() || bc[oc - ob]) {
                ret = min(ret, max(a.len(), max(b.len() + ob, c.len() + oc)));
            }
        }
    }

    ret
}

fn matches(a: char, b: char) -> bool {
    a == '?' || b == '?' || a == b
}
*/

fn main() {
    let exe = "/tmp/bin49276FFF";
    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>";