結果

問題 No.34 砂漠の行商人
ユーザー nebocconebocco
提出日時 2021-03-05 07:22:33
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 163 ms / 5,000 ms
コード長 6,404 bytes
コンパイル時間 14,820 ms
コンパイル使用メモリ 379,168 KB
実行使用メモリ 144,000 KB
最終ジャッジ日時 2024-10-06 00:56:15
合計ジャッジ時間 14,367 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 5 ms
5,248 KB
testcase_05 AC 6 ms
5,504 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 9 ms
7,424 KB
testcase_08 AC 13 ms
11,264 KB
testcase_09 AC 77 ms
83,968 KB
testcase_10 AC 110 ms
143,104 KB
testcase_11 AC 102 ms
143,104 KB
testcase_12 AC 5 ms
5,248 KB
testcase_13 AC 163 ms
144,000 KB
testcase_14 AC 142 ms
137,984 KB
testcase_15 AC 33 ms
43,136 KB
testcase_16 AC 30 ms
40,192 KB
testcase_17 AC 50 ms
56,576 KB
testcase_18 AC 6 ms
9,984 KB
testcase_19 AC 52 ms
41,600 KB
testcase_20 AC 76 ms
71,552 KB
testcase_21 AC 3 ms
5,760 KB
testcase_22 AC 64 ms
72,448 KB
testcase_23 AC 48 ms
58,240 KB
testcase_24 AC 121 ms
129,792 KB
testcase_25 AC 15 ms
13,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

fn main() {
	let mut io = IO::new();
    input!{ from io,
		n: usize, mut v: usize, s: (Usize1, Usize1), t: (Usize1, Usize1),
		g: [[usize; n]; n]
    }
	v = v.min(1800);
	let mut dist = vec![vec![vec![std::i64::MAX; v+1]; n]; n];
	let mut mv = vec![vec![0; n]; n];
	dist[s.1][s.0][v] = 0;
	mv[s.1][s.0] = v;
	let mut que = std::collections::VecDeque::new();
	que.push_back((v, s.1, s.0));
	while let Some((v, y, x)) = que.pop_front() {
		// io.println((v, y, x));
		if y > 0 && v > g[y-1][x] && mv[y-1][x] < v - g[y-1][x] && dist[y-1][x][v-g[y-1][x]] > dist[y][x][v] + 1 {
			dist[y-1][x][v-g[y-1][x]] = dist[y][x][v] + 1;
			mv[y-1][x] = v - g[y-1][x];
			que.push_back((v - g[y-1][x], y - 1, x));
		}
		if x > 0 && v > g[y][x-1] && mv[y][x-1] < v - g[y][x-1] && dist[y][x-1][v-g[y][x-1]] > dist[y][x][v] + 1 {
			dist[y][x-1][v-g[y][x-1]] = dist[y][x][v] + 1;
			mv[y][x-1] = v - g[y][x-1];
			que.push_back((v - g[y][x-1], y, x - 1));
		}
		if y + 1 < n && v > g[y+1][x] && mv[y+1][x] < v - g[y+1][x] && dist[y+1][x][v-g[y+1][x]] > dist[y][x][v] + 1 {
			dist[y+1][x][v-g[y+1][x]] = dist[y][x][v] + 1;
			mv[y+1][x] = v - g[y+1][x];
			que.push_back((v - g[y+1][x], y + 1, x));
		}
		if x + 1 < n && v > g[y][x+1] && mv[y][x+1] < v - g[y][x+1] && dist[y][x+1][v-g[y][x+1]] > dist[y][x][v] + 1 {
			dist[y][x+1][v-g[y][x+1]] = dist[y][x][v] + 1;
			mv[y][x+1] = v - g[y][x+1];
			que.push_back((v - g[y][x+1], y, x + 1));
		}
	}
	let ans = *dist[t.1][t.0].iter().min().unwrap();
    if ans == std::i64::MAX {
		io.println(-1);
	} else {
		io.println(ans);
	}
}

// ------------ 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; $len1:expr]; $len2:expr] $($rest:tt)*) => {
			let $($mut)* $var = (0..$len2).map(|_| $io.scan_vec::<$kind>($len1)).collect::<Vec<Vec<$kind>>>();
			input!(@start $io @read @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