結果

問題 No.1192 半部分列
ユーザー koba-e964koba-e964
提出日時 2020-08-28 14:17:52
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 3,988 bytes
コンパイル時間 15,119 ms
コンパイル使用メモリ 378,952 KB
実行使用メモリ 45,116 KB
最終ジャッジ日時 2024-11-09 01:13:29
合計ジャッジ時間 18,249 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 WA -
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 274 ms
45,116 KB
testcase_09 AC 269 ms
43,384 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 1 ms
5,248 KB
testcase_12 AC 274 ms
44,984 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 180 ms
27,576 KB
testcase_16 AC 137 ms
20,736 KB
testcase_17 AC 212 ms
28,268 KB
testcase_18 AC 3 ms
5,248 KB
testcase_19 AC 52 ms
9,600 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 20 ms
23,076 KB
testcase_22 AC 2 ms
5,248 KB
testcase_23 WA -
testcase_24 AC 8 ms
9,344 KB
testcase_25 AC 17 ms
19,652 KB
testcase_26 AC 17 ms
20,012 KB
testcase_27 AC 136 ms
22,856 KB
権限があれば一括ダウンロードができます

ソースコード

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, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($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"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).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! {
        s: chars,
        t: chars,
    }
    let s: Vec<usize> = s.into_iter().map(|c| (c as u8 - b'a') as _).collect();
    let t: Vec<usize> = t.into_iter().map(|c| (c as u8 - b'a') as _).collect();
    let n = s.len();
    let m = t.len();
    let mut dp1 = vec![[n + 1; 26]; n + 1];
    let mut dp2 = vec![[m + 1; 26]; m + 1];
    for i in (0..n).rev() {
        dp1[i] = dp1[i + 1];
        dp1[i][s[i]] = i;
    }
    for i in (0..m).rev() {
        dp2[i] = dp2[i + 1];
        dp2[i][t[i]] = i;
    }
    // j < pos[i] <=> s[i..] is a subsequence of t[j..]
    let mut pos = vec![m + 1; n + 1];
    for i in (0..n).rev() {
        let mut p = min(m, pos[i + 1]);
        while p > 0 {
            if t[p - 1] == s[i] {
                break;
            }
            p -= 1;
        }
        pos[i] = p;
    }
    eprintln!("pos = {:?}", pos);
    let mut ans = vec![];
    let mut cur1 = 0;
    let mut cur2 = 0;
    if pos[0] > 0 {
        puts!("-1\n");
        return;
    }
    while cur1 < n && cur2 <= m {
        let mut nxt = None;
        for i in 0..26 {
            let nxtcur1 = dp1[cur1][i] + 1;
            let nxtcur2 = dp2[cur2][i] + 1;
            if nxtcur1 <= n && pos[nxtcur1] <= nxtcur2 {
                nxt = Some(i);
                break;
            }
        }
        if let Some(nxt) = nxt {
            cur1 = dp1[cur1][nxt] + 1;
            cur2 = dp2[cur2][nxt] + 1;
            ans.push(nxt);
        } else {
            panic!();
        }
    }
    for v in ans {
        puts!("{}", (b'a' + v as u8) as char);
    }
    puts!("\n");
}

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();
}
0