#469860 (Rust) No.1037 exhausted

• 問題: No.1037 exhausted
• ユーザー: ziita
• 提出日時: 2020-04-24 22:58:18
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 45 ms / 2,000 ms
• コード長: 3,258 bytes
• コンパイル時間: 14,024 ms
• コンパイル使用メモリ: 379,060 KB
• 実行使用メモリ: 33,536 KB
• 最終ジャッジ日時: 2024-10-15 03:38:47
• 合計ジャッジ時間: 15,530 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
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	1 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	1 ms; 5,248 KB
testcase_08	AC	1 ms; 5,248 KB
testcase_09	AC	1 ms; 5,248 KB
testcase_10	AC	1 ms; 5,248 KB
testcase_11	AC	1 ms; 5,248 KB
testcase_12	AC	45 ms; 33,408 KB
testcase_13	AC	45 ms; 33,408 KB
testcase_14	AC	45 ms; 33,280 KB
testcase_15	AC	45 ms; 33,280 KB
testcase_16	AC	45 ms; 33,280 KB
testcase_17	AC	45 ms; 33,408 KB
testcase_18	AC	45 ms; 33,408 KB
testcase_19	AC	45 ms; 33,408 KB
testcase_20	AC	41 ms; 33,408 KB
testcase_21	AC	37 ms; 33,408 KB
testcase_22	AC	30 ms; 33,536 KB

ソースコード

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

macro_rules! eprint {
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = write!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! eprintln {
	() => { eprintln!(""); };
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = writeln!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! dbg {
	($v:expr) => {{
		let val = $v;
		eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
		val
	}}
}

macro_rules! mat {
	($($e:expr),*) => { Vec::from(vec![$($e),*]) };
	($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
	($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
	($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
	($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
		$a$([$i])*.$f($($t),*)
	};
	($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
		let t = $e;
		ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
	} };
}

pub fn readln() -> String {
	let mut line = String::new();
	::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
	line
}

macro_rules! read {
	($($t:tt),*; $n:expr) => {{
		let stdin = ::std::io::stdin();
		let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
			let line = line.unwrap();
			let mut it = line.split_whitespace();
			_read!(it; $($t),*)
		}).collect::<Vec<_>>();
		ret
	}};
	($($t:tt),*) => {{
		let line = readln();
		let mut it = line.split_whitespace();
		_read!(it; $($t),*)
	}};
}

macro_rules! _read {
	($it:ident; [char]) => {
		_read!($it; String).chars().collect::<Vec<_>>()
	};
	($it:ident; [u8]) => {
		Vec::from(_read!($it; String).into_bytes())
	};
	($it:ident; usize1) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
	};
	($it:ident; [usize1]) => {
		$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
	};
	($it:ident; [$t:ty]) => {
		$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
	};
	($it:ident; $t:ty) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
	};
	($it:ident; $($t:tt),+) => {
		($(_read!($it; $t)),*)
	};
}

pub fn main() {
	let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/2;

fn solve() {
	let (n,v,l) = read!(usize, usize, i64);
	let a = read!([i64];n);
	let mut x = vec![];
	x.push([0,0,0]);
	for i in 0..n {
		x.push([a[i][0],a[i][1],a[i][2]]);
	}
	x.push([l,0,0]);
	let mut dp = vec![vec![INF;v+1];n+2];
	dp[0][v] = 0;
	for i in 0..n+1 {
		let dist = x[i+1][0] - x[i][0];
		for j in 0..v+1 {
			if dist > j as i64{
				continue;
			}
			let res = j - dist as usize;
			dp[i+1][min(v, (res + x[i+1][1] as usize))] = min(dp[i+1][min(v, (res + x[i+1][1] as usize))], dp[i][j]+x[i+1][2]);
			dp[i+1][res] = min(dp[i+1][res], dp[i][j]);
		}
	}
	let mut ans = INF;
	for i in 0..v+1 {
		ans = min(ans, dp[n+1][i]);
	}
	if ans==INF {
		ans = -1;
	}
	println!("{}", ans);
}

fn run() {
    solve();
}