結果

問題 No.2423 Merge Stones
ユーザー koba-e964koba-e964
提出日時 2023-08-13 23:18:23
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 2,822 ms / 4,000 ms
コード長 3,417 bytes
コンパイル時間 16,242 ms
コンパイル使用メモリ 377,512 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-21 17:24:00
合計ジャッジ時間 102,203 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 72
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused macro definition: `puts`
  --> src/main.rs:62:18
   |
62 |     macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
   |                  ^^^^
   |
   = note: `#[warn(unused_macros)]` on by default

warning: unused import: `Write`
 --> src/main.rs:5:15
  |
5 | use std::io::{Write, BufWriter};
  |               ^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `out`
  --> src/main.rs:61:13
   |
61 |     let mut out = BufWriter::new(out.lock());
   |             ^^^ help: if this is intentional, prefix it with an underscore: `_out`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
  --> src/main.rs:61:9
   |
61 |     let mut out = BufWriter::new(out.lock());
   |         ----^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input! {
        n: usize, k: usize,
        a: [i64; n],
        c: [usize1; n],
    }
    let mut acc = vec![0; 2 * n + 1];
    for i in 0..2 * n {
        acc[i + 1] = acc[i] + a[i % n];
    }
    const C: usize = 50;
    let mut ans = 0;
    let mut dp = vec![vec![0u64; 2 * n + 1]; 2 * n];
    for i in 0..2 * n {
        let u = i % n;
        dp[i][i + 1] |= 1 << c[u];
        ans = max(ans, a[u]);
    }
    for s in 2..n + 1 {
        for i in 0..2 * n - s + 1 {
            let j = i + s;
            let mut me = 0u64;
            for l in i + 1..j {
                for b in 0..C {
                    if (dp[i][l] & 1 << b) != 0 {
                        let bits = (1 << (b + k + 1)) - (1 << b);
                        let bits = bits | bits >> k;
                        if (dp[l][j] & bits) != 0 {
                            me |= 1 << b | (dp[l][j] & bits);
                        }
                    }
                }
            }
            dp[i][j] = me;
            if me != 0 {
                ans = max(ans, acc[j] - acc[i]);
            }
        }
    }
    println!("{}", ans);
}
0