Submission #42062332
Source Code Expand
use proconio::input; fn main() { input! { n: usize, c: [[usize; n + 1]; n + 1], } let inf = 1_usize << 60; let mut dp = vec![inf; n + 1]; dp[0] = 0_usize; for i in 0..n { for j in 0..=i { dp[i + 1] = dp[i + 1].min(dp[j] + c[j][i + 1]); } } let ans = dp[n]; println!("{}", ans); }
Submission Info
Submission Time | |
---|---|
Task | A - 区間分割の仕方を最適化する問題 |
User | bouzuya |
Language | Rust (1.42.0) |
Score | 100 |
Code Size | 362 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 12828 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00 |
All | 00_sample_00, 10_random_00, 10_random_01, 10_random_02, 10_random_03, 10_random_04, 10_random_05, 10_random_06, 10_random_07, 10_random_08, 10_random_09, 10_random_10, 10_random_11, 10_random_12, 10_random_13, 10_random_14, 11_max_00, 11_max_01, 11_max_02, 11_max_03, 11_max_04 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00 | AC | 7 ms | 2016 KiB |
10_random_00 | AC | 14 ms | 4204 KiB |
10_random_01 | AC | 26 ms | 8024 KiB |
10_random_02 | AC | 5 ms | 2744 KiB |
10_random_03 | AC | 38 ms | 12460 KiB |
10_random_04 | AC | 11 ms | 2996 KiB |
10_random_05 | AC | 8 ms | 3488 KiB |
10_random_06 | AC | 25 ms | 9056 KiB |
10_random_07 | AC | 2 ms | 2028 KiB |
10_random_08 | AC | 3 ms | 2364 KiB |
10_random_09 | AC | 32 ms | 10072 KiB |
10_random_10 | AC | 2 ms | 2052 KiB |
10_random_11 | AC | 13 ms | 4040 KiB |
10_random_12 | AC | 19 ms | 7420 KiB |
10_random_13 | AC | 8 ms | 3648 KiB |
10_random_14 | AC | 26 ms | 8248 KiB |
11_max_00 | AC | 32 ms | 12828 KiB |
11_max_01 | AC | 36 ms | 12668 KiB |
11_max_02 | AC | 36 ms | 12808 KiB |
11_max_03 | AC | 37 ms | 12700 KiB |
11_max_04 | AC | 40 ms | 12652 KiB |