#956906 (Rust) No.2656 XOR Slimes

• 問題: No.2656 XOR Slimes
• ユーザー: Moss_Local
• 提出日時: 2024-03-01 22:37:35
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 42 ms / 2,000 ms
• コード長: 4,086 bytes
• コンパイル時間: 1,973 ms
• コンパイル使用メモリ: 181,552 KB
• 実行使用メモリ: 6,548 KB
• 最終ジャッジ日時: 2024-03-01 22:37:39
• 合計ジャッジ時間: 3,636 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,548 KB
testcase_01	AC	1 ms; 6,548 KB
testcase_02	AC	1 ms; 6,548 KB
testcase_03	AC	1 ms; 6,548 KB
testcase_04	AC	1 ms; 6,548 KB
testcase_05	AC	1 ms; 6,548 KB
testcase_06	AC	1 ms; 6,548 KB
testcase_07	AC	1 ms; 6,548 KB
testcase_08	AC	25 ms; 6,548 KB
testcase_09	AC	25 ms; 6,548 KB
testcase_10	AC	25 ms; 6,548 KB
testcase_11	AC	25 ms; 6,548 KB
testcase_12	AC	25 ms; 6,548 KB
testcase_13	AC	25 ms; 6,548 KB
testcase_14	AC	25 ms; 6,548 KB
testcase_15	AC	26 ms; 6,548 KB
testcase_16	AC	25 ms; 6,548 KB
testcase_17	AC	24 ms; 6,548 KB
testcase_18	AC	42 ms; 6,548 KB
testcase_19	AC	25 ms; 6,548 KB
testcase_20	AC	24 ms; 6,548 KB
testcase_21	AC	25 ms; 6,548 KB
testcase_22	AC	25 ms; 6,548 KB
testcase_23	AC	25 ms; 6,548 KB
testcase_24	AC	25 ms; 6,548 KB
testcase_25	AC	24 ms; 6,548 KB
testcase_26	AC	25 ms; 6,548 KB
testcase_27	AC	25 ms; 6,548 KB
testcase_28	AC	25 ms; 6,548 KB
testcase_29	AC	25 ms; 6,548 KB
testcase_30	AC	25 ms; 6,548 KB
testcase_31	AC	25 ms; 6,548 KB
testcase_32	AC	25 ms; 6,548 KB
testcase_33	AC	25 ms; 6,548 KB
testcase_34	AC	26 ms; 6,548 KB
testcase_35	AC	25 ms; 6,548 KB
testcase_36	AC	26 ms; 6,548 KB
testcase_37	AC	25 ms; 6,548 KB
testcase_38	AC	25 ms; 6,548 KB
testcase_39	AC	25 ms; 6,548 KB
testcase_40	AC	25 ms; 6,548 KB
testcase_41	AC	25 ms; 6,548 KB
testcase_42	AC	25 ms; 6,548 KB
testcase_43	AC	25 ms; 6,548 KB
testcase_44	AC	25 ms; 6,548 KB
testcase_45	AC	25 ms; 6,548 KB
testcase_46	AC	25 ms; 6,548 KB
testcase_47	AC	26 ms; 6,548 KB
testcase_48	AC	25 ms; 6,548 KB
testcase_49	AC	25 ms; 6,548 KB
testcase_50	AC	25 ms; 6,548 KB
testcase_51	AC	26 ms; 6,548 KB
testcase_52	AC	25 ms; 6,548 KB
testcase_53	AC	25 ms; 6,548 KB
testcase_54	AC	25 ms; 6,548 KB
testcase_55	AC	25 ms; 6,548 KB
testcase_56	AC	25 ms; 6,548 KB
testcase_57	AC	25 ms; 6,548 KB
testcase_58	AC	25 ms; 6,548 KB

コンパイルメッセージ

warning: variable does not need to be mutable
   --> Main.rs:122:9
    |
122 |     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
   --> Main.rs:128:9
    |
128 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

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

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

warning: variable does not need to be mutable
   --> Main.rs:144:9
    |
144 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

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

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

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

warning: variable does not need to be mutable
   --> Main.rs:173:9
    |
173 |     let mut x: Vec<usize> = read_vec();
    |         ----^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:174:9
    |
174 |     let mut a: Vec<usize> = read_vec();
    |         ----^
    |         |
    |         help: re

ソースコード

// -*- 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
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[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 read_imat(h: usize) -> Vec<Vec<i64>> {
    (0..h).map(|_| read_vec()).collect()
}
fn read_cmat(h: usize) -> Vec<Vec<char>> {
    (0..h).map(|_| read::<String>().chars().collect()).collect()
}

fn solve() {
    let n: usize = read();
    let mut x: Vec<usize> = read_vec();
    let mut a: Vec<usize> = read_vec();
    let mut dp = vec![0; n];
    dp[0] = a[0];
    for i in 1..n {
        let mut xor = a[i];
        dp[i] = dp[i - 1] + a[i];
        for j in (0..i).rev() {
            xor ^= a[j];
            if j > 0 {
                dp[i] = min(dp[i], dp[j - 1] + xor + x[i] - x[j]);
            } else {
                dp[i] = min(dp[i], xor + x[i] - x[j]);
            }
        }
    }
    p!(dp[n - 1]);
}