#1182632 (Rust) No.3670 Fast Knapsack

• 問題: No.3670 Fast Knapsack
• ユーザー: 👑 ArcAki
• 提出日時: 2026-09-04 23:23:38
• 言語: Rust (1.97.1 + proconio + num + itertools)
• 結果: AC
• 実行時間: 697 ms / 2,500 ms
• コード長: 15,593 bytes
• コンパイル時間: 1,904 ms
• コンパイル使用メモリ: 218,676 KB
• 実行使用メモリ: 9,784 KB
• 最終ジャッジ日時: 2026-09-04 23:23:53
• 合計ジャッジ時間: 11,661 ms
• ジャッジサーバーID （参考情報）: judge4_1 / judge1_0

ファイルパターン	結果
sample	AC * 1
other	AC * 25

ソースコード

#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::File, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, 
        Neg, RangeBounds, BitAnd, BitAndAssign, BitOr, BitXor, BitXorAssign, BitOrAssign},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
    ptr::null_mut, println, print,debug_assert,debug_assert_eq,debug_assert_ne,
};
#[allow(unused_imports)]
use core::panic;
pub mod fxhash {
    use std::hash::BuildHasherDefault;
    const K: u64 = 0x517c_c1b7_2722_0a95;
    #[derive(Default)]
    pub struct FxHasher {
        pub hash: u64,
    }
    impl FxHasher {
        #[inline(always)]
        fn mix_u64(mut h: u64, x: u64) -> u64 {
            h = h.rotate_left(5) ^ x;
            h = h.wrapping_mul(K);
            let x2 = x ^ (x >> 33) ^ (x << 11);
            h = h.rotate_left(5) ^ x2;
            h = h.wrapping_mul(K);
            h
        }

        #[inline(always)]
        fn write_u64_impl(&mut self, x: u64) {
            self.hash = Self::mix_u64(self.hash, x);
        }
    }

    impl std::hash::Hasher for FxHasher {
        #[inline(always)]
        fn finish(&self) -> u64 {
            self.hash
        }

        #[inline(always)]
        fn write(&mut self, bytes: &[u8]) {
            let mut h = self.hash;
            for &b in bytes {
                h = h.rotate_left(5) ^ (b as u64);
                h = h.wrapping_mul(K);
            }
            self.hash = h;
        }

        #[inline(always)]
        fn write_u64(&mut self, i: u64) { self.write_u64_impl(i); }
        #[inline(always)]
        fn write_u32(&mut self, i: u32) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_u16(&mut self, i: u16) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_u8 (&mut self, i: u8 ) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_usize(&mut self, i: usize) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i64(&mut self, i: i64) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i32(&mut self, i: i32) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i16(&mut self, i: i16) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_i8 (&mut self, i: i8 ) { self.write_u64_impl(i as u64); }
        #[inline(always)]
        fn write_isize(&mut self, i: isize) { self.write_u64_impl(i as u64); }
    }

    pub type FxBuildHasher = BuildHasherDefault<FxHasher>;
    pub type FxMap<K, V> = std::collections::HashMap<K, V, FxBuildHasher>;
    pub type FxSet<K> = std::collections::HashSet<K, FxBuildHasher>;
}

pub fn gcd(mut a: i64, mut b: i64)->i64{if a==0{return b;}else if b==0{return a;}let l1 = a.trailing_zeros();let l2 = b.trailing_zeros();
a >>= l1; b >>= l2;while a!=b{let x = (a^b).trailing_zeros();if a<b{swap(&mut a, &mut b)}a = (a-b)>>x;}a << l1.min(l2)}
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){ 
    let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }
    inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn modulo(a: i64, b: i64)->i64{(a%b+b)%b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}else if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(mut x: i64,p: usize, m: i64)->i64{
    x %= m;
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}

pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {self.sort_by(|u, v| v.cmp(&u));} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } }
pub trait Chmax: PartialOrd + Copy {fn chmax(&mut self, rhs: Self) {if *self < rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmax for T {}
pub trait Chmin: PartialOrd + Copy {fn chmin(&mut self, rhs: Self) {if *self > rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmin for T {}
#[allow(unused)]
use proconio::{*, marker::*};
#[allow(unused)]
use fxhash::FxMap;

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<30;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
pub fn c2d(c: u8)->(usize, usize){match c{b'U'=>(!0,0),b'D'=>(1,0),b'L'=>(0,!0),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn c2d_i64(c: u8)->(i64, i64){match c{b'U'=>(-1,0),b'D'=>(1,0),b'L'=>(0,-1),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

const BITSET_BLOCK_BITS: usize = 64;
const BITSET_SHIFT: usize = 6;
const BITSET_MASK: usize = 63;

#[derive(Clone, Debug, PartialEq, Eq)]
pub struct BitSet {
    n: usize,
    data: Vec<u64>,
}

impl BitSet {
    #[inline]
    pub fn new(n: usize) -> Self {
        Self {
            n, data: vec![0; (n + BITSET_MASK) >> BITSET_SHIFT],
        }
    }

    #[inline]
    pub fn build(n: usize, data: Vec<u64>) -> Self {
        debug_assert_eq!(
            data.len(),
            (n + BITSET_MASK) >> BITSET_SHIFT
        );

        let mut res = Self { n, data };
        res.mask_last();
        res
    }

    #[inline(always)]
    pub fn len(&self) -> usize {
        self.n
    }

    #[inline(always)]
    pub fn blocks(&self) -> usize {
        self.data.len()
    }

    #[inline(always)]
    pub fn is_empty_len(&self) -> bool {
        self.n == 0
    }

    #[inline(always)]
    fn mask_last(&mut self) {
        let r = self.n & BITSET_MASK;

        if r != 0 {
            if let Some(last) = self.data.last_mut() {
                *last &= (1u64 << r) - 1;
            }
        }
    }

    #[inline(always)]
    pub fn set(&mut self, p: usize, f: bool) {
        debug_assert!(p < self.n);

        if f {
            self.data[p >> BITSET_SHIFT] |=
                1u64 << (p & BITSET_MASK);
        } else {
            self.data[p >> BITSET_SHIFT] &=
                !(1u64 << (p & BITSET_MASK));
        }
    }

    #[inline(always)]
    pub fn insert(&mut self, p: usize) {
        debug_assert!(p < self.n);

        self.data[p >> BITSET_SHIFT] |=
            1u64 << (p & BITSET_MASK);
    }

    #[inline(always)]
    pub fn remove(&mut self, p: usize) {
        debug_assert!(p < self.n);

        self.data[p >> BITSET_SHIFT] &=
            !(1u64 << (p & BITSET_MASK));
    }

    #[inline(always)]
    pub fn flip(&mut self, p: usize) {
        debug_assert!(p < self.n);

        self.data[p >> BITSET_SHIFT] ^=
            1u64 << (p & BITSET_MASK);
    }

    #[inline(always)]
    pub fn get(&self, p: usize) -> bool {
        debug_assert!(p < self.n);

        self.data[p >> BITSET_SHIFT]
            & (1u64 << (p & BITSET_MASK))
            != 0
    }

    #[inline]
    pub fn clear(&mut self) {
        self.data.fill(0);
    }

    #[inline]
    pub fn fill(&mut self) {
        self.data.fill(!0u64);
        self.mask_last();
    }

    #[inline]
    pub fn flip_all(&mut self) {
        for x in &mut self.data {
            *x = !*x;
        }

        self.mask_last();
    }

    #[inline]
    pub fn count_ones(&self) -> usize {
        self.data
            .iter()
            .map(|x| x.count_ones() as usize)
            .sum()
    }

    #[inline]
    pub fn count_zeros(&self) -> usize {
        self.n - self.count_ones()
    }

    #[inline]
    pub fn none(&self) -> bool {
        self.data.iter().all(|&x| x == 0)
    }

    #[inline]
    pub fn any(&self) -> bool {
        self.data.iter().any(|&x| x != 0)
    }

    #[inline]
    pub fn all(&self) -> bool {
        self.count_ones() == self.n
    }

    #[inline]
    pub fn and_count_ones(&self, rhs: &Self) -> usize {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .map(|(&x, &y)| (x & y).count_ones() as usize)
            .sum()
    }

    #[inline]
    pub fn and_count_zeros(&self, rhs: &Self) -> usize {
        self.n - self.and_count_ones(rhs)
    }

    #[inline]
    pub fn and_is_empty(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .all(|(&x, &y)| (x & y) == 0)
    }

    #[inline]
    pub fn and_is_nonempty(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .any(|(&x, &y)| (x & y) != 0)
    }

    #[inline]
    pub fn or_count_ones(&self, rhs: &Self) -> usize {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .map(|(&x, &y)| (x | y).count_ones() as usize)
            .sum()
    }

    #[inline]
    pub fn or_count_zeros(&self, rhs: &Self) -> usize {
        self.n - self.or_count_ones(rhs)
    }

    #[inline]
    pub fn or_is_empty(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .all(|(&x, &y)| (x | y) == 0)
    }

    #[inline]
    pub fn or_is_nonempty(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .any(|(&x, &y)| (x | y) != 0)
    }

    #[inline]
    pub fn xor_count_ones(&self, rhs: &Self) -> usize {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .map(|(&x, &y)| (x ^ y).count_ones() as usize)
            .sum()
    }

    #[inline]
    pub fn xor_count_zeros(&self, rhs: &Self) -> usize {
        self.n - self.xor_count_ones(rhs)
    }

    #[inline]
    pub fn xor_is_empty(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .all(|(&x, &y)| (x ^ y) == 0)
    }

    #[inline]
    pub fn xor_is_nonempty(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .any(|(&x, &y)| (x ^ y) != 0)
    }

    #[inline]
    pub fn disjoint(&self, rhs: &Self) -> bool {
        self.and_is_empty(rhs)
    }

    #[inline]
    pub fn is_subset(&self, rhs: &Self) -> bool {
        self.assert_same_len(rhs);

        self.data
            .iter()
            .zip(rhs.data.iter())
            .all(|(&x, &y)| x & !y == 0)
    }

    #[inline]
    pub fn is_superset(&self, rhs: &Self) -> bool {
        rhs.is_subset(self)
    }

    #[inline]
    pub fn get_shift_left(&self, k: usize) -> Self {
        if k >= self.n {
            return Self::new(self.n);
        }

        let block = k >> BITSET_SHIFT;
        let rem = k & BITSET_MASK;
        let m = self.data.len();

        let mut res = vec![0u64; m];

        for i in 0..m {
            let j = i + block;

            if j >= m {
                break;
            }

            res[j] |= self.data[i] << rem;

            if rem != 0 && j + 1 < m {
                res[j + 1] |=
                    self.data[i] >> (BITSET_BLOCK_BITS - rem);
            }
        }

        Self::build(self.n, res)
    }

    #[inline]
    pub fn get_shift_right(&self, k: usize) -> Self {
        if k >= self.n {
            return Self::new(self.n);
        }

        let block = k >> BITSET_SHIFT;
        let rem = k & BITSET_MASK;
        let m = self.data.len();

        let mut res = vec![0u64; m];

        for i in block..m {
            res[i - block] |= self.data[i] >> rem;

            if rem != 0 && i >= block + 1 {
                res[i - block - 1] |=
                    self.data[i] << (BITSET_BLOCK_BITS - rem);
            }
        }

        Self::build(self.n, res)
    }

    #[inline(always)]
    fn assert_same_len(&self, rhs: &Self) {
        debug_assert_eq!(self.n, rhs.n);
    }
}

impl BitAndAssign<&BitSet> for BitSet {
    #[inline(always)]
    fn bitand_assign(&mut self, rhs: &BitSet) {
        self.assert_same_len(rhs);

        for (x, &y) in self.data.iter_mut().zip(rhs.data.iter()) {
            *x &= y;
        }
    }
}

impl BitOrAssign<&BitSet> for BitSet {
    #[inline(always)]
    fn bitor_assign(&mut self, rhs: &BitSet) {
        self.assert_same_len(rhs);

        for (x, &y) in self.data.iter_mut().zip(rhs.data.iter()) {
            *x |= y;
        }
    }
}

impl BitXorAssign<&BitSet> for BitSet {
    #[inline(always)]
    fn bitxor_assign(&mut self, rhs: &BitSet) {
        self.assert_same_len(rhs);

        for (x, &y) in self.data.iter_mut().zip(rhs.data.iter()) {
            *x ^= y;
        }
    }
}

impl<'a, 'b> BitAnd<&'b BitSet> for &'a BitSet {
    type Output = BitSet;

    #[inline]
    fn bitand(self, rhs: &'b BitSet) -> BitSet {
        self.assert_same_len(rhs);

        let mut res = self.clone();
        res &= rhs;
        res
    }
}

impl<'a, 'b> BitOr<&'b BitSet> for &'a BitSet {
    type Output = BitSet;

    #[inline]
    fn bitor(self, rhs: &'b BitSet) -> BitSet {
        self.assert_same_len(rhs);

        let mut res = self.clone();
        res |= rhs;
        res
    }
}

impl<'a, 'b> BitXor<&'b BitSet> for &'a BitSet {
    type Output = BitSet;

    #[inline]
    fn bitxor(self, rhs: &'b BitSet) -> BitSet {
        self.assert_same_len(rhs);

        let mut res = self.clone();
        res ^= rhs;
        res
    }
}

const MULTI: bool = true;
#[fastout]
fn solve(){
    input!{
        n: usize, s: usize,
    }
    let mut bs = BitSet::new(s+1);
    bs.set(0,true);
    for _ in 0..n{
        input!{
            x: usize,
        }
        bs.bitor_assign(&bs.get_shift_left(x));
    }
    for (i,&v) in bs.data.iter().enumerate().rev(){
        if v!=0 {
            println!("{}",(i+1)*BITSET_BLOCK_BITS-1-v.leading_zeros()as usize);
            return;
        }
    }
}

fn main() {
    if MULTI{
        input!{
            t: usize,
        }
        for _ in 0..t{
            solve();
        }
    } else {
        solve();
    }
}