結果

問題 No.2325 Skill Tree
ユーザー zeronosu77108
提出日時 2023-05-28 14:28:09
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 458 ms / 3,000 ms
コード長 3,891 bytes
コンパイル時間 20,184 ms
コンパイル使用メモリ 405,816 KB
実行使用メモリ 54,380 KB
最終ジャッジ日時 2024-12-27 01:28:47
合計ジャッジ時間 35,798 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::cmp::Reverse`
 --> src/main.rs:1:5
  |
1 | use std::cmp::Reverse;
  |     ^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

ソースコード

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

use std::cmp::Reverse;
use std::collections::VecDeque;
fn main() {
let mut sc = Scanner::new();
let t = 1;
for _ in 0..t { solve(&mut sc); }
}
fn solve(sc:&mut Scanner) {
let n = sc.usize();
let la = (1..n).map(|_| (sc.usize(), sc.usize1())).collect::<Vec<_>>();
let mut g = vec![vec![]; n];
for (i, &(l, a)) in la.iter().enumerate() {
g[a].push((i+1, l));
}
let dist = bfs(0, n, &g);
let mut d = dist.iter().filter_map(|&x| x).collect::<Vec<_>>();
d.sort();
let q = sc.usize();
for _ in 0..q {
let t = sc.u8();
match t {
1 => {
let x = sc.usize();
let index = upper_bound(&d, x);
println!("{}", index);
}
2 => {
let y = sc.usize1();
if let Some(dist) = dist[y] {
println!("{}", dist);
} else {
println!("-1");
}
}
_ => unreachable!()
}
}
}
fn upper_bound<T: Ord>(v: &Vec<T>, x: T) -> usize {
let mut l = 0;
let mut r = v.len();
while l < r {
let m = (l + r) / 2;
if v[m] <= x {
l = m + 1;
} else {
r = m;
}
}
l
}
fn bfs(s:usize, n:usize, g:&Vec<Vec<(usize, usize)>>) -> Vec<Option<usize>> {
let mut q = VecDeque::new(); q.push_back(s);
let mut dist = vec![None; n];
dist[s] = Some(0);
while let Some(v) = q.pop_front() {
for &(u, c) in g[v].iter() {
if dist[u] >= dist[v].max(Some(c)) { continue }
dist[u] = dist[v].max(Some(c));
q.push_back(u);
}
}
dist
}
struct Scanner { s : std::collections::VecDeque<String> } #[allow(unused)] impl Scanner { fn new() -> Self { use std::io::Read; let mut s = String
    ::new(); std::io::stdin().read_to_string(&mut s).unwrap(); Self { s : s.split_whitespace().map(|s| s.to_string()).collect() } } fn reload(&mut
    self) -> () { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); self.s = s.split_whitespace().map
    (|s| s.to_string()).collect(); } fn usize(&mut self) -> usize { self.input() } fn usize1(&mut self) -> usize { self.input::<usize>() - 1 } fn
    isize(&mut self) -> isize { self.input() } fn i32(&mut self) -> i32 { self.input() } fn i64(&mut self) -> i64 { self.input() } fn i128(&mut self)
    -> i128 { self.input() } fn u8(&mut self) -> u8 { self.input() } fn u32(&mut self) -> u32 { self.input() } fn u64(&mut self) -> u64 { self.input()
    } fn u128(&mut self) -> u128 { self.input() } fn edge(&mut self) -> (usize, usize) { (self.usize1(), self.usize1()) } fn edges(&mut self, m :
    usize) -> Vec<(usize, usize)> { let mut e = Vec::with_capacity(m); for _ in 0..m { e.push(self.edge()); } e } fn wedge<T:std::str::FromStr>(&mut
    self) -> (usize, usize, T) { (self.usize1(), self.usize1(), self.input()) } fn wedges<T:std::str::FromStr>(&mut self, m : usize) -> Vec<(usize,
    usize, T)> { let mut e = Vec::with_capacity(m); for _ in 0..m { e.push(self.wedge()); } e } fn input<T>(&mut self) -> T where T: std::str::FromStr
    { if self.s.is_empty() { self.reload(); } if let Some(head) = self.s.pop_front() { head.parse::<T>().ok().unwrap() } else { panic!() } } fn tuple
    <T, U>(&mut self) -> (T, U) where T: std::str::FromStr, U: std::str::FromStr { (self.input(), self.input()) } fn vec<T>(&mut self, n: usize) ->
    Vec<T> where T: std::str::FromStr { if self.s.is_empty() { self.reload(); } self.s.drain(..n).map(|s| s.parse::<T>().ok().unwrap() ).collect::<Vec
    <T>>() } fn nvec<T>(&mut self) -> Vec<T> where T: std::str::FromStr { let n : usize = self.input(); self.vec(n) } fn chars(&mut self) -> Vec<char>
    { let s : String = self.input(); s.chars().collect() } fn bytes(&mut self) -> Vec<u8> { let s : String = self.input(); s.bytes().collect() } }
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0