結果

問題 No.1043 直列大学
ユーザー kakikaki
提出日時 2020-05-02 12:18:57
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 56 ms / 2,000 ms
コード長 5,238 bytes
コンパイル時間 14,478 ms
コンパイル使用メモリ 379,244 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-02 03:13:01
合計ジャッジ時間 15,700 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
5,248 KB
testcase_01 AC 4 ms
5,248 KB
testcase_02 AC 6 ms
5,248 KB
testcase_03 AC 4 ms
5,376 KB
testcase_04 AC 4 ms
5,376 KB
testcase_05 AC 4 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 AC 5 ms
5,376 KB
testcase_08 AC 5 ms
5,376 KB
testcase_09 AC 30 ms
5,376 KB
testcase_10 AC 35 ms
5,376 KB
testcase_11 AC 52 ms
5,376 KB
testcase_12 AC 56 ms
5,376 KB
testcase_13 AC 47 ms
5,376 KB
testcase_14 AC 50 ms
5,376 KB
testcase_15 AC 54 ms
5,376 KB
testcase_16 AC 49 ms
5,376 KB
testcase_17 AC 36 ms
5,376 KB
testcase_18 AC 36 ms
5,376 KB
testcase_19 AC 46 ms
5,376 KB
testcase_20 AC 36 ms
5,376 KB
testcase_21 AC 43 ms
5,376 KB
testcase_22 AC 45 ms
5,376 KB
testcase_23 AC 55 ms
5,376 KB
testcase_24 AC 40 ms
5,376 KB
testcase_25 AC 46 ms
5,376 KB
testcase_26 AC 49 ms
5,376 KB
testcase_27 AC 26 ms
5,376 KB
testcase_28 AC 47 ms
5,376 KB
testcase_29 AC 17 ms
5,376 KB
testcase_30 AC 35 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

use std::ops::*;
use std::fmt;

#[derive(Copy, Clone, PartialEq, Debug)]
struct ModInt(usize);

const MOD: usize = 1000000007;
impl ModInt {
    fn pow(self, power: usize) -> Self {
        if power == 0 {
            return ModInt(1);
        }
        if power % 2 == 0 {
            let t = self.pow(power/2);
            return t * t;
        }
        self * self.pow(power-1)
    }

    fn inv(self) -> Self {
        self.pow(MOD - 2)
    }
}

impl Add for ModInt {
    type Output = Self;

    fn add(self, rhs: Self) -> Self {
        let mut tmp = self;
        tmp.0 += rhs.0;
        if tmp.0 >= MOD {
            tmp.0 -= MOD;
        }
        tmp
    }
}

impl AddAssign for ModInt {
    fn add_assign(&mut self, rhs: Self) {
        *self = *self + rhs;
    }
}

impl Sub for ModInt {
    type Output = Self;

    fn sub(self, rhs: Self) -> Self {
        let mut ret = self;
        if ret.0 < rhs.0 {
            ret.0 += MOD;
        }
        ret.0 -= rhs.0;
        ret
    }
}

impl SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: Self) {
        *self = *self - rhs;
    }
}

impl Mul for ModInt {
    type Output = Self;

    fn mul(self, rhs: ModInt) -> Self {
        let mut ret = self;
        ret.0 *= rhs.0;
        ret.0 %= MOD;
        ret
    }
}

impl MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: Self) {
        *self = *self * rhs;
    }
}

impl Div for ModInt {
    type Output = ModInt;

    fn div(self, rhs: ModInt) -> Self {
        let mut ret = self;
        ret.0 *= rhs.inv().0;
        ret.0 %= MOD;
        ret
    }
}

impl DivAssign for ModInt {
    fn div_assign(&mut self, rhs: Self) {
        *self = *self / rhs;
    }
}

impl fmt::Display for ModInt {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "{}", self.0)
    }
}

const MAX: usize = 100 * 1000;

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let M: usize = sc.get();
    let V: Vec<usize> = sc.vec(N);
    let R: Vec<usize> = sc.vec(M);
    let A: usize = sc.get();
    let B: usize = sc.get();
    let mut dp_v = vec![ModInt(0); MAX+1];
    dp_v[0] = ModInt(1);
    for i in 0..N {
        for v in (0..MAX+1).rev() {
            if v >= V[i] {
                let prev = dp_v[v - V[i]];
                dp_v[v] += prev;
            }
        }
    }
    let mut cum = vec![ModInt(0); MAX+2];
    for i in 0..MAX+1 {
        cum[i+1] = cum[i] + dp_v[i];
    }
    let mut dp_r = vec![ModInt(0); MAX+1];
    dp_r[0] = ModInt(1);
    for i in 0..M {
        for r in (0..MAX+1).rev() {
            if r >= R[i] {
                let prev = dp_r[r - R[i]];
                dp_r[r] += prev;
            }
        }
    }
    let mut ans = ModInt(0);
    for r in 1..MAX+1 {
        let left = r * A;
        if left >= MAX {
            continue;
        }
        let right = min(MAX, r * B + 1);
        ans += dp_r[r] * (cum[right] - cum[left]);
    }
    println!("{}", ans);
}
0