#566893 (Rust) No.1201 お菓子配り-4

• 問題: No.1201 お菓子配り-4
• ユーザー: cotton_fn_
• 提出日時: 2020-10-15 21:52:09
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 1,574 ms / 4,000 ms
• コード長: 4,404 bytes
• コンパイル時間: 14,134 ms
• コンパイル使用メモリ: 379,488 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-20 19:58:33
• 合計ジャッジ時間: 24,705 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	27 ms; 5,248 KB
testcase_01	AC	349 ms; 5,248 KB
testcase_02	AC	506 ms; 5,376 KB
testcase_03	AC	246 ms; 5,376 KB
testcase_04	AC	119 ms; 5,376 KB
testcase_05	AC	297 ms; 5,376 KB
testcase_06	AC	46 ms; 5,376 KB
testcase_07	AC	135 ms; 5,376 KB
testcase_08	AC	375 ms; 5,376 KB
testcase_09	AC	277 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	72 ms; 5,376 KB
testcase_12	AC	575 ms; 5,376 KB
testcase_13	AC	17 ms; 5,376 KB
testcase_14	AC	9 ms; 5,376 KB
testcase_15	AC	451 ms; 5,376 KB
testcase_16	AC	138 ms; 5,376 KB
testcase_17	AC	177 ms; 5,376 KB
testcase_18	AC	30 ms; 5,376 KB
testcase_19	AC	28 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	726 ms; 5,376 KB
testcase_31	AC	726 ms; 5,376 KB
testcase_32	AC	727 ms; 5,376 KB
testcase_33	AC	730 ms; 5,376 KB
testcase_34	AC	728 ms; 5,376 KB
testcase_35	AC	1,574 ms; 5,376 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(|| {
            run(
                KInput::new(io::stdin().lock()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    const P: i64 = 1e9 as i64 + 7;
    let (n, m): (usize, usize) = kin.input();
    let a: Vec<i64> = kin.seq(n);
    let b: Vec<i64> = kin.seq(m);
    let mut ans = 0;
    for i in 0..n {
        for j in 0..m {
            let s = (a[i] - 1) * (b[j] + 1) + gcd(a[i], b[j]) + 1;
            ans = (ans + s) % P;
        }
    }
    outputln!("{}", ans);
}

fn gcd(a: i64, b: i64) -> i64 {
    if b == 0 { a } else { gcd(b, a % b) }
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1 << 12),
                pos: 0,
            }
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}