結果
| 問題 | No.1545 [Cherry 2nd Tune N] Anthem |
| ユーザー |
 to-omer
|
| 提出日時 | 2021-06-11 23:42:44 |
| 言語 | Rust (1.77.0) |
| 結果 |
AC
|
| 実行時間 | 63 ms / 3,000 ms |
| コード長 | 19,475 bytes |
| コンパイル時間 | 2,119 ms |
| コンパイル使用メモリ | 175,632 KB |
| 実行使用メモリ | 40,584 KB |
| 最終ジャッジ日時 | 2023-08-21 14:51:59 |
| 合計ジャッジ時間 | 13,696 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 1 ms
4,380 KB |
| testcase_03 | AC | 1 ms
4,376 KB |
| testcase_04 | AC | 24 ms
19,480 KB |
| testcase_05 | AC | 60 ms
40,552 KB |
| testcase_06 | AC | 25 ms
17,376 KB |
| testcase_07 | AC | 24 ms
21,556 KB |
| testcase_08 | AC | 45 ms
23,280 KB |
| testcase_09 | AC | 21 ms
15,144 KB |
| testcase_10 | AC | 20 ms
16,804 KB |
| testcase_11 | AC | 34 ms
23,348 KB |
| testcase_12 | AC | 53 ms
32,920 KB |
| testcase_13 | AC | 19 ms
13,084 KB |
| testcase_14 | AC | 25 ms
18,704 KB |
| testcase_15 | AC | 8 ms
6,028 KB |
| testcase_16 | AC | 36 ms
26,128 KB |
| testcase_17 | AC | 14 ms
9,920 KB |
| testcase_18 | AC | 63 ms
30,740 KB |
| testcase_19 | AC | 31 ms
20,112 KB |
| testcase_20 | AC | 14 ms
9,192 KB |
| testcase_21 | AC | 50 ms
32,312 KB |
| testcase_22 | AC | 49 ms
25,500 KB |
| testcase_23 | AC | 35 ms
20,896 KB |
| testcase_24 | AC | 3 ms
4,376 KB |
| testcase_25 | AC | 2 ms
4,380 KB |
| testcase_26 | AC | 1 ms
4,380 KB |
| testcase_27 | AC | 1 ms
4,380 KB |
| testcase_28 | AC | 3 ms
4,380 KB |
| testcase_29 | AC | 3 ms
4,376 KB |
| testcase_30 | AC | 3 ms
4,380 KB |
| testcase_31 | AC | 2 ms
4,380 KB |
| testcase_32 | AC | 1 ms
4,380 KB |
| testcase_33 | AC | 3 ms
4,376 KB |
| testcase_34 | AC | 2 ms
4,376 KB |
| testcase_35 | AC | 6 ms
4,380 KB |
| testcase_36 | AC | 4 ms
4,380 KB |
| testcase_37 | AC | 1 ms
4,380 KB |
| testcase_38 | AC | 2 ms
4,376 KB |
| testcase_39 | AC | 2 ms
4,380 KB |
| testcase_40 | AC | 1 ms
4,376 KB |
| testcase_41 | AC | 1 ms
4,376 KB |
| testcase_42 | AC | 2 ms
4,380 KB |
| testcase_43 | AC | 2 ms
4,376 KB |
| testcase_44 | AC | 3 ms
4,380 KB |
| testcase_45 | AC | 4 ms
4,576 KB |
| testcase_46 | AC | 3 ms
4,376 KB |
| testcase_47 | AC | 5 ms
4,380 KB |
| testcase_48 | AC | 12 ms
9,216 KB |
| testcase_49 | AC | 9 ms
5,704 KB |
| testcase_50 | AC | 14 ms
9,024 KB |
| testcase_51 | AC | 1 ms
4,384 KB |
| testcase_52 | AC | 16 ms
8,780 KB |
| testcase_53 | AC | 8 ms
5,620 KB |
| testcase_54 | AC | 2 ms
4,380 KB |
| testcase_55 | AC | 13 ms
7,628 KB |
| testcase_56 | AC | 3 ms
4,380 KB |
| testcase_57 | AC | 9 ms
6,032 KB |
| testcase_58 | AC | 9 ms
5,652 KB |
| testcase_59 | AC | 3 ms
4,380 KB |
| testcase_60 | AC | 3 ms
4,380 KB |
| testcase_61 | AC | 3 ms
4,376 KB |
| testcase_62 | AC | 8 ms
5,200 KB |
| testcase_63 | AC | 4 ms
4,376 KB |
| testcase_64 | AC | 48 ms
35,116 KB |
| testcase_65 | AC | 1 ms
4,376 KB |
| testcase_66 | AC | 43 ms
40,584 KB |
ソースコード
pub fn main() {
crate::prepare!();
sc!(n, s: Usize1, t: Usize1, k: Usize1, x: [usize; n], m, (g, y): {DirectedGraphScanner::<Usize1, usize>::new(n, m)});
let mut dp = vec![vec![None; n]; k + 1];
dp[0][s] = Some((x[s], 0));
for i in 0..k {
for u in g.vertices() {
if let Some((d, _)) = dp[i][u] {
for a in g.adjacencies(u) {
let nd = d + y[a.id] + x[a.to];
if dp[i + 1][a.to].map_or(true, |t| t.0 > nd) {
dp[i + 1][a.to] = Some((nd, u));
}
}
}
}
}
let rg = DirectedSparseGraph::from_edges(n, g.edges.iter().map(|&(u, v)| (v, u)).collect());
let mut cs = vec![None; n];
cs[t] = Some((x[t], 0));
let mut heap = BinaryHeap::new();
heap.push((Reverse(x[t]), t));
while let Some((Reverse(d), u)) = heap.pop() {
if cs[u].as_ref().unwrap().0 < d {
continue;
}
for a in rg.adjacencies(u) {
let nd = d + y[a.id] + x[a.to];
if cs[a.to].map_or(true, |t| t.0 > nd) {
cs[a.to] = Some((nd, u));
heap.push((Reverse(nd), a.to));
}
}
}
let mut p: Option<(usize, usize)> = None;
for u in g.vertices() {
if dp[k][u].is_some() && cs[u].is_some() {
let d = dp[k][u].unwrap().0 + cs[u].unwrap().0 - x[u];
if p.map_or(true, |p| p.1 > d) {
p = Some((u, d))
}
}
}
if let Some((p, d)) = p {
let mut path1 = vec![p];
{
let mut p = p;
let mut k = k;
while k > 0 {
p = dp[k][p].unwrap().1;
path1.push(p);
k -= 1;
}
path1.reverse();
}
let mut path2 = vec![];
{
let mut p = p;
while p != t {
p = cs[p].unwrap().1;
path2.push(p);
}
}
path1.append(&mut path2);
pp!("Possible"; d; path1.len(); @iter path1.iter().map(|i| i + 1));
} else {
pp!("Impossible");
}
}
use std::{cmp::Reverse, collections::BinaryHeap};
mod main_macros{#[doc=" Prepare useful macros."]#[doc=" - `prepare!();`: default (all scanner + buf print)"]#[doc=" - `prepare!(?);`: interactive (line scanner + buf print)"]#[macro_export]macro_rules!prepare{(@buf_print($dol:tt))=>{#[allow(unused_imports)]use std::io::Write as _;let __out=std::io::stdout();#[allow(unused_mut,unused_variables)]let mut __out=std::io::BufWriter::new(__out.lock());#[allow(unused_macros)]macro_rules!pp{($dol($dol t:tt)*)=>{$dol crate::iter_print!(__out,$dol($dol t)*)}}};(@normal($dol:tt))=>{let __in_buf=read_stdin_all_unchecked();#[allow(unused_mut,unused_variables)]let mut __scanner=Scanner::new(&__in_buf);#[allow(unused_macros)]macro_rules!sc{($dol($dol t:tt)*)=>{$dol crate::scan!(__scanner,$dol($dol t)*)}}$crate::prepare!{@buf_print($)}};(@interactive($dol:tt))=>{#[allow(unused_imports)]use std::io::Write as _;let __out=std::io::stdout();#[allow(unused_mut,unused_variables)]let mut __out=std::io::BufWriter::new(__out.lock());#[allow(unused_macros)]macro_rules!pp{($dol($dol t:tt)*)=>{$dol crate::iter_print!(__out,$dol($dol t)*)}}#[allow(unused_macros)]macro_rules!scln{($dol($dol t:tt)*)=>{{pp!(@flush);let __in_buf=read_stdin_line();#[allow(unused_mut,unused_variables)]let mut __scanner=Scanner::new(&__in_buf);$dol crate::scan!(__scanner,$dol($dol t)*)}}}};()=>{$crate::prepare!(@normal($))};(?)=>{$crate::prepare!(@interactive($))};}}
mod iter_print{use std::{fmt::Display,io::{Error,Write}};pub trait IterPrint{fn iter_print<W,S>(self,writer:&mut W,sep:S,is_head:bool)->Result<(),Error>where W:Write,S:Display;}macro_rules!iter_print_tuple_impl{(@impl$($A:ident$a:ident)?,$($B:ident$b:ident)*)=>{impl<$($A,)?$($B),*>IterPrint for($($A,)?$($B),*)where$($A:Display,)?$($B:Display),*{#[allow(unused_variables)]fn iter_print<W,S>(self,writer:&mut W,sep:S,is_head:bool)->Result<(),Error>where W:Write,S:Display{let($($a,)?$($b,)*)=self;$(if is_head{::std::write!(writer,"{}",$a)?;}else{::std::write!(writer,"{}{}",sep,$a)?;})?$(::std::write!(writer,"{}{}",sep,$b)?;)*Ok(())}}};(@inc,,$C:ident$c:ident$($D:ident$d:ident)*)=>{iter_print_tuple_impl!(@impl,);iter_print_tuple_impl!(@inc$C$c,,$($D$d)*);};(@inc$A:ident$a:ident,$($B:ident$b:ident)*,$C:ident$c:ident$($D:ident$d:ident)*)=>{iter_print_tuple_impl!(@impl$A$a,$($B$b)*);iter_print_tuple_impl!(@inc$A$a,$($B$b)*$C$c,$($D$d)*);};(@inc$A:ident$a:ident,$($B:ident$b:ident)*,)=>{iter_print_tuple_impl!(@impl$A$a,$($B$b)*);};($($t:tt)*)=>{iter_print_tuple_impl!(@inc,,$($t)*);};}iter_print_tuple_impl!(A a B b C c D d E e F f G g H h I i J j K k);#[doc=" Print expressions with a separator."]#[doc=" - `iter_print!(writer, args...)`"]#[doc=" - `@sep $expr,`: set separator (default: `' '`)"]#[doc=" - `@fmt $lit => {$($expr),*}`: print `format!($lit, $($expr),*)`"]#[doc=" - `@iter $expr`: print iterator"]#[doc=" - `@tuple $expr`: print tuple (need to import [`IterPrint`])"]#[doc=" - `$expr`: print expr"]#[doc=" - `;`: println"]#[macro_export]macro_rules!iter_print{(@@fmt$writer:expr,$sep:expr,$is_head:expr,$lit:literal,$($e:expr),*)=>{if!$is_head{::std::write!($writer,"{}",$sep).expect("io error");}::std::write!($writer,$lit,$($e),*).expect("io error");};(@@item$writer:expr,$sep:expr,$is_head:expr,$e:expr)=>{$crate::iter_print!(@@fmt$writer,$sep,$is_head,"{}",$e);};(@@line_feed$writer:expr$(,)?)=>{::std::writeln!($writer).expect("io error");};(@@iter$writer:expr,$sep:expr,$is_head:expr,$iter:expr)=>{{let mut iter=$iter.into_iter();if let Some(item)=iter.next(){$crate::iter_print!(@@item$writer,$sep,$is_head,item);}for item in iter{$crate::iter_print!(@@item$writer,$sep,false,item);}}};(@@tuple$writer:expr,$sep:expr,$is_head:expr,$tuple:expr)=>{IterPrint::iter_print($tuple,&mut$writer,$sep,$is_head).expect("io error");};(@@assert_tag item)=>{};(@@assert_tag iter)=>{};(@@assert_tag tuple)=>{};(@@assert_tag$tag:ident)=>{::std::compile_error!(::std::concat!("invalid tag in `iter_print!`: `",std::stringify!($tag),"`"));};(@@inner$writer:expr,$sep:expr,$is_head:expr,@sep$e:expr,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$e,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@flush$($t:tt)*)=>{$writer.flush().expect("io error");$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@fmt$lit:literal=>{$($e:expr),*$(,)?}$($t:tt)*)=>{$crate::iter_print!(@@fmt$writer,$sep,$is_head,$lit,$($e),*);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr,$($t:tt)*)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@inner$writer,$sep,false,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr;$($t:tt)*)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@inner$writer,$sep,true,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@inner$writer,$sep,false,);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$($t:tt)*)=>{::std::compile_error!(::std::concat!("invalid expr in `iter_print!`: `",std::stringify!($($t)*),"`"));};(@@inner$writer:expr,$sep:expr,$is_head:expr,,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,;$($t:tt)*)=>{$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,)=>{$crate::iter_print!(@@line_feed$writer);};(@@inner$writer:expr,$sep:expr,$is_head:expr,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,@item$($t)*);};($writer:expr,$($t:tt)*)=>{{$crate::iter_print!(@@inner$writer,' ',true,$($t)*);}};}}
pub fn read_stdin_all_unchecked()->String{use std::io::Read as _;let mut buf=Vec::new();std::io::stdin().read_to_end(&mut buf).expect("io error");unsafe{String::from_utf8_unchecked(buf)}}
pub fn read_stdin_line()->String{let mut s=String::new();std::io::stdin().read_line(&mut s).expect("io error");s}
pub use scanner_impls::{IterScan,MarkedIterScan,Scanner};
mod scanner_impls{pub trait IterScan:Sized{type Output;fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>;}pub trait MarkedIterScan:Sized{type Output;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>;}#[derive(Clone,Debug)]pub struct Scanner<'a>{iter:std::str::SplitAsciiWhitespace<'a>}impl<'a>Scanner<'a>{#[inline]pub fn new(s:&'a str)->Self{let iter=s.split_ascii_whitespace();Self{iter}}#[inline]pub fn scan<T>(&mut self)-><T as IterScan>::Output where T:IterScan{<T as IterScan>::scan(&mut self.iter).expect("scan error")}#[inline]pub fn mscan<T>(&mut self,marker:T)-><T as MarkedIterScan>::Output where T:MarkedIterScan{marker.mscan(&mut self.iter).expect("scan error")}#[inline]pub fn scan_vec<T>(&mut self,size:usize)->Vec<<T as IterScan>::Output>where T:IterScan{(0..size).map(|_|<T as IterScan>::scan(&mut self.iter).expect("scan error")).collect()}#[inline]pub fn iter<'b,T>(&'b mut self)->ScannerIter<'a,'b,T>where T:IterScan{ScannerIter{inner:self,_marker:std::marker::PhantomData}}}macro_rules!iter_scan_impls{($($t:ty)*)=>{$(impl IterScan for$t{type Output=Self;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self>{iter.next()?.parse::<$t>().ok()}})*};}iter_scan_impls!(char u8 u16 u32 u64 usize i8 i16 i32 i64 isize f32 f64 u128 i128 String);macro_rules!iter_scan_tuple_impl{($($T:ident)*)=>{impl<$($T:IterScan),*>IterScan for($($T,)*){type Output=($(<$T as IterScan>::Output,)*);#[inline]fn scan<'a,It:Iterator<Item=&'a str>>(_iter:&mut It)->Option<Self::Output>{Some(($(<$T as IterScan>::scan(_iter)?,)*))}}};}iter_scan_tuple_impl!();iter_scan_tuple_impl!(A);iter_scan_tuple_impl!(A B);iter_scan_tuple_impl!(A B C);iter_scan_tuple_impl!(A B C D);iter_scan_tuple_impl!(A B C D E);iter_scan_tuple_impl!(A B C D E F);iter_scan_tuple_impl!(A B C D E F G);iter_scan_tuple_impl!(A B C D E F G H);iter_scan_tuple_impl!(A B C D E F G H I);iter_scan_tuple_impl!(A B C D E F G H I J);iter_scan_tuple_impl!(A B C D E F G H I J K);pub struct ScannerIter<'a,'b,T>{inner:&'b mut Scanner<'a>,_marker:std::marker::PhantomData<fn()->T>}impl<'a,'b,T>Iterator for ScannerIter<'a,'b,T>where T:IterScan{type Item=<T as IterScan>::Output;#[inline]fn next(&mut self)->Option<Self::Item>{<T as IterScan>::scan(&mut self.inner.iter)}}#[macro_export]macro_rules!scan_value{($scanner:expr,($($t:tt),*))=>{($($crate::scan_value!($scanner,$t)),*)};($scanner:expr,[$t:tt;$len:expr])=>{(0..$len).map(|_|$crate::scan_value!($scanner,$t)).collect::<Vec<_>>()};($scanner:expr,[$t:ty;$len:expr])=>{$scanner.scan_vec::<$t>($len)};($scanner:expr,[$t:ty])=>{$scanner.iter::<$t>()};($scanner:expr,{$e:expr})=>{$scanner.mscan($e)};($scanner:expr,$t:ty)=>{$scanner.scan::<$t>()};}#[macro_export]macro_rules!scan{($scanner:expr)=>{};($scanner:expr,)=>{};($scanner:expr,mut$var:tt:$t:tt)=>{let mut$var=$crate::scan_value!($scanner,$t);};($scanner:expr,$var:tt:$t:tt)=>{let$var=$crate::scan_value!($scanner,$t);};($scanner:expr,mut$var:tt:$t:tt,$($rest:tt)*)=>{let mut$var=$crate::scan_value!($scanner,$t);scan!($scanner,$($rest)*)};($scanner:expr,$var:tt:$t:tt,$($rest:tt)*)=>{let$var=$crate::scan_value!($scanner,$t);scan!($scanner,$($rest)*)};($scanner:expr,mut$var:tt)=>{let mut$var=$crate::scan_value!($scanner,usize);};($scanner:expr,$var:tt)=>{let$var=$crate::scan_value!($scanner,usize);};($scanner:expr,mut$var:tt,$($rest:tt)*)=>{let mut$var=$crate::scan_value!($scanner,usize);scan!($scanner,$($rest)*)};($scanner:expr,$var:tt,$($rest:tt)*)=>{let$var=$crate::scan_value!($scanner,usize);scan!($scanner,$($rest)*)};}}
pub use marker_impls::{CharWithBase,Chars,CharsWithBase,Collect,SizedCollect,Usize1};
mod marker_impls{use super::*;use std::{iter::{repeat_with,FromIterator},marker::PhantomData};#[derive(Debug,Copy,Clone)]pub struct Usize1;impl IterScan for Usize1{type Output=usize;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{<usize as IterScan>::scan(iter)?.checked_sub(1)}}#[derive(Debug,Copy,Clone)]pub struct CharWithBase(pub char);impl MarkedIterScan for CharWithBase{type Output=usize;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some((<char as IterScan>::scan(iter)?as u8-self.0 as u8)as usize)}}#[derive(Debug,Copy,Clone)]pub struct Chars;impl IterScan for Chars{type Output=Vec<char>;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{Some(iter.next()?.chars().collect())}}#[derive(Debug,Copy,Clone)]pub struct CharsWithBase(pub char);impl MarkedIterScan for CharsWithBase{type Output=Vec<usize>;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some(iter.next()?.chars().map(|c|(c as u8-self.0 as u8)as usize).collect())}}#[derive(Debug,Copy,Clone)]pub struct Collect<T,B=Vec<<T as IterScan>::Output>>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{size:usize,_marker:PhantomData<fn()->(T,B)>}impl<T,B>Collect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{pub fn new(size:usize)->Self{Self{size,_marker:PhantomData}}}impl<T,B>MarkedIterScan for Collect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{type Output=B;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{repeat_with(||<T as IterScan>::scan(iter)).take(self.size).collect()}}#[derive(Debug,Copy,Clone)]pub struct SizedCollect<T,B=Vec<<T as IterScan>::Output>>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{_marker:PhantomData<fn()->(T,B)>}impl<T,B>IterScan for SizedCollect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{type Output=B;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{let size=usize::scan(iter)?;repeat_with(||<T as IterScan>::scan(iter)).take(size).collect()}}}
pub use sparse_graph::{Adjacency,BidirectionalGraphScanner,BidirectionalSparseGraph,DirectedGraphScanner,DirectedSparseGraph,SparseGraph,TreeGraphScanner,UndirectedGraphScanner,UndirectedSparseGraph};
pub mod sparse_graph{use super::*;use std::{iter,marker::PhantomData,ops,slice};type Marker<T>=PhantomData<fn()->T>;#[derive(Clone,Copy,Debug,Default,Eq,PartialEq,Ord,PartialOrd,Hash)]pub struct DirectedEdge;#[derive(Clone,Copy,Debug,Default,Eq,PartialEq,Ord,PartialOrd,Hash)]pub struct UndirectedEdge;#[derive(Clone,Copy,Debug,Default,Eq,PartialEq,Ord,PartialOrd,Hash)]pub struct BidirectionalEdge;#[derive(Clone,Copy,Debug,Default,Eq,PartialEq,Ord,PartialOrd,Hash)]pub struct Adjacency{pub id:usize,pub to:usize}impl Adjacency{pub fn new(id:usize,to:usize)->Adjacency{Adjacency{id,to}}}#[doc=" Static Sparse Graph represented as Compressed Sparse Row."]#[derive(Debug,Clone)]pub struct SparseGraph<D>{vsize:usize,pub start:Vec<usize>,pub elist:Vec<Adjacency>,pub edges:Vec<(usize,usize)>,_marker:Marker<D>}impl<D>SparseGraph<D>{#[doc=" Return the number of vertices."]pub fn vertices_size(&self)->usize{self.vsize}#[doc=" Return the number of edges."]pub fn edges_size(&self)->usize{self.edges.len()}#[doc=" Return an iterator over graph vertices."]pub fn vertices(&self)->ops::Range<usize>{0..self.vertices_size()}#[doc=" Return a slice of adjacency vertices."]pub fn adjacencies(&self,v:usize)->slice::Iter<'_,Adjacency>{self.elist[self.start[v]..self.start[v+1]].iter()}}pub trait SparseGraphConstruction:Sized{fn construct_graph(vsize:usize,edges:Vec<(usize,usize)>)->SparseGraph<Self>;}impl<D:SparseGraphConstruction>SparseGraph<D>{#[doc=" Construct graph from edges."]pub fn from_edges(vsize:usize,edges:Vec<(usize,usize)>)->Self{D::construct_graph(vsize,edges)}}impl SparseGraphConstruction for DirectedEdge{fn construct_graph(vsize:usize,edges:Vec<(usize,usize)>)->SparseGraph<Self>{let mut start:Vec<_>=iter::repeat(0).take(vsize+1).collect();let mut elist=Vec::with_capacity(edges.len());unsafe{elist.set_len(edges.len())}for(from,_)in edges.iter().cloned(){start[from]+=1;}for i in 1..=vsize{start[i]+=start[i-1];}for(id,(from,to))in edges.iter().cloned().enumerate(){start[from]-=1;elist[start[from]]=Adjacency::new(id,to);}SparseGraph{vsize,start,elist,edges,_marker:PhantomData}}}impl SparseGraphConstruction for UndirectedEdge{fn construct_graph(vsize:usize,edges:Vec<(usize,usize)>)->SparseGraph<Self>{let mut start:Vec<_>=iter::repeat(0).take(vsize+1).collect();let mut elist=Vec::with_capacity(edges.len()*2);unsafe{elist.set_len(edges.len()*2)}for(from,to)in edges.iter().cloned(){start[to]+=1;start[from]+=1;}for i in 1..=vsize{start[i]+=start[i-1];}for(id,(from,to))in edges.iter().cloned().enumerate(){start[from]-=1;elist[start[from]]=Adjacency::new(id,to);start[to]-=1;elist[start[to]]=Adjacency::new(id,from);}SparseGraph{vsize,start,elist,edges,_marker:PhantomData}}}impl SparseGraphConstruction for BidirectionalEdge{fn construct_graph(vsize:usize,edges:Vec<(usize,usize)>)->SparseGraph<Self>{let mut start:Vec<_>=iter::repeat(0).take(vsize+1).collect();let mut elist=Vec::with_capacity(edges.len()*2);unsafe{elist.set_len(edges.len()*2)}for(from,to)in edges.iter().cloned(){start[to]+=1;start[from]+=1;}for i in 1..=vsize{start[i]+=start[i-1];}for(id,(from,to))in edges.iter().cloned().enumerate(){start[from]-=1;elist[start[from]]=Adjacency::new(id*2,to);start[to]-=1;elist[start[to]]=Adjacency::new(id*2+1,from);}SparseGraph{vsize,start,elist,edges,_marker:PhantomData}}}pub type DirectedSparseGraph=SparseGraph<DirectedEdge>;pub type UndirectedSparseGraph=SparseGraph<UndirectedEdge>;pub type BidirectionalSparseGraph=SparseGraph<BidirectionalEdge>;pub struct SparseGraphScanner<U:IterScan<Output=usize>,T:IterScan,D>{vsize:usize,esize:usize,_marker:Marker<(U,T,D)>}impl<U:IterScan<Output=usize>,T:IterScan,D>SparseGraphScanner<U,T,D>{pub fn new(vsize:usize,esize:usize)->Self{Self{vsize,esize,_marker:PhantomData}}}impl<U:IterScan<Output=usize>,T:IterScan,D:SparseGraphConstruction>MarkedIterScan for SparseGraphScanner<U,T,D>{type Output=(SparseGraph<D>,Vec<<T as IterScan>::Output>);fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{let mut edges=Vec::with_capacity(self.esize);let mut rest=Vec::with_capacity(self.esize);for _ in 0..self.esize{edges.push((U::scan(iter)?,U::scan(iter)?));rest.push(T::scan(iter)?);}let graph=SparseGraph::from_edges(self.vsize,edges);Some((graph,rest))}}pub type DirectedGraphScanner<U,T=()>=SparseGraphScanner<U,T,DirectedEdge>;pub type UndirectedGraphScanner<U,T=()>=SparseGraphScanner<U,T,UndirectedEdge>;pub type BidirectionalGraphScanner<U,T=()>=SparseGraphScanner<U,T,BidirectionalEdge>;pub struct TreeGraphScanner<U:IterScan<Output=usize>,T:IterScan=()>{vsize:usize,_marker:Marker<(U,T)>}impl<U:IterScan<Output=usize>,T:IterScan>TreeGraphScanner<U,T>{pub fn new(vsize:usize)->Self{Self{vsize,_marker:PhantomData}}}impl<U:IterScan<Output=usize>,T:IterScan>MarkedIterScan for TreeGraphScanner<U,T>{type Output=(UndirectedSparseGraph,Vec<<T as IterScan>::Output>);fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{UndirectedGraphScanner::<U,T>::new(self.vsize,self.vsize-1).mscan(iter)}}}