結果

問題 No.937 Ultra Sword
ユーザー koba-e964
提出日時 2023-07-23 02:57:06
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 3,389 bytes
コンパイル時間 18,854 ms
コンパイル使用メモリ 389,376 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-23 02:06:44
合計ジャッジ時間 16,381 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22 WA * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused macro definition: `puts`
  --> src/main.rs:95:18
   |
95 |     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:94:13
   |
94 |     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:94:9
   |
94 |     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 f2x_rem(mut x: usize, y: usize) -> usize {
    let mut count = 0;
    let mut cur = y;
    while 2 * x >= cur {
        cur *= 2;
        count += 1;
    }
    for _ in 0..count {
        cur >>= 1;
        if (x ^ cur) < x {
            x ^= cur;
        }
    }
    x
}
fn f2x_gcd(mut x: usize, mut y: usize) -> usize {
    while y != 0 {
        let r = f2x_rem(x, y);
        x = y;
        y = r;
    }
    x
}
fn f2x_mul(mut x: usize, y: usize) -> usize {
    let mut cur = 1;
    let mut prod = 0;
    while cur <= y {
        if (y & cur) != 0 {
            prod ^= x;
        }
        cur <<= 1;
        x <<= 1;
    }
    prod
}
// https://yukicoder.me/problems/no/937 (4)
// 作れる整数は、F_2[x] の元としてみたときの A_i の gcd の倍数である。
fn main() {
    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,
        a: [usize; n],
    }
    const W: usize = 100_001;
    let mut f = vec![0; W];
    let mut g = 0;
    let mut sum = 0;
    for &a in &a {
        g = f2x_gcd(g, a);
        f[a] += 1;
        sum += a as i64;
    }
    let mut ma = 0;
    for i in 1..1 << 17 {
        let p = f2x_mul(g, i);
        if p >= W { continue; }
        let mut dec = 0;
        for j in 1..=(W - 1) / p {
            dec += f[i * j] * (i - 1) as i64 * j as i64;
        }
        ma = max(ma, dec);
    }
    println!("{}", sum - ma);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0