結果

問題 No.3014 岩井満足性問題
ユーザー Moss_Local
提出日時 2025-01-25 13:51:57
言語 Rust
(1.83.0 + proconio)
結果
TLE  
実行時間 -
コード長 3,791 bytes
コンパイル時間 12,271 ms
コンパイル使用メモリ 400,808 KB
実行使用メモリ 813,184 KB
最終ジャッジ日時 2025-01-25 23:01:38
合計ジャッジ時間 29,602 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge10
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13 TLE * 2 MLE * 3
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around function argument
   --> src/main.rs:155:70
    |
155 |     let mut dp = vec![vec![vec![-1 * INF; n + 1]; (d + 1 as usize)]; (k + 1 as usize)];
    |                                                                      ^              ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
155 -     let mut dp = vec![vec![vec![-1 * INF; n + 1]; (d + 1 as usize)]; (k + 1 as usize)];
155 +     let mut dp = vec![vec![vec![-1 * INF; n + 1]; (d + 1 as usize)]; k + 1 as usize];
    |

warning: unnecessary parentheses around function argument
   --> src/main.rs:155:51
    |
155 |     let mut dp = vec![vec![vec![-1 * INF; n + 1]; (d + 1 as usize)]; (k + 1 as usize)];
    |                                                   ^              ^
    |
help: remove these parentheses
    |
155 -     let mut dp = vec![vec![vec![-1 * INF; n + 1]; (d + 1 as usize)]; (k + 1 as usize)];
155 +     let mut dp = vec![vec![vec![-1 * INF; n + 1]; d + 1 as usize]; (k + 1 as usize)];
    |

warning: variable does not need to be mutable
   --> src/main.rs:111:9
    |
111 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:117:9
    |
117 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:122:9
    |
122 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:128:9
    |
128 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:133:9
    |
133 |     l

ソースコード

diff #
プレゼンテーションモードにする

#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
use cmp::Ordering::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;
macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}
macro_rules! vp {
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}
macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}
macro_rules! map{
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}
macro_rules! set{
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}
#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}
#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}
#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}
fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}
fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}
#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}
fn main() {
    let (n, d, k) = readuuu();
    let mut dp = vec![vec![vec![-1 * INF; n + 1]; (d + 1 as usize)]; (k + 1 as usize)];
    dp[0][0][0] = 0;
    let mut a: Vec<i64> = read_vec();
    let mut c: Vec<usize> = read_vec();
    for i in 0..n {
        for j in 0..=d {
            for kk in 0..=k {
                dp[kk][j][i + 1] = max(dp[kk][j][i + 1], dp[kk][j][i]);
            }
        }
        for j in 0..d {
            for kk in 0..=k {
                let nk = min(kk + c[i], k);
                dp[nk][j + 1][i + 1] = max(dp[nk][j + 1][i + 1], dp[kk][j][i] + a[i]);
            }
        }
    }
    if dp[k][d][n] < 0 {
        p!("No");
    } else {
        p!(dp[k][d][n]);
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0