結果
問題 | No.2693 Sword |
ユーザー |
![]() |
提出日時 | 2024-03-22 21:48:44 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,355 bytes |
コンパイル時間 | 13,118 ms |
コンパイル使用メモリ | 377,052 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-09-30 11:17:29 |
合計ジャッジ時間 | 13,180 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 29 |
ソースコード
#![allow(non_snake_case, unused_imports, unused_must_use)]use std::io::{self, prelude::*};use std::str;const INF: isize = 1_000_000_000_000_000_001;fn main() {let (stdin, stdout) = (io::stdin(), io::stdout());let mut scan = Scanner::new(stdin.lock());let mut out = io::BufWriter::new(stdout.lock());macro_rules! input {($T: ty) => {scan.token::<$T>()};($T: ty, $N: expr) => {(0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>()};}let N = input!(usize);let P = input!(isize);let K = input!(usize);let mut dp = vec![isize::MIN; K + 1];dp[0] = P;for _ in 0..N {let T = input!(usize);let B = input!(isize);for i in (0..K).rev() {if dp[i] == isize::MIN {continue;}if T == 1 {let d = dp[i] + B;if d >= INF {dp[i + 1] = std::cmp::max(dp[i + 1], INF);} else {dp[i + 1] = std::cmp::max(dp[i + 1], d);}} else {let d = dp[i] * 2;if d >= INF {dp[i + 1] = std::cmp::max(dp[i + 1], INF);} else {dp[i + 1] = std::cmp::max(dp[i + 1], d);}}}}if dp[K] >= INF {writeln!(out, "-1");} else {writeln!(out, "{}", dp[K]);}}struct Scanner<R> {reader: R,buf_str: Vec<u8>,buf_iter: str::SplitWhitespace<'static>,}impl<R: BufRead> Scanner<R> {fn new(reader: R) -> Self {Self {reader,buf_str: vec![],buf_iter: "".split_whitespace(),}}fn token<T: str::FromStr>(&mut self) -> T {loop {if let Some(token) = self.buf_iter.next() {return token.parse().ok().expect("Failed parse");}self.buf_str.clear();self.reader.read_until(b'\n', &mut self.buf_str).expect("Failed read");self.buf_iter = unsafe {let slice = str::from_utf8_unchecked(&self.buf_str);std::mem::transmute(slice.split_whitespace())}}}}