#1182542 (Rust) No.3670 Fast Knapsack

• 問題: No.3670 Fast Knapsack
• ユーザー: akakimidori
• 提出日時: 2026-09-04 23:00:28
• 言語: Rust (1.97.1 + proconio + num + itertools)
• 結果: AC
• 実行時間: 279 ms / 2,500 ms
• コード長: 2,959 bytes
• コンパイル時間: 16,429 ms
• コンパイル使用メモリ: 199,552 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-09-04 23:06:20
• 合計ジャッジ時間: 15,699 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

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

コンパイルメッセージ

warning: type alias `Map` is never used
  --> src/main.rs:84:6
   |
84 | type Map<K, V> = BTreeMap<K, V>;
   |      ^^^
   |
   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default

warning: type alias `Set` is never used
  --> src/main.rs:85:6
   |
85 | type Set<T> = BTreeSet<T>;
   |      ^^^

warning: type alias `Deque` is never used
  --> src/main.rs:86:6
   |
86 | type Deque<T> = VecDeque<T>;
   |      ^^^^^

ソースコード

fn run<W: Write>(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter<W>) {
    let t: u32 = sc.next();
    let mut dp = vec![std::cell::Cell::new(0usize); 100000 / 64 + 1];
    for _ in 0..t {
        let n: usize = sc.next();
        let w: usize = sc.next();
        let a: Vec<usize> = sc.next_vec(n);
        let ans = unsafe {solve(w, a, &mut dp)};
        writeln!(out, "{}", ans).ok();
    }
}

#[target_feature(enable = "avx2")]
unsafe fn solve(len: usize, a: Vec<usize>, dp: &mut Vec<std::cell::Cell<usize>>) -> usize {
    let w = std::mem::size_of::<usize>() * 8;
    dp.clear();
    dp.resize(len / w + 1, std::cell::Cell::new(0usize));
    dp[0].set(1);
    for a in a {
        let q = a / w;
        let r = a % w;
        if q >= dp.len() {
            continue;
        }
        if r == 0 {
            for (a, b) in dp[q..].iter().zip(dp.iter()).rev() {
                let v = b.get() | a.get();
                a.set(v);
            }
        } else {
            for ((a, b), c) in dp[q + 1..].iter().zip(dp.iter()).zip(dp[1..].iter()).rev() {
                let v = a.get() | (b.get() >> (w - r)) | (c.get() << r);
                a.set(v);
            }
            if q < dp.len() {
                let v = dp[q].get() | (dp[0].get() << r);
                dp[q].set(v);
            }
        }
    }
    let r = (len + 1) % w;
    if r != 0 {
      let v = dp[dp.len() - 1].get() & ((1 << r) - 1);
      dp[dp.len() - 1].set(v);
    }
    let x = dp.iter().rposition(|dp| dp.get() != 0).unwrap();
    w * (x + 1) - dp[x].get().leading_zeros() as usize - 1
//    (0..=len).rfind(|i| dp[i / w].get() >> (i % w) & 1 == 1).unwrap()
}

// ---------- begin scannner ----------
#[allow(dead_code)]
mod scanner {
    use std::str::FromStr;
    pub struct Scanner<'a> {
        it: std::str::SplitWhitespace<'a>,
    }
    impl<'a> Scanner<'a> {
        pub fn new(s: &'a String) -> Scanner<'a> {
            Scanner {
                it: s.split_whitespace(),
            }
        }
        pub fn next<T: FromStr>(&mut self) -> T {
            self.it.next().unwrap().parse::<T>().ok().unwrap()
        }
        pub fn next_bytes(&mut self) -> Vec<u8> {
            self.it.next().unwrap().bytes().collect()
        }
        pub fn next_chars(&mut self) -> Vec<char> {
            self.it.next().unwrap().chars().collect()
        }
        pub fn next_vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
            (0..len).map(|_| self.next()).collect()
        }
    }
}
// ---------- end scannner ----------

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut sc = scanner::Scanner::new(&s);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    run(&mut sc, &mut out);
}