提出 #14018954

---

ソースコード 拡げる

fn main() {
    let (h, w): (usize, usize) = {
        let mut buf = String::new();
        std::io::stdin().read_line(&mut buf).unwrap();
        let mut iter = buf.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    };

    let mut a: Vec<Vec<usize>> = Vec::with_capacity(h);

    for _ in 0..h {
        let mut buf = String::new();
        std::io::stdin().read_line(&mut buf).unwrap();
        let iter = buf.split_whitespace();
        a.push(iter.map(|x| x.parse().unwrap()).collect());
    }

    for i in 0..h {
        let mut buf = String::new();
        std::io::stdin().read_line(&mut buf).unwrap();
        let iter = buf.split_whitespace();
        for (j, x) in iter.map(|x| x.parse::<i32>().unwrap()).enumerate() {
            a[i][j] = (a[i][j] as i32 - x).abs() as usize;
        }
    }

    let m: usize = (h + w) * 80;

    let mut dp = vec![vec![vec![false; m]; w]; h];
    dp[0][0][a[0][0]] = true;

    for i in 0..h {
        for j in 0..w {
            for k in 0..m {
                if dp[i][j][k] == false { continue; }

                if i + 1 < h {
                    dp[i + 1][j][k + a[i + 1][j]] = true;
                    dp[i + 1][j][(k as i32 - a[i + 1][j] as i32).abs() as usize] = true;
                    dp[i + 1][j][(a[i + 1][j] as i32 - k as i32).abs() as usize] = true;
                }

                if j + 1 < w {
                    dp[i][j + 1][k + a[i][j + 1]] = true;
                    dp[i][j + 1][(k as i32 - a[i][j + 1] as i32).abs() as usize] = true;
                    dp[i][j + 1][(a[i][j + 1] as i32 - k as i32).abs() as usize] = true;
                }
            }
        }
    }

    let mut ans = std::usize::MAX;
    for (i, &x) in dp[h - 1][w - 1].iter().enumerate() {
        if x == true {
            ans = std::cmp::min(ans, i);
        }
    }

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

提出情報

ジャッジ結果