Submission #5977778


Source Code Expand

//! ----------------------------------------------
//! Framework <https://github.com/vain0x/procon>
//!
//! See the bottom of file for solution.
//! ----------------------------------------------

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

use std::cell::RefCell;
use std::cmp::{max, min, Ordering};
use std::collections::*;
use std::fmt::{Debug, Display, Formatter, Write as FmtWrite};
use std::io::{stderr, stdin, BufRead, Write};
use std::mem::{replace, swap};
use std::ops::*;
use std::rc::Rc;

/// Print values to standard error if debug mode.
#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), stderr());
            writeln!(err, "\x1B[33m{}\x1B[0m = {:?}", e, $e).unwrap()
        })*
    };
}

/// Read from standard input and parse each word.
/// - `read!(T, U, ..)` parses a line as a tuple of words.
/// - `read![[T]]` parses a line as an array of words.
/// - `read![..; N]` parses `N` lines, using `read!(..)` repeatedly.
#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

/// Read a line from standard input.
#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    stdin().read_line(&mut buf).unwrap();

    #[allow(deprecated)]
    buf.trim_right().to_owned()
}

// -----------------------------------------------
// Solution
// -----------------------------------------------

const P: i64 = 1_000_000_007;

fn main() {
    // let N = 2_000_i64;
    // let M = 2_000_i64;
    // let mut S = (0..N)
    //     .map(|i| (1 + i * i % 99_993 * i % 99_993).to_string())
    //     .collect::<Vec<_>>()
    //     .join(" ");
    // let mut T = (0..M)
    //     .map(|i| (1 + i * i % 99_993 * i % 99_997).to_string())
    //     .collect::<Vec<_>>()
    //     .join(" ");

    // println!("{} {}", N, M);
    // println!("{}", S);
    // println!("{}", T);

    let (sn, tn) = read!(usize, usize);
    let S = read![[i64]];
    let T = read![[i64]];

    let mut inc = vec![0; sn + 1];

    // dp[si] = n : S[..si] の部分列と T[..ti] の部分列の組み合わせの総数
    let mut dp = vec![1; sn + 1];

    for ti in 0..tn {
        for z in 0..sn {
            if S[z] == T[ti] {
                inc[z] += dp[z];
                inc[z] %= P;
            }
        }

        for si in 0..sn {
            dp[si + 1] = dp[si] + inc[si] % P;
            dp[si + 1] %= P;
        }

        // debug!(ti, inc, dp);
    }

    println!("{}", dp[sn])
}

/*

4 3
1 2 3 1
2 1 3

#=> 10

*/

Submission Info

Submission Time
Task E - Common Subsequence
User vain0
Language Rust (1.15.1)
Score 500
Code Size 3100 Byte
Status AC
Exec Time 36 ms
Memory 4352 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 5
AC × 33
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
Case Name Status Exec Time Memory
01.txt AC 2 ms 4352 KiB
02.txt AC 2 ms 4352 KiB
03.txt AC 2 ms 4352 KiB
04.txt AC 2 ms 4352 KiB
05.txt AC 2 ms 4352 KiB
06.txt AC 29 ms 4352 KiB
07.txt AC 30 ms 4352 KiB
08.txt AC 29 ms 4352 KiB
09.txt AC 29 ms 4352 KiB
10.txt AC 28 ms 4352 KiB
11.txt AC 30 ms 4352 KiB
12.txt AC 29 ms 4352 KiB
13.txt AC 30 ms 4352 KiB
14.txt AC 30 ms 4352 KiB
15.txt AC 29 ms 4352 KiB
16.txt AC 33 ms 4352 KiB
17.txt AC 34 ms 4352 KiB
18.txt AC 31 ms 4352 KiB
19.txt AC 30 ms 4352 KiB
20.txt AC 30 ms 4352 KiB
21.txt AC 36 ms 4352 KiB
22.txt AC 35 ms 4352 KiB
23.txt AC 3 ms 4352 KiB
24.txt AC 27 ms 4352 KiB
25.txt AC 3 ms 4352 KiB
26.txt AC 3 ms 4352 KiB
27.txt AC 31 ms 4352 KiB
28.txt AC 31 ms 4352 KiB
s1.txt AC 2 ms 4352 KiB
s2.txt AC 2 ms 4352 KiB
s3.txt AC 2 ms 4352 KiB
s4.txt AC 2 ms 4352 KiB
s5.txt AC 2 ms 4352 KiB