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.42.0) (judge verdict: Wrong Answer)

#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]
#![allow(non_snake_case)]
#![allow(unused_mut)]
#![allow(unused_variables)]
#![allow(dead_code)]

use itertools::Itertools;
use proconio::input;
use proconio::marker::{Chars, Usize1};

#[allow(unused_macros)]
#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}

macro_rules! echo {
    ($($a:expr),*) => {
          $(println!("{}",$a))*
      }
}

use std::cmp::*;
use std::collections::*;
use std::ops::{Add, Div, Mul, Sub};

#[allow(dead_code)]
static INF_I64: i64 = 92233720368547758;
#[allow(dead_code)]
static INF_I32: i32 = 21474836;
#[allow(dead_code)]
static INF_USIZE: usize = 18446744073709551;
#[allow(dead_code)]
static M_O_D: usize = 1000000007;
#[allow(dead_code)]
static PAI: f64 = 3.1415926535897932;

trait IteratorExt: Iterator {
    fn toVec(self) -> Vec<Self::Item>;
}

impl<T: Iterator> IteratorExt for T {
    fn toVec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

trait CharExt {
    fn toNum(&self) -> usize;
    fn toAlphabetIndex(&self) -> usize;
    fn toNumIndex(&self) -> usize;
}
impl CharExt for char {
    fn toNum(&self) -> usize {
        return *self as usize;
    }
    fn toAlphabetIndex(&self) -> usize {
        return self.toNum() - 'a' as usize;
    }
    fn toNumIndex(&self) -> usize {
        return self.toNum() - '0' as usize;
    }
}

trait VectorExt {
    fn joinToString(&self, s: &str) -> String;
}
impl<T: ToString> VectorExt for Vec<T> {
    fn joinToString(&self, s: &str) -> String {
        return self
            .iter()
            .map(|x| x.to_string())
            .collect::<Vec<_>>()
            .join(s);
    }
}

trait StringExt {
    fn get_reverse(&self) -> String;
}
impl StringExt for String {
    fn get_reverse(&self) -> String {
        self.chars().rev().collect::<String>()
    }
}

trait UsizeExt {
    fn pow(&self, n: usize) -> usize;
}
impl UsizeExt for usize {
    fn pow(&self, n: usize) -> usize {
        return ((*self as u64).pow(n as u32)) as usize;
    }
}

fn main() {
    use permutohedron::Heap;
    input! {
       mut abc:[Chars;3],
    }

    let mut ans: usize = INF_USIZE;

    let mut heap = Heap::new(&mut abc);
    for data in heap {
        let a = data[0].clone();
        let b = data[1].clone();
        let c = data[2].clone();
        let mut abc = a;
        let mut flag2 = false;
        for i in 0..abc.len() {
            let mut flag = true;
            for j in 0..min(abc.len() - i, b.len()) {
                if (abc[i + j] != '?' && b[j] != '?') && abc[i + j] != b[j] {
                    flag = false;
                    break;
                }
            }
            if flag {
                flag2 = true;
                for j in 0..min(abc.len() - i, b.len()) {
                    if (abc[i + j] == '?' && b[j] != '?') {
                        abc[i + j] = b[j];
                    }
                }
                for j in abc.len() - i..b.len() {
                    abc.push(b[j]);
                }
                break;
            }
        }
        if !flag2 {
            for i in 0..b.len() {
                abc.push(b[i]);
            }
        }
        //mydbg!(abc);
        if abc.len() >= ans {
            continue;
        }
        let mut flag2 = false;
        for i in 0..abc.len() {
            let mut flag = true;
            for j in 0..min(abc.len() - i, c.len()) {
                if (abc[i + j] != '?' && c[j] != '?') && abc[i + j] != c[j] {
                    flag = false;
                    break;
                }
            }
            if flag {
                flag2 = true;
                for j in 0..min(abc.len() - i, c.len()) {
                    if (abc[i + j] == '?' && c[j] != '?') {
                        abc[i + j] = c[j];
                    }
                }
                for j in abc.len() - i..c.len() {
                    abc.push(c[j]);
                }
                break;
            }
        }
        if !flag2 {
            for i in 0..c.len() {
                abc.push(c[i]);
            }
        }
        mydbg!(abc);
        ans = min(ans, abc.len());
    }

    echo!(ans);
}