Submission #10004596


Source Code Expand

Copy
//! ----------------------------------------------
//! 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 {
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
//! ----------------------------------------------
//! 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
// -----------------------------------------------

fn main() {
    let N = rl().chars().collect::<Vec<char>>();
    let K = read!(usize);

    let h = N.len();

    let mut dp = vec![vec![vec![0; 2]; K + 2]; h + 1];
    dp[0][0][1] = 1;

    for i in 0..h {
        for k in 0..K + 1 {
            let d = (N[i] as u8 - b'0') as usize;

            // 1 以上を立てる
            dp[i + 1][k + 1][0] += 9 * dp[i][k][0];

            // 0 を立てる
            dp[i + 1][k][0] += dp[i][k][0];

            if d == 0 {
                // d=0 を立てる
                dp[i + 1][k][1] += dp[i][k][1];
            } else {
                // d を立てる
                dp[i + 1][k + 1][1] += dp[i][k][1];

                // 1 以上 d 未満を立てる
                dp[i + 1][k + 1][0] += (d - 1) * dp[i][k][1];

                // 0 を立てる
                dp[i + 1][k][0] += dp[i][k][1];
            }
        }
    }

    println!("{}", dp[h][K][1] + dp[h][K][0])
}

Submission Info

Submission Time
Task E - Almost Everywhere Zero
User vain0
Language Rust (1.15.1)
Score 500
Code Size 2907 Byte
Status AC
Exec Time 2 ms
Memory 4352 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 4
AC × 22
Set Name Test Cases
Sample sample_01, sample_02, sample_03, sample_04
All hand_01, hand_02, hand_03, hand_04, hand_05, max_01, max_02, max_03, max_04, max_05, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, sample_01, sample_02, sample_03, sample_04
Case Name Status Exec Time Memory
hand_01 AC 2 ms 4352 KB
hand_02 AC 2 ms 4352 KB
hand_03 AC 2 ms 4352 KB
hand_04 AC 2 ms 4352 KB
hand_05 AC 2 ms 4352 KB
max_01 AC 2 ms 4352 KB
max_02 AC 2 ms 4352 KB
max_03 AC 2 ms 4352 KB
max_04 AC 2 ms 4352 KB
max_05 AC 2 ms 4352 KB
random_01 AC 2 ms 4352 KB
random_02 AC 2 ms 4352 KB
random_03 AC 2 ms 4352 KB
random_04 AC 2 ms 4352 KB
random_05 AC 2 ms 4352 KB
random_06 AC 2 ms 4352 KB
random_07 AC 2 ms 4352 KB
random_08 AC 2 ms 4352 KB
sample_01 AC 2 ms 4352 KB
sample_02 AC 2 ms 4352 KB
sample_03 AC 2 ms 4352 KB
sample_04 AC 2 ms 4352 KB


2025-04-09 (Wed)
04:35:15 +00:00