結果

問題 No.916 Encounter On A Tree
ユーザー alpha_virginisalpha_virginis
提出日時 2019-10-25 22:26:08
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 9,855 bytes
コンパイル時間 13,014 ms
コンパイル使用メモリ 402,232 KB
実行使用メモリ 10,144 KB
最終ジャッジ日時 2024-09-13 04:34:29
合計ジャッジ時間 16,423 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
10,092 KB
testcase_01 AC 26 ms
10,136 KB
testcase_02 AC 25 ms
10,048 KB
testcase_03 AC 26 ms
10,096 KB
testcase_04 AC 25 ms
10,040 KB
testcase_05 AC 25 ms
10,104 KB
testcase_06 AC 25 ms
10,056 KB
testcase_07 AC 26 ms
10,076 KB
testcase_08 AC 26 ms
10,052 KB
testcase_09 AC 25 ms
10,036 KB
testcase_10 AC 25 ms
10,056 KB
testcase_11 AC 25 ms
10,072 KB
testcase_12 AC 26 ms
10,036 KB
testcase_13 AC 25 ms
10,048 KB
testcase_14 AC 26 ms
10,092 KB
testcase_15 AC 25 ms
10,144 KB
testcase_16 AC 26 ms
10,128 KB
testcase_17 AC 25 ms
10,044 KB
testcase_18 AC 25 ms
10,048 KB
testcase_19 AC 26 ms
10,072 KB
testcase_20 AC 25 ms
10,032 KB
testcase_21 AC 25 ms
9,912 KB
testcase_22 AC 25 ms
10,048 KB
testcase_23 AC 25 ms
10,000 KB
testcase_24 AC 25 ms
10,036 KB
testcase_25 AC 25 ms
10,036 KB
testcase_26 AC 25 ms
10,128 KB
testcase_27 AC 25 ms
10,144 KB
testcase_28 AC 25 ms
10,032 KB
testcase_29 AC 25 ms
9,864 KB
testcase_30 AC 26 ms
10,112 KB
testcase_31 AC 25 ms
10,056 KB
testcase_32 AC 26 ms
10,108 KB
testcase_33 AC 26 ms
10,052 KB
testcase_34 AC 26 ms
10,076 KB
testcase_35 AC 25 ms
10,044 KB
testcase_36 AC 25 ms
10,004 KB
testcase_37 AC 25 ms
10,032 KB
testcase_38 AC 26 ms
10,100 KB
testcase_39 AC 25 ms
9,904 KB
testcase_40 AC 25 ms
10,012 KB
testcase_41 AC 26 ms
9,904 KB
testcase_42 AC 25 ms
10,104 KB
testcase_43 AC 25 ms
10,044 KB
testcase_44 AC 25 ms
10,112 KB
testcase_45 AC 26 ms
10,044 KB
testcase_46 AC 25 ms
9,976 KB
testcase_47 AC 25 ms
10,076 KB
testcase_48 AC 25 ms
10,012 KB
testcase_49 AC 25 ms
9,976 KB
testcase_50 AC 26 ms
9,984 KB
testcase_51 AC 25 ms
10,012 KB
testcase_52 AC 25 ms
9,924 KB
testcase_53 AC 25 ms
10,096 KB
testcase_54 AC 25 ms
10,040 KB
testcase_55 AC 25 ms
10,104 KB
testcase_56 AC 25 ms
10,048 KB
testcase_57 AC 26 ms
10,008 KB
testcase_58 AC 25 ms
10,044 KB
testcase_59 AC 25 ms
10,056 KB
testcase_60 AC 26 ms
10,092 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around function argument
   --> src/main.rs:352:32
    |
352 |                     / Mod::new((1 << (r_d - 1)))
    |                                ^              ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
352 -                     / Mod::new((1 << (r_d - 1)))
352 +                     / Mod::new(1 << (r_d - 1))
    |

warning: unused `Result` that must be used
   --> src/main.rs:354:13
    |
354 |             writeln!(buf, "{}", res.as_u32());
    |             ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: `#[warn(unused_must_use)]` on by default
    = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)

warning: unused `Result` that must be used
   --> src/main.rs:360:9
    |
360 |         writeln!(buf, "{}", res.as_u32());
    |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)

warning: unused `Result` that must be used
   --> src/main.rs:363:5
    |
363 |     writeln!(buf, "0");
    |     ^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)

ソースコード

diff # 

/*------------------------------------------------------------------*/
/*------------------------- begin template -------------------------*/
/*------------------------------------------------------------------*/

// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

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

macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, char_) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()[0]
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, i64_) => {
        $parser.fast_i64()
    };
    ($parser:ident, usize_) => {
        $parser.fast_i64() as usize
    };
    ($parser:ident, usize1_) => {
        ($parser.fast_i64() - 1) as usize
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

use std::io;
use std::io::BufRead;
use std::str;

// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser<R> {
    pub reader: R,
    buf: Vec<u8>,
    pos: usize,
}

impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}

impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
    pub fn fast_i64(&mut self) -> i64 {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            if begin == self.buf.len() {
                self.update_buf();
                continue;
            }
            let mut res = 0;
            let (is_positive, mut end) = match self.buf[begin] {
                b'+' => (true, begin + 1),
                b'-' => (false, begin + 1),
                _ => (true, begin),
            };
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                res = res * 10 + (self.buf[end] as i64 - '0' as i64);
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return if is_positive { res } else { -res };
            } else {
                self.update_buf();
            }
        }
    }
}

#[allow(unused_imports)]
use std::cmp::*;
use std::marker::PhantomData;
use std::ops::*;

pub trait ModP {
    fn as_u64() -> u64;
}

#[allow(non_camel_case_types)]
#[derive(Clone, Copy, Debug)]
pub struct Mod_1_000_000_007();
impl ModP for Mod_1_000_000_007 {
    fn as_u64() -> u64 {
        1_000_000_007
    }
}

#[allow(non_camel_case_types)]
#[derive(Clone, Copy, Debug)]
pub struct Mod_998_244_353();
impl ModP for Mod_998_244_353 {
    fn as_u64() -> u64 {
        998_244_353
    }
}

#[derive(Clone, Copy, PartialEq, Debug)]
pub struct Modular<P: ModP + Copy>(u32, PhantomData<P>);

impl<P: ModP + Copy> Modular<P> {
    pub fn new(x: u32) -> Modular<P> {
        Modular((x as u64 % P::as_u64()) as u32, PhantomData)
    }
    pub fn pow(self, n: u64) -> Modular<P> {
        if n == 0 {
            return Modular(1, PhantomData);
        }
        let t = self.pow(n / 2);
        if n % 2 == 0 {
            t * t
        } else {
            t * t * self
        }
    }
    pub fn as_u32(self) -> u32 {
        self.0
    }
}

impl<P: ModP + Copy> Add for Modular<P> {
    type Output = Self;
    fn add(self, rhs: Self) -> Self::Output {
        let t = (self.0 + rhs.0) as u64;
        let u = if t < P::as_u64() { t } else { t - P::as_u64() };
        Modular(u as u32, PhantomData)
    }
}

impl<P: ModP + Copy> AddAssign for Modular<P> {
    fn add_assign(&mut self, rhs: Self) {
        *self = *self + rhs;
    }
}

impl<P: ModP + Copy> Sub for Modular<P> {
    type Output = Self;
    fn sub(self, rhs: Self) -> Self::Output {
        let t = if self.0 >= rhs.0 {
            self.0 as u64 - rhs.0 as u64
        } else {
            self.0 as u64 + P::as_u64() - rhs.0 as u64
        };
        assert!(t < P::as_u64());
        Modular(t as u32, PhantomData)
    }
}

impl<P: ModP + Copy> SubAssign for Modular<P> {
    fn sub_assign(&mut self, rhs: Self) {
        *self = *self - rhs;
    }
}

impl<P: ModP + Copy> Neg for Modular<P> {
    type Output = Modular<P>;
    fn neg(self) -> Modular<P> {
        Modular((P::as_u64() - self.0 as u64) as u32, PhantomData)
    }
}

impl<P: ModP + Copy> Mul for Modular<P> {
    type Output = Self;
    fn mul(self, rhs: Self) -> Self::Output {
        Modular(
            ((self.0 as u64 % P::as_u64()) * (rhs.0 as u64 % P::as_u64()) % P::as_u64()) as u32,
            PhantomData,
        )
    }
}

impl<P: ModP + Copy> MulAssign for Modular<P> {
    fn mul_assign(&mut self, rhs: Self) {
        *self = *self * rhs;
    }
}

impl<P: ModP + Copy> Div for Modular<P> {
    type Output = Self;
    fn div(self, rhs: Self) -> Self::Output {
        if rhs.0 == 0 {
            loop {}
        }
        assert!(rhs.0 != 0);
        self * rhs.pow(P::as_u64() - 2)
    }
}

impl<P: ModP + Copy> DivAssign for Modular<P> {
    fn div_assign(&mut self, rhs: Self) {
        *self = *self / rhs;
    }
}

pub fn gen_fact_table<P: ModP + Copy>(n: usize) -> Vec<Modular<P>> {
    let mut res = vec![Modular::<P>::new(1); n + 1];
    for i in 0..n {
        res[i + 1] = res[i] * Modular::<P>::new((i + 1) as u32);
    }
    res
}

pub fn gen_inv_table<P: ModP + Copy>(n: usize) -> Vec<Modular<P>> {
    let mut res = vec![Modular::<P>::new(0); n + 1];
    res[1] = Modular::<P>::new(1);
    for i in 2..n + 1 {
        res[i] =
            -res[P::as_u64() as usize % i] * Modular::<P>::new((P::as_u64() / i as u64) as u32);
    }
    res
}

fn main() {
    input! {
        new_stdin_parser = parser,
    }
    let res = solve(&mut parser);
    print!("{}", res);
}

/*------------------------------------------------------------------*/
/*-------------------------- end template --------------------------*/
/*------------------------------------------------------------------*/

type Mod = Modular<Mod_1_000_000_007>;

fn get_d(x: usize) -> usize {
    let mut res = 0;
    let mut x = x;
    while x != 0 {
        res += 1;
        x /= 2;
    }
    res
}

use std::fmt::Write;
fn solve<R: BufRead>(parser: &mut Parser<R>) -> String {
    let mut buf = String::new();
    input! {
        parser = parser,
        d: usize,
        l: usize,
        r: usize,
        k: usize,
    }
    let facts = gen_fact_table::<Mod_1_000_000_007>(1 << 21);
    let mut base = Mod::new(1);
    for i in 0..d {
        base *= facts[1 << i];
    }
    let l_d = get_d(l);
    let r_d = get_d(r);
    for lca_d in 1..l_d {
        if k == (l_d - lca_d) + (r_d - lca_d) {
            let res = if l_d == r_d {
                base * Mod::new((1 << (l_d - lca_d - 1)) as u32)
                    * Mod::new((1 << (r_d - l_d)) as u32)
                    / Mod::new((1 << (r_d - 1)) - 1)
            } else {
                base * Mod::new((1 << (l_d - lca_d - 1)) as u32)
                    * Mod::new((1 << (r_d - l_d)) as u32)
                    / Mod::new((1 << (r_d - 1)))
            };
            writeln!(buf, "{}", res.as_u32());
            return buf;
        }
    }
    if k == r_d - l_d {
        let res = base / Mod::new(1 << (l_d - 1));
        writeln!(buf, "{}", res.as_u32());
        return buf;
    }
    writeln!(buf, "0");
    buf
}
0