結果
問題 | No.2104 Multiply-Add |
ユーザー |
![]() |
提出日時 | 2022-10-21 21:59:36 |
言語 | Rust (1.83.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,066 bytes |
コンパイル時間 | 12,154 ms |
コンパイル使用メモリ | 397,428 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-01 06:34:01 |
合計ジャッジ時間 | 14,689 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 WA * 6 |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> src/main.rs:1:5 | 1 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: variable does not need to be mutable --> src/main.rs:37:10 | 37 | fn solve(mut a: i64, mut b: i64) -> Vec<(usize, i64)> { | ----^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:37:22 | 37 | fn solve(mut a: i64, mut b: i64) -> Vec<(usize, i64)> { | ----^ | | | help: remove this `mut` warning: type alias `Map` is never used --> src/main.rs:4:6 | 4 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Set` is never used --> src/main.rs:5:6 | 5 | type Set<T> = BTreeSet<T>; | ^^^ warning: type alias `Deque` is never used --> src/main.rs:6:6 | 6 | type Deque<T> = VecDeque<T>; | ^^^^^
ソースコード
use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { a: i64, b: i64, c: i64, d: i64, } let g = gcd(a, b); if gcd(a, b) != gcd(c, d) { println!("-1"); return; } if g == 0 { println!("0"); return; } let x = solve(a / g, b / g); let y = solve(c / g, d / g); let mut p = [a, b]; let ans = x.iter().cloned().chain(y.iter().rev().map(|p| (p.0, -p.1))).collect::<Vec<_>>(); for &(t, k) in ans.iter() { p[t] += k * p[t ^ 1]; } println!("{}", ans.len()); for a in ans { println!("{} {}", a.0 + 1, a.1); } } fn solve(mut a: i64, mut b: i64) -> Vec<(usize, i64)> { let mut res = vec![]; let mut op = |p: &mut [i64; 2], t: usize, k: i64| { res.push((t, k)); p[t] += k * p[t ^ 1]; }; let mut p = [a, b]; while p.iter().any(|p| *p < 0) { op(&mut p, 0, -1); op(&mut p, 1, 1); op(&mut p, 0, -1); } while p[0] > 1 || p[1] > 1 { if p[0] >= p[1] { let mut q = p[0] / p[1]; if p[1] == 1 { q -= 1; } op(&mut p, 0, -q); } else { let mut q = p[1] / p[0]; if p[0] == 1 { q -= 1; } op(&mut p, 1, -q); } } res } fn gcd(a: i64, b: i64) -> i64 { if b == 0 { a.abs() } else { gcd(b, a % b.abs()) } } fn main() { run(); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ----------