#960143 (Rust) No.2672 Subset Xor Sum

提出ソース

結果

問題	No.2672 Subset Xor Sum
ユーザー	Moss_Local
提出日時	2024-03-15 21:53:51
言語	Rust (1.77.0 + proconio)
結果	WA
実行時間	-
コード長	4,727 bytes
コンパイル時間	12,193 ms
コンパイル使用メモリ	395,868 KB
実行使用メモリ	10,108 KB
最終ジャッジ日時	2024-09-30 00:56:51
合計ジャッジ時間	15,692 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	1 ms 6,820 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	1 ms 6,816 KB
testcase_05	AC	1 ms 6,820 KB
testcase_06	AC	1 ms 6,820 KB
testcase_07	AC	1 ms 6,820 KB
testcase_08	AC	1 ms 6,816 KB
testcase_09	AC	1 ms 6,820 KB
testcase_10	AC	2 ms 6,820 KB
testcase_11	AC	1 ms 6,816 KB
testcase_12	AC	1 ms 6,816 KB
testcase_13	AC	1 ms 6,816 KB
testcase_14	AC	2 ms 6,816 KB
testcase_15	AC	2 ms 6,816 KB
testcase_16	AC	1 ms 6,820 KB
testcase_17	AC	1 ms 6,820 KB
testcase_18	AC	1 ms 6,820 KB
testcase_19	AC	2 ms 6,816 KB
testcase_20	AC	1 ms 6,816 KB
testcase_21	AC	2 ms 6,816 KB
testcase_22	AC	1 ms 6,816 KB
testcase_23	AC	1 ms 6,820 KB
testcase_24	AC	1 ms 6,820 KB
testcase_25	AC	1 ms 6,816 KB
testcase_26	AC	7 ms 6,816 KB
testcase_27	AC	6 ms 6,816 KB
testcase_28	AC	1 ms 6,816 KB
testcase_29	AC	1 ms 6,820 KB
testcase_30	AC	1 ms 6,816 KB
testcase_31	AC	17 ms 9,508 KB
testcase_32	AC	8 ms 6,820 KB
testcase_33	AC	6 ms 6,820 KB
testcase_34	AC	13 ms 6,832 KB
testcase_35	AC	16 ms 8,288 KB
testcase_36	AC	13 ms 7,428 KB
testcase_37	AC	15 ms 8,072 KB
testcase_38	AC	8 ms 6,816 KB
testcase_39	AC	18 ms 9,912 KB
testcase_40	AC	4 ms 6,816 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	AC	1 ms 6,820 KB
testcase_47	AC	203 ms 6,820 KB
testcase_48	AC	1 ms 6,820 KB
testcase_49	AC	1 ms 6,816 KB
testcase_50	AC	1 ms 6,820 KB
testcase_51	AC	200 ms 6,820 KB
testcase_52	AC	200 ms 6,820 KB
testcase_53	AC	230 ms 6,816 KB
testcase_54	AC	229 ms 6,816 KB
testcase_55	AC	201 ms 6,820 KB
testcase_56	AC	2 ms 6,820 KB
testcase_57	AC	139 ms 6,816 KB
testcase_58	AC	48 ms 6,820 KB
testcase_59	AC	0 ms 6,816 KB
testcase_60	AC	1 ms 6,816 KB
testcase_61	AC	1 ms 6,820 KB
testcase_62	AC	89 ms 6,816 KB
testcase_63	AC	106 ms 6,820 KB
testcase_64	AC	165 ms 6,816 KB
testcase_65	AC	49 ms 6,820 KB
testcase_66	AC	1 ms 6,820 KB
testcase_67	AC	1 ms 6,820 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

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

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

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

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

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

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

ソースコード

raw source code

// -*- 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 vec: Vec<usize> = read_vec();
    if n >= 10000 {
        p!("Yes");
        return;
    }
    vec.sort();
    let mut acc_xor = 0;
    for i in 0..n {
        acc_xor ^= vec[i];
    }
    if acc_xor != 0 {
        p!("No");
        return;
    }
    let mut dp = vec![vec![0 as usize; (8192) as usize]; (2) as usize];
    let mut dp_idx = 0;
    dp[dp_idx][0] = 1;
    for i in 0..n {
        let next_idx = (dp_idx + 1) % 2;
        for j in 0..8192 {
            // dp[i + 1][j ^ vec[i]] += dp[i][j];
            // dp[i + 1][j ^ vec[i]] = min(dp[i + 1][j ^ vec[i]], 3);
            // dp[i + 1][j] += dp[i][j];
            // dp[i + 1][j] = min(dp[i + 1][j], 3);

            dp[next_idx][j ^ vec[i]] += dp[dp_idx][j];
            dp[next_idx][j ^ vec[i]] = min(dp[next_idx][j ^ vec[i]], 3);
            dp[next_idx][j] += dp[dp_idx][j];
            dp[next_idx][j] = min(dp[next_idx][j], 3);
        }
        for i in 0..8192 {
            dp[dp_idx][i] = 0;
        }
        dp_idx = next_idx;
    }
    if dp[(dp_idx) % 2][0] >= 3 {
        p!("Yes");
    } else {
        p!("No");
    }
    return;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード