結果

問題 No.386 貪欲な領主
ユーザー nebocconebocco
提出日時 2021-03-02 19:41:33
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 118 ms / 2,000 ms
コード長 8,455 bytes
コンパイル時間 12,981 ms
コンパイル使用メモリ 377,704 KB
実行使用メモリ 24,440 KB
最終ジャッジ日時 2024-10-03 02:01:20
合計ジャッジ時間 15,723 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 AC 1 ms
5,248 KB
testcase_04 AC 51 ms
24,440 KB
testcase_05 AC 98 ms
22,612 KB
testcase_06 AC 102 ms
22,420 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 11 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 1 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 3 ms
5,248 KB
testcase_14 AC 118 ms
22,460 KB
testcase_15 AC 46 ms
22,656 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

fn main() {
	let mut io = IO::new();
    input!{ from io,
		n: usize,
		ed:[(usize, usize); n-1],
		tax: [i64; n],
		q: usize,
		query: [(usize, usize, i64); q],
    }
	let mut hld = HeavyLightDecomposition::new(n);
	for &(u, v) in &ed {
		hld.add_edge(u, v);
	}
	hld.build(0);
	let mut tt = vec![0; n+1];
	for v in 0..n {
		tt[hld.id(v) + 1] = tax[v];
	}
	for i in 0..n {
		tt[i+1] += tt[i];
	}
	let mut ans = 0;
	for &(u, v, c) in &query {
		let (rl, lr) = hld.for_each_vertex(u, v);
		let mut cur = 0;
		for rng in rl.into_iter().chain(lr) {
			let l = rng.start;
			let r = rng.end;
			cur += tt[r] - tt[l];
		}
		ans += cur * c;
	}
    io.println(ans);
}

// ------------ Heavy Light Decomposition start ------------

use std::ops::Range;

pub struct HeavyLightDecomposition {
	graph: Vec<Vec<usize>>,
	index: Vec<usize>, // 新しい頂点番号
	parent: Vec<usize>, // 親
	head: Vec<usize>, // 属するHeavy Pathの根
	range: Vec<usize>, // 部分木の開区間右端
}

impl HeavyLightDecomposition {
	pub fn new(n: usize) -> Self {
		Self {
			graph: vec![Vec::new(); n],
			index: Vec::new(),
			parent: Vec::new(),
			head: Vec::new(),
			range: Vec::new(),
		}
	}

	pub fn add_edge(&mut self, u: usize, v: usize) {
		self.graph[u].push(v);
		self.graph[v].push(u);
	}

	pub fn build(&mut self, root: usize)  {
		let graph = &mut self.graph;
		let n = graph.len();
		let mut index = vec![0; n];
		let mut parent = vec![n; n];
		let mut head = vec![root; n];
		let mut range = vec![0; n];
		let mut siz = vec![1; n];
		let mut st = Vec::new();
		st.push(root);
		while let Some(v) = st.pop() {
			if v < n {
				st.push(!v);
				if let Some(k) = graph[v].iter().position(|&u| u == parent[v]) {
					graph[v].swap_remove(k);
				}
				graph[v].iter().for_each(|&u| { parent[u] = v; st.push(u); });
			} else {
				let v = !v;
				for i in 0..graph[v].len() {
					let u = graph[v][i];
					siz[v] += siz[u];
					if siz[graph[v][0]] < siz[u] {
						graph[v].swap(0, i);
					}
				}
			}
		}
		st.push(root);
		let mut c = 0;
		while let Some(v) = st.pop() {
			if v < n {
				st.push(!v);
				index[v] = c; c += 1;
				for &u in graph[v].iter().skip(1) {
					head[u] = u;
					st.push(u);
				}
				if let Some(&u) = graph[v].get(0) {
					head[u] = head[v];
					st.push(u);
				}
			} else {
				range[!v] = c;
			}
		}
		self.index = index;
		self.parent = parent;
		self.head = head;
		self.range = range;
	}

	pub fn lca(&self, mut u: usize, mut v: usize) -> usize {
		let parent = &self.parent;
		let head = &self.head;
		let index = &self.index;

		while head[u] != head[v] {
			if index[u] < index[v] {
				v = parent[head[v]];
			} else {
				u = parent[head[u]];
			}
		}
		if index[u] < index[v] {
			u
		} else {
			v
		}
	}

	fn for_each(&self, mut u: usize, mut v: usize, b: usize) -> (Vec<Range<usize>>, Vec<Range<usize>>) {
		let parent = &self.parent;
		let head = &self.head;
		let index = &self.index;

		let mut up = Vec::new();
		let mut down = Vec::new();
		while head[u] != head[v] {
			if index[u] < index[v] {
				let h = head[v];
				down.push(index[h]..index[v] + 1);
				v = parent[h];
			} else {
				let h = head[u];
				up.push(index[h]..index[u] + 1);
				u = parent[h];
			}
		}
		if index[u] < index[v] {
			down.push(index[u] + b .. index[v] + 1);
		} else if index[v] + b < index[u] + 1 {
			up.push(index[v] + b .. index[u] + 1);
		}

		down.reverse();
		(up, down)
	}

	pub fn id(&self, v: usize) -> usize {
		self.index[v]
	}

	pub fn for_each_vertex(&self, u: usize, v: usize) -> (Vec<Range<usize>>, Vec<Range<usize>>) {
		self.for_each(u, v, 0)
	}
	pub fn for_each_edge(&self, u: usize, v: usize) -> (Vec<Range<usize>>, Vec<Range<usize>>) {
		self.for_each(u, v, 1)
	}
	pub fn subtree_range(&self, v: usize) -> Range<usize> {
		self.index[v]..self.range[v]
	}
}

// ------------ Heavy Light Decomposition end ------------


// ------------ io module start ------------
use std::io::{stdout, BufWriter, Read, StdoutLock, Write};

pub struct IO {
	iter: std::str::SplitAsciiWhitespace<'static>,
	buf: BufWriter<StdoutLock<'static>>,
}

impl IO {
	pub fn new() -> Self {
		let mut input = String::new();
		std::io::stdin().read_to_string(&mut input).unwrap();
		let input = Box::leak(input.into_boxed_str());
		let out = Box::new(stdout());
		IO {
			iter: input.split_ascii_whitespace(),
			buf: BufWriter::new(Box::leak(out).lock()),
		}
	}
	fn scan_str(&mut self) -> &'static str {
		self.iter.next().unwrap()
	}
	pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {
		<T as Scan>::scan(self)
	}
	pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {
		(0..n).map(|_| self.scan::<T>()).collect()
	}
	pub fn print<T: Print>(&mut self, x: T) {
		<T as Print>::print(self, x);
	}
	pub fn println<T: Print>(&mut self, x: T) {
		self.print(x);
		self.print("\n");
	}
	pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {
		if let Some(v) = iter.next() {
			self.print(v);
			for v in iter {
				self.print(delim);
				self.print(v);
			}
		}
		self.print("\n");
	}
	pub fn flush(&mut self) {
		self.buf.flush().unwrap();
	}
}

impl Default for IO {
	fn default() -> Self {
		Self::new()
	}
}

pub trait Scan {
	type Output;
	fn scan(io: &mut IO) -> Self::Output;
}

macro_rules! impl_scan {
	($($t:tt),*) => {
		$(
			impl Scan for $t {
				type Output = Self;
				fn scan(s: &mut IO) -> Self::Output {
					s.scan_str().parse().unwrap()
				}
			}
		)*
	};
}

impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String, f32, f64);

pub enum Bytes {}
impl Scan for Bytes {
	type Output = &'static [u8];
	fn scan(s: &mut IO) -> Self::Output {
		s.scan_str().as_bytes()
	}
}

pub enum Chars {}
impl Scan for Chars {
	type Output = Vec<char>;
	fn scan(s: &mut IO) -> Self::Output {
		s.scan_str().chars().collect()
	}
}

pub enum Usize1 {}
impl Scan for Usize1 {
	type Output = usize;
	fn scan(s: &mut IO) -> Self::Output {
		s.scan::<usize>().wrapping_sub(1)
	}
}

impl<T: Scan, U: Scan> Scan for (T, U) {
	type Output = (T::Output, U::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s))
	}
}

impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {
	type Output = (T::Output, U::Output, V::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s), V::scan(s))
	}
}

impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {
	type Output = (T::Output, U::Output, V::Output, W::Output);
	fn scan(s: &mut IO) -> Self::Output {
		(T::scan(s), U::scan(s), V::scan(s), W::scan(s))
	}
}

pub trait Print {
	fn print(w: &mut IO, x: Self);
}

macro_rules! impl_print_int {
	($($t:ty),*) => {
		$(
			impl Print for $t {
				fn print(w: &mut IO, x: Self) {
					w.buf.write_all(x.to_string().as_bytes()).unwrap();
				}
			}
		)*
	};
}

impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize, f32, f64);

impl Print for u8 {
	fn print(w: &mut IO, x: Self) {
		w.buf.write_all(&[x]).unwrap();
	}
}

impl Print for &[u8] {
	fn print(w: &mut IO, x: Self) {
		w.buf.write_all(x).unwrap();
	}
}

impl Print for &str {
	fn print(w: &mut IO, x: Self) {
		w.print(x.as_bytes());
	}
}

impl Print for String {
	fn print(w: &mut IO, x: Self) {
		w.print(x.as_bytes());
	}
}

impl<T: Print, U: Print> Print for (T, U) {
	fn print(w: &mut IO, (x, y): Self) {
		w.print(x);
		w.print(" ");
		w.print(y);
	}
}

impl<T: Print, U: Print, V: Print> Print for (T, U, V) {
	fn print(w: &mut IO, (x, y, z): Self) {
		w.print(x);
		w.print(" ");
		w.print(y);
		w.print(" ");
		w.print(z);
	}
}

mod neboccoio_macro {
	#[macro_export]
	macro_rules! input {
		(@start $io:tt @read @rest) => {};

		(@start $io:tt @read @rest, $($rest: tt)*) => {
			input!(@start $io @read @rest $($rest)*)
		};

		(@start $io:tt @read @rest mut $($rest:tt)*) => {
			input!(@start $io @read @mut [mut] @rest $($rest)*)
		};

		(@start $io:tt @read @rest $($rest:tt)*) => {
			input!(@start $io @read @mut [] @rest $($rest)*)
		};

		(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:expr] $($rest:tt)*) => {
			let $($mut)* $var = $io.scan_vec::<$kind>($len);
			input!(@start $io @read @rest $($rest)*)
		};

		(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {
			let $($mut)* $var = $io.scan::<$kind>();
			input!(@start $io @read @rest $($rest)*)
		};

		(from $io:tt $($rest:tt)*) => {
			input!(@start $io @read @rest $($rest)*)
		};
	}
}

// ------------ io module end ------------
0