#492930 (Rust) No.1073 無限すごろく

• 問題: No.1073 無限すごろく
• ユーザー: ziita
• 提出日時: 2020-06-05 22:27:19
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 4 ms / 2,000 ms
• コード長: 5,190 bytes
• コンパイル時間: 14,495 ms
• コンパイル使用メモリ: 387,280 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-12-17 16:10:37
• 合計ジャッジ時間: 14,649 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,820 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	2 ms; 6,820 KB
testcase_03	AC	1 ms; 6,820 KB
testcase_04	AC	1 ms; 6,816 KB
testcase_05	AC	1 ms; 6,816 KB
testcase_06	AC	1 ms; 6,816 KB
testcase_07	AC	1 ms; 6,820 KB
testcase_08	AC	1 ms; 6,816 KB
testcase_09	AC	1 ms; 6,816 KB
testcase_10	AC	1 ms; 6,820 KB
testcase_11	AC	1 ms; 6,816 KB
testcase_12	AC	1 ms; 6,816 KB
testcase_13	AC	2 ms; 6,816 KB
testcase_14	AC	2 ms; 6,816 KB
testcase_15	AC	2 ms; 6,820 KB
testcase_16	AC	2 ms; 6,820 KB
testcase_17	AC	1 ms; 6,816 KB
testcase_18	AC	2 ms; 6,820 KB
testcase_19	AC	2 ms; 6,820 KB
testcase_20	AC	2 ms; 6,816 KB
testcase_21	AC	2 ms; 6,820 KB
testcase_22	AC	2 ms; 6,816 KB
testcase_23	AC	3 ms; 6,820 KB
testcase_24	AC	3 ms; 6,816 KB
testcase_25	AC	3 ms; 6,820 KB
testcase_26	AC	3 ms; 6,816 KB
testcase_27	AC	3 ms; 6,816 KB
testcase_28	AC	4 ms; 6,816 KB
testcase_29	AC	4 ms; 6,816 KB
testcase_30	AC	4 ms; 6,820 KB
testcase_31	AC	4 ms; 6,816 KB
testcase_32	AC	4 ms; 6,816 KB

ソースコード

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = write!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! eprintln {
	() => { eprintln!(""); };
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = writeln!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! dbg {
	($v:expr) => {{
		let val = $v;
		eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
		val
	}}
}

macro_rules! mat {
	($($e:expr),*) => { Vec::from(vec![$($e),*]) };
	($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
	($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
	($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
	($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
		$a$([$i])*.$f($($t),*)
	};
	($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
		let t = $e;
		ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
	} };
}

pub fn readln() -> String {
	let mut line = String::new();
	::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
	line
}

macro_rules! read {
	($($t:tt),*; $n:expr) => {{
		let stdin = ::std::io::stdin();
		let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
			let line = line.unwrap();
			let mut it = line.split_whitespace();
			_read!(it; $($t),*)
		}).collect::<Vec<_>>();
		ret
	}};
	($($t:tt),*) => {{
		let line = readln();
		let mut it = line.split_whitespace();
		_read!(it; $($t),*)
	}};
}

macro_rules! _read {
	($it:ident; [char]) => {
		_read!($it; String).chars().collect::<Vec<_>>()
	};
	($it:ident; [u8]) => {
		Vec::from(_read!($it; String).into_bytes())
	};
	($it:ident; usize1) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
	};
	($it:ident; [usize1]) => {
		$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
	};
	($it:ident; [$t:ty]) => {
		$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
	};
	($it:ident; $t:ty) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
	};
	($it:ident; $($t:tt),+) => {
		($(_read!($it; $t)),*)
	};
}


pub fn main() {
	let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: u32 = 1_000_000_007;
const INF: i64 = std::i64::MAX/3;

#[derive(Clone, Copy)]
struct ModInt(u32);
 
impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}
 
impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}
 
impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as u32)
    }
}
 
impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}
 
impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}
 
/* 
impl std::fmt::Display for ModInt {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}
*/
 
#[allow(dead_code)]
impl ModInt {
    pub fn new(n: u32) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: u32) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        self.pow(MOD - 2)
    }
}

fn solve() {
	let n = read!(i64);
	let mut map: HashMap<i64,ModInt> = HashMap::new();
	map.insert(0,ModInt(1));
	let ans = dfs(n,&mut map);
	println!("{}",ans.0);
}

fn dfs(val: i64, mut map: &mut HashMap<i64,ModInt>) -> ModInt {
	if map.contains_key(&val) {
		return *map.get(&val).unwrap();
	}
	let half = val/2;
	let base = max(0,half-5);
	let mut sum = ModInt(0);
	for i in 0..6 {
		let s = base + i;
		let ma = min(val-1,base+5);
		for j in 1..7 {
			let s2 = s + j;
			if s2 <= ma {
				continue;
			}
			let t = val - s2;
			if t<0 {
				continue;
			}
			sum += dfs(s,&mut map)*dfs(t,&mut map)*ModInt(6).inv();
		}
	}
	map.insert(val,sum);
	sum
}

fn run() {
    solve();
}