#541968 (Rust) No.1200 お菓子配り-3

• 問題: No.1200 お菓子配り-3
• ユーザー: koba-e964
• 提出日時: 2020-08-28 21:51:52
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 846 ms / 4,000 ms
• コード長: 3,448 bytes
• コンパイル時間: 25,017 ms
• コンパイル使用メモリ: 375,140 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-20 22:26:27
• 合計ジャッジ時間: 20,768 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	6 ms; 5,248 KB
testcase_08	AC	5 ms; 5,248 KB
testcase_09	AC	5 ms; 5,248 KB
testcase_10	AC	5 ms; 5,248 KB
testcase_11	AC	5 ms; 5,248 KB
testcase_12	AC	39 ms; 5,248 KB
testcase_13	AC	40 ms; 5,248 KB
testcase_14	AC	40 ms; 5,248 KB
testcase_15	AC	40 ms; 5,248 KB
testcase_16	AC	40 ms; 5,248 KB
testcase_17	AC	141 ms; 5,248 KB
testcase_18	AC	203 ms; 5,248 KB
testcase_19	AC	48 ms; 5,248 KB
testcase_20	AC	388 ms; 5,248 KB
testcase_21	AC	388 ms; 5,248 KB
testcase_22	AC	457 ms; 5,248 KB
testcase_23	AC	388 ms; 5,248 KB
testcase_24	AC	381 ms; 5,248 KB
testcase_25	AC	386 ms; 5,248 KB
testcase_26	AC	387 ms; 5,248 KB
testcase_27	AC	1 ms; 5,248 KB
testcase_28	AC	306 ms; 5,248 KB
testcase_29	AC	845 ms; 5,248 KB
testcase_30	AC	846 ms; 5,248 KB
testcase_31	AC	1 ms; 5,248 KB
testcase_32	AC	1 ms; 5,248 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn divs(x: i64) -> Vec<i64> {
    let mut i = 1;
    let mut ans = vec![];
    while i * i <= x {
        if x % i == 0 {
            ans.push(i);
            if i * i != x {
                ans.push(x / i);
            }
        }
        i += 1;
    }
    ans
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        xy: [(i64, i64)],
    }
    for (x, y) in xy {
        let dif = (x - y).abs();
        if dif == 0 {
            let mut ans = x - 1;
            let ds = divs(x);
            for d in ds {
                if d > 2 {
                    ans += 1;
                }
            }
            puts!("{}\n", ans);
            continue;
        }
        let divs = divs(dif);
        let mut ans = 0;
        for d in divs {
            let a = d + 1;
            let bc = (x - y) / d;
            let xbc = x + bc;
            if xbc % (a + 1) != 0 {
                continue;
            }
            let b = xbc / (a + 1);
            let c = b - bc;
            if b > 0 && c > 0 {
                ans += 1;
            }
        }
        puts!("{}\n", ans);
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}