結果

問題 No.422 文字列変更 (Hard)
ユーザー koba-e964
提出日時 2021-11-15 00:31:28
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 150 ms / 3,000 ms
コード長 4,193 bytes
コンパイル時間 14,120 ms
コンパイル使用メモリ 379,676 KB
実行使用メモリ 137,344 KB
最終ジャッジ日時 2024-11-30 11:45:37
合計ジャッジ時間 17,065 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
($($r:tt)*) => {
let stdin = std::io::stdin();
let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
let mut next = move || -> String{
bytes.by_ref().map(|r|r.unwrap() as char)
.skip_while(|c|c.is_whitespace())
.take_while(|c|!c.is_whitespace())
.collect()
};
input_inner!{next, $($r)*}
};
}
macro_rules! input_inner {
($next:expr) => {};
($next:expr,) => {};
($next:expr, $var:ident : $t:tt $($r:tt)*) => {
let $var = read_value!($next, $t);
input_inner!{$next $($r)*}
};
}
macro_rules! read_value {
($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };
($next:expr, [ $t:tt ; $len:expr ]) => {
(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
};
($next:expr, chars) => {
read_value!($next, String).chars().collect::<Vec<char>>()
};
($next:expr, usize1) => (read_value!($next, usize) - 1);
($next:expr, [ $t:tt ]) => {{
let len = read_value!($next, usize);
read_value!($next, [$t; len])
}};
($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}
fn main() {
// In order to avoid potential stack overflow, spawn a new thread.
let stack_size = 104_857_600; // 100 MB
let thd = std::thread::Builder::new().stack_size(stack_size);
thd.spawn(|| solve()).unwrap().join().unwrap();
}
fn solve() {
let out = std::io::stdout();
let mut out = BufWriter::new(out.lock());
macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
input! {
n: usize, m: usize,
s: chars,
t: chars,
}
// mode: 0: replace 1: insert 2: delete
const INF: i32 = 1 << 28;
let mut dp = vec![vec![[(INF, 0, 0, 0); 3]; m + 1]; n + 1];
dp[0][0][0] = (0, 0, 0, 0);
for i in 0..n + 1 {
for j in 0..m + 1 {
for _ in 0..2 {
let val = (dp[i][j][0].0 + 7, i, j, 0);
for k in 1..3 {
dp[i][j][k].chmin(val);
let val = (dp[i][j][k].0, i, j, k);
dp[i][j][0].chmin(val);
}
}
// 0: replace
if i < n && j < m {
let val = (dp[i][j][0].0 + if s[i] == t[j] { 0 } else { 5 },
i, j, 0);
dp[i + 1][j + 1][0].chmin(val);
}
// 1: insert
if j < m {
let val = (dp[i][j][1].0 + 2,
i, j, 1);
dp[i][j + 1][1].chmin(val);
}
// 2: delete
if i < n {
let val = (dp[i][j][2].0 + 2,
i, j, 2);
dp[i + 1][j][2].chmin(val);
}
}
}
let (sc, _, _, _) = dp[n][m][0];
puts!("{}\n", sc);
let mut x = n;
let mut y = m;
let mut z = 0;
let mut rs = vec![];
let mut rt = vec![];
while (x, y, z) != (0, 0, 0) {
let (_, nx, ny, nz) = dp[x][y][z];
if (nx, ny) == (x, y) {
z = nz;
continue;
}
assert_eq!(nz, z);
match z {
0 => {
rs.push(s[nx]);
rt.push(t[ny]);
}
1 => {
rs.push('-');
rt.push(t[ny]);
}
2 => {
rs.push(s[nx]);
rt.push('-');
}
_ => panic!(),
}
x = nx;
y = ny;
}
rs.reverse();
rt.reverse();
puts!("{}\n", rs.into_iter().collect::<String>());
puts!("{}\n", rt.into_iter().collect::<String>());
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0