結果
問題 | No.915 Plus Or Multiple Operation |
ユーザー | alpha_virginis |
提出日時 | 2019-10-25 21:47:35 |
言語 | Rust (1.77.0 + proconio) |
結果 |
MLE
|
実行時間 | - |
コード長 | 6,097 bytes |
コンパイル時間 | 21,590 ms |
コンパイル使用メモリ | 390,536 KB |
実行使用メモリ | 813,108 KB |
最終ジャッジ日時 | 2024-11-07 03:25:23 |
合計ジャッジ時間 | 23,946 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
testcase_01 | -- | - |
testcase_02 | -- | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
コンパイルメッセージ
warning: unused `Result` that must be used --> src/main.rs:210:9 | 210 | writeln!(buf, "{}", res); | ^^^^^^^^^^^^^^^^^^^^^^^^ | = note: this `Result` may be an `Err` variant, which should be handled = note: `#[warn(unused_must_use)]` on by default = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
/*------------------------------------------------------------------*/ /*------------------------- begin template -------------------------*/ /*------------------------------------------------------------------*/ // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8> // diff: using Parser macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut parser = Parser::from_str($s); input_inner!{parser, $($r)*} }; (parser = $parser:ident, $($r:tt)*) => { input_inner!{$parser, $($r)*} }; (new_stdin_parser = $parser:ident, $($r:tt)*) => { let stdin = std::io::stdin(); let reader = std::io::BufReader::new(stdin.lock()); let mut $parser = Parser::new(reader); input_inner!{$parser, $($r)*} }; ($($r:tt)*) => { input!{new_stdin_parser = parser, $($r)*} }; } macro_rules! input_inner { ($parser:ident) => {}; ($parser:ident, ) => {}; ($parser:ident, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($parser, $t); input_inner!{$parser $($r)*} }; } macro_rules! read_value { ($parser:ident, ( $($t:tt),* )) => { ( $(read_value!($parser, $t)),* ) }; ($parser:ident, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>() }; ($parser:ident, chars) => { read_value!($parser, String).chars().collect::<Vec<char>>() }; ($parser:ident, char_) => { read_value!($parser, String).chars().collect::<Vec<char>>()[0] }; ($parser:ident, usize1) => { read_value!($parser, usize) - 1 }; ($parser:ident, i64_) => { $parser.fast_i64() }; ($parser:ident, usize_) => { $parser.fast_i64() as usize }; ($parser:ident, usize1_) => { ($parser.fast_i64() - 1) as usize }; ($parser:ident, $t:ty) => { $parser.next::<$t>().expect("Parse error") }; } use std::io; use std::io::BufRead; use std::str; // ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e> // ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9> // diff: using std::io::BufRead::fill_buf() pub struct Parser<R> { pub reader: R, buf: Vec<u8>, pos: usize, } impl Parser<io::Empty> { pub fn from_str(s: &str) -> Parser<io::Empty> { Parser { reader: io::empty(), buf: s.as_bytes().to_vec(), pos: 0, } } } impl<R: BufRead> Parser<R> { pub fn new(reader: R) -> Parser<R> { Parser { reader: reader, buf: vec![], pos: 0, } } pub fn update_buf(&mut self) { self.buf.clear(); self.pos = 0; loop { let (len, complete) = { let buf2 = self.reader.fill_buf().unwrap(); self.buf.extend_from_slice(buf2); let len = buf2.len(); (len, buf2[len - 1] <= 0x20) }; self.reader.consume(len); if complete { break; } } } pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> { loop { let mut begin = self.pos; while begin < self.buf.len() && (self.buf[begin] <= 0x20) { begin += 1; } let mut end = begin; while end < self.buf.len() && (self.buf[end] > 0x20) { end += 1; } if begin != self.buf.len() { self.pos = end; return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>(); } else { self.update_buf(); } } } pub fn fast_i64(&mut self) -> i64 { loop { let mut begin = self.pos; while begin < self.buf.len() && (self.buf[begin] <= 0x20) { begin += 1; } if begin == self.buf.len() { self.update_buf(); continue; } let mut res = 0; let (is_positive, mut end) = match self.buf[begin] { b'+' => (true, begin + 1), b'-' => (false, begin + 1), _ => (true, begin), }; while end < self.buf.len() && (self.buf[end] > 0x20) { res = res * 10 + (self.buf[end] as i64 - '0' as i64); end += 1; } if begin != self.buf.len() { self.pos = end; return if is_positive { res } else { -res }; } else { self.update_buf(); } } } } #[allow(unused_imports)] use std::cmp::*; fn main() { input! { new_stdin_parser = parser, } let res = solve(&mut parser); print!("{}", res); } /*------------------------------------------------------------------*/ /*-------------------------- end template --------------------------*/ /*------------------------------------------------------------------*/ use std::fmt::Write; fn solve<R: BufRead>(parser: &mut Parser<R>) -> String { let mut buf = String::new(); input! { parser = parser, n: usize, qs: [(i64, i64, i64); n], } for &(a, b, c) in &qs { let mut xs = vec![]; let mut x = a; while x != 0 { xs.push(x % c); x /= c; } xs.reverse(); let mut i = 0; let mut res = b * (xs.len() as i64 - 1); while i < xs.len() { if xs[i] == 0 { i += 1; continue; } if xs[i] == 1 && i + 1 < xs.len() && 0 < xs[i + 1] && xs[i + 1] <= c - 2 { if i == 0 { res += b; } else { res += 2 * b; } i += 2; } else { res += b; i += 1; } } writeln!(buf, "{}", res); } buf }