結果
問題 | No.2889 Rusk |
ユーザー |
![]() |
提出日時 | 2024-09-13 21:48:31 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 76 ms / 2,000 ms |
コード長 | 5,056 bytes |
コンパイル時間 | 16,406 ms |
コンパイル使用メモリ | 378,976 KB |
実行使用メモリ | 30,884 KB |
最終ジャッジ日時 | 2024-09-13 21:49:03 |
合計ジャッジ時間 | 20,387 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 52 |
コンパイルメッセージ
warning: variable does not need to be mutable --> src/main.rs:118:9 | 118 | 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:124:9 | 124 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:129:9 | 129 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:135:9 | 135 | let mut vec: Vec<f64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:140:9 | 140 | let mut vec: Vec<char> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:145:9 | 145 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:150:9 | 150 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:156:9 | 156 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:162:9 | 162 | let mut a: Vec<i64> = read_vec(); | ----^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:163:9 | 163 | let mut b: Vec<i64> = read_vec(); | ----^
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] // use core::num; use std::cmp::*; use std::fmt::*; use std::hash::*; 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 MOD: i64 = MOD2; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // use proconio::input; // const MOD: i64 = INF; use cmp::Ordering::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { //if expr println!("{}", $x); }; } macro_rules! vp { // vector print separate with space ($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{ // declear btreemap ($($key:expr => $val:expr),*) => { { let mut map = ::std::collections::BTreeMap::new(); $( map.insert($key, $val); )* map } }; } macro_rules! set{ // declear btreemap ($($key:expr),*) => { { let mut set = ::std::collections::BTreeSet::new(); $( set.insert($key); )* set } }; } //input output #[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: usize = read(); let mut a: Vec<i64> = read_vec(); let mut b: Vec<i64> = read_vec(); let mut c: Vec<i64> = read_vec(); let mut dp = vec![vec![-1 * INF; (10) as usize]; (n + 1) as usize]; // 0 まだ焼いてない // 1 片面だけ焼き始めた区間 // 2 両面焼き始めた区間 // 3 1回目の片面だけ焼き終わった区間 // 4 2回目の片面を焼いてる区間 // 5 焼き終わった区間 dp[0][0] = 0; for i in 0..n { dp[i + 1][0] = max(dp[i + 1][0], dp[i][0]); dp[i + 1][1] = max(dp[i + 1][1], dp[i][0]); dp[i + 1][1] = max(dp[i + 1][1], dp[i][1]); dp[i + 1][2] = max(dp[i + 1][2], dp[i][0]); dp[i + 1][2] = max(dp[i + 1][2], dp[i][1]); dp[i + 1][2] = max(dp[i + 1][2], dp[i][2]); dp[i + 1][3] = max(dp[i + 1][3], dp[i][1]); dp[i + 1][3] = max(dp[i + 1][3], dp[i][3]); dp[i + 1][4] = max(dp[i + 1][4], dp[i][2]); dp[i + 1][4] = max(dp[i + 1][4], dp[i][3]); dp[i + 1][4] = max(dp[i + 1][4], dp[i][4]); dp[i + 1][5] = max(dp[i + 1][5], dp[i][0]); dp[i + 1][5] = max(dp[i + 1][5], dp[i][1]); dp[i + 1][5] = max(dp[i + 1][5], dp[i][2]); dp[i + 1][5] = max(dp[i + 1][5], dp[i][3]); dp[i + 1][5] = max(dp[i + 1][5], dp[i][4]); dp[i + 1][5] = max(dp[i + 1][5], dp[i][5]); dp[i + 1][0] += a[i]; dp[i + 1][1] += b[i]; dp[i + 1][2] += c[i]; dp[i + 1][3] += a[i]; dp[i + 1][4] += b[i]; dp[i + 1][5] += a[i]; // d!(dp[i + 1]); } let mut ans = 0; for i in 0..6 { ans = max(ans, dp[n][i]); } p!(ans); return; }