#522818 (Rust) No.1143 面積Nの三角形

• 問題: No.1143 面積Nの三角形
• ユーザー: cotton_fn_
• 提出日時: 2020-08-01 01:27:02
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 45 ms / 800 ms
• コード長: 4,775 bytes
• コンパイル時間: 27,863 ms
• コンパイル使用メモリ: 400,744 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-07 00:02:29
• 合計ジャッジ時間: 17,850 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	4 ms; 5,376 KB
testcase_08	AC	9 ms; 5,376 KB
testcase_09	AC	12 ms; 5,376 KB
testcase_10	AC	10 ms; 5,376 KB
testcase_11	AC	18 ms; 5,376 KB
testcase_12	AC	21 ms; 5,376 KB
testcase_13	AC	24 ms; 5,376 KB
testcase_14	AC	12 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	40 ms; 5,376 KB
testcase_17	AC	45 ms; 5,376 KB
testcase_18	AC	40 ms; 5,376 KB
testcase_19	AC	38 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(|| {
            let stdin = io::stdin();
            let stdout = io::stdout();
            run(KInput::new(stdin.lock()), io::BufWriter::new(stdout.lock()))
        })?
        .join()
        .unwrap()
}

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

    let n: i64 = kin.input();
    
    let mut ds = Vec::new();
    for i in 1.. {
        if i > n {
            break;
        }
        if n * n % i == 0 {
            ds.push(i);
        }
    }
    ds.sort();

    let set: HashSet<_> = ds.iter().copied().collect();
    let mut ans = 0;
    for i in 0..ds.len() {
        for j in 0..=i {
            if ds[i] * ds[i] * ds[j] > n * n {
                break;
            }
            for k in 0..=j {
                if ds[i] * ds[i] * ds[j] * ds[k] > n * n {
                    break;
                }
                let s = ds[i] + ds[j] + ds[k];
                if s * ds[i] * ds[j] * ds[k] == n * n && set.contains(&s) {
                    ans += 1;
                }
            }
        }
    }

    outputln!("{}", ans);

    Ok(())
}

// -----------------------------------------------------------------------------
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(1024),
                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),*) }
        }
    }
}