結果

問題 No.1494 LCS on Tree
ユーザー akakimidoriakakimidori
提出日時 2021-04-30 23:57:09
言語 Rust
(1.77.0)
結果
AC  
実行時間 222 ms / 2,000 ms
コード長 5,799 bytes
コンパイル時間 11,718 ms
コンパイル使用メモリ 404,000 KB
実行使用メモリ 33,792 KB
最終ジャッジ日時 2024-04-30 17:48:12
合計ジャッジ時間 16,254 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,812 KB
testcase_02 AC 0 ms
6,940 KB
testcase_03 AC 68 ms
33,664 KB
testcase_04 AC 87 ms
33,664 KB
testcase_05 AC 88 ms
33,792 KB
testcase_06 AC 85 ms
33,792 KB
testcase_07 AC 85 ms
33,664 KB
testcase_08 AC 84 ms
33,664 KB
testcase_09 AC 87 ms
33,792 KB
testcase_10 AC 87 ms
33,792 KB
testcase_11 AC 89 ms
33,792 KB
testcase_12 AC 84 ms
33,664 KB
testcase_13 AC 86 ms
33,792 KB
testcase_14 AC 69 ms
33,664 KB
testcase_15 AC 69 ms
33,664 KB
testcase_16 AC 70 ms
33,792 KB
testcase_17 AC 74 ms
33,792 KB
testcase_18 AC 70 ms
33,664 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 1 ms
6,944 KB
testcase_22 AC 1 ms
6,944 KB
testcase_23 AC 0 ms
6,944 KB
testcase_24 AC 1 ms
6,944 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 1 ms
6,940 KB
testcase_27 AC 1 ms
6,944 KB
testcase_28 AC 1 ms
6,944 KB
testcase_29 AC 0 ms
6,940 KB
testcase_30 AC 74 ms
33,792 KB
testcase_31 AC 73 ms
33,664 KB
testcase_32 AC 70 ms
33,664 KB
testcase_33 AC 74 ms
33,792 KB
testcase_34 AC 69 ms
33,792 KB
testcase_35 AC 6 ms
6,944 KB
testcase_36 AC 27 ms
11,392 KB
testcase_37 AC 4 ms
6,940 KB
testcase_38 AC 20 ms
9,344 KB
testcase_39 AC 40 ms
16,512 KB
testcase_40 AC 13 ms
6,944 KB
testcase_41 AC 64 ms
25,216 KB
testcase_42 AC 12 ms
6,940 KB
testcase_43 AC 55 ms
22,912 KB
testcase_44 AC 40 ms
17,408 KB
testcase_45 AC 216 ms
33,664 KB
testcase_46 AC 221 ms
33,792 KB
testcase_47 AC 212 ms
33,664 KB
testcase_48 AC 222 ms
33,664 KB
testcase_49 AC 222 ms
33,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin Rerooting ----------
pub trait RerootingOperator {
    type Value: Clone;
    type Edge: Clone;
    fn init(&mut self, v: usize) -> Self::Value;
    fn merge(&mut self, p: &Self::Value, c: &Self::Value, e: &Self::Edge) -> Self::Value;
}

pub struct Rerooting<R: RerootingOperator> {
    manager: R,
    size: usize,
    edge: Vec<(usize, usize, R::Edge, R::Edge)>,
}

impl<R: RerootingOperator> Rerooting<R> {
    pub fn new(size: usize, manager: R) -> Self {
        assert!(size > 0 && size < 10usize.pow(8));
        Rerooting {
            manager: manager,
            size: size,
            edge: vec![],
        }
    }
    pub fn add_edge(&mut self, a: usize, b: usize, cost: R::Edge) {
        assert!(a < self.size && b < self.size && a != b);
        self.add_edge_bi(a, b, cost.clone(), cost);
    }
    pub fn add_edge_bi(&mut self, a: usize, b: usize, ab: R::Edge, ba: R::Edge) {
        assert!(a < self.size && b < self.size && a != b);
        self.edge.push((a, b, ab, ba));
    }
    pub fn solve(&mut self) -> Vec<R::Value> {
        let size = self.size;
        let mut graph = vec![vec![]; size];
        for e in self.edge.iter() {
            graph[e.0].push((e.1, e.2.clone()));
            graph[e.1].push((e.0, e.3.clone()));
        }
        let root = 0;
        let mut topo = vec![root];
        let mut parent = vec![root; size];
        let mut parent_edge: Vec<Option<R::Edge>> = (0..size).map(|_| None).collect();
        for i in 0..size {
            let v = topo[i];
            let child = std::mem::take(&mut graph[v]);
            for e in child.iter() {
                let k = graph[e.0].iter().position(|e| e.0 == v).unwrap();
                let c = graph[e.0].remove(k).1;
                parent_edge[e.0] = Some(c);
                parent[e.0] = v;
                topo.push(e.0);
            }
            graph[v] = child;
        }
        let manager = &mut self.manager;
        let mut down: Vec<_> = (0..size).map(|v| manager.init(v)).collect();
        for &v in topo.iter().rev() {
            for e in graph[v].iter() {
                down[v] = manager.merge(&down[v], &down[e.0], &e.1);
            }
        }
        let mut up: Vec<_> = (0..size).map(|v| manager.init(v)).collect();
        let mut stack = vec![];
        for &v in topo.iter() {
            if let Some(e) = parent_edge[v].take() {
                let ini = manager.init(v);
                up[v] = manager.merge(&ini, &up[v], &e);
            }
            if !graph[v].is_empty() {
                stack.push((graph[v].as_slice(), up[v].clone()));
                while let Some((g, val)) = stack.pop() {
                    if g.len() == 1 {
                        up[g[0].0] = val;
                    } else {
                        let m = g.len() / 2;
                        let (a, b) = g.split_at(m);
                        for a in [(a, b), (b, a)].iter() {
                            let mut p = val.clone();
                            for a in a.0.iter() {
                                p = manager.merge(&p, &down[a.0], &a.1);
                            }
                            stack.push((a.1, p));
                        }
                    }
                }
            }
            for e in graph[v].iter() {
                up[v] = manager.merge(&up[v], &down[e.0], &e.1);
            }
        }
        up
    }
}
// ---------- end Rerooting ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

struct Seq(Vec<u8>);

impl RerootingOperator for Seq {
    type Value = Vec<u32>;
    type Edge = u8;
    fn init(&mut self, _: usize) -> Self::Value {
        vec![0; self.0.len() + 1]
    }
    fn merge(&mut self, p: &Self::Value, c: &Self::Value, e: &Self::Edge) -> Self::Value {
        let mut res = p.clone();
        for (i, s) in self.0.iter().enumerate().rev() {
            let mut val = res[i].max(res[i + 1]).max(c[i]);
            if *s == *e {
                val = val.max(c[i + 1] + 1);
            }
            res[i] = val;
        }
        res
    }
}

fn run() {
    input! {
        n: usize,
        s: bytes,
        e: [(usize1, usize1, bytes); n - 1],
    }
    let s = Seq(s);
    let mut solver = Rerooting::new(n, s);
    for (a, b, c) in e {
        solver.add_edge(a, b, c[0]);
    }
    let ans = solver.solve().into_iter().flatten().max().unwrap();
    println!("{}", ans);
}

fn main() {
    run();
}
0