#560646 (Rust) No.1240 Or Sum of Xor Pair

• 問題: No.1240 Or Sum of Xor Pair
• ユーザー: koba-e964
• 提出日時: 2020-10-01 16:25:57
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 463 ms / 2,000 ms
• コード長: 4,790 bytes
• コンパイル時間: 11,874 ms
• コンパイル使用メモリ: 398,132 KB
• 実行使用メモリ: 71,424 KB
• 最終ジャッジ日時: 2024-07-07 01:21:55
• 合計ジャッジ時間: 18,643 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	10 ms; 6,944 KB
testcase_04	AC	9 ms; 6,940 KB
testcase_05	AC	8 ms; 6,940 KB
testcase_06	AC	7 ms; 6,948 KB
testcase_07	AC	6 ms; 6,944 KB
testcase_08	AC	6 ms; 6,944 KB
testcase_09	AC	8 ms; 6,944 KB
testcase_10	AC	44 ms; 19,072 KB
testcase_11	AC	49 ms; 21,376 KB
testcase_12	AC	80 ms; 28,672 KB
testcase_13	AC	66 ms; 25,984 KB
testcase_14	AC	77 ms; 28,800 KB
testcase_15	AC	463 ms; 66,432 KB
testcase_16	AC	373 ms; 66,432 KB
testcase_17	AC	357 ms; 66,304 KB
testcase_18	AC	385 ms; 66,432 KB
testcase_19	AC	369 ms; 66,304 KB
testcase_20	AC	384 ms; 66,560 KB
testcase_21	AC	383 ms; 66,432 KB
testcase_22	AC	406 ms; 66,304 KB
testcase_23	AC	347 ms; 66,432 KB
testcase_24	AC	380 ms; 66,304 KB
testcase_25	AC	336 ms; 66,304 KB
testcase_26	AC	377 ms; 66,432 KB
testcase_27	AC	1 ms; 6,944 KB
testcase_28	AC	1 ms; 6,940 KB
testcase_29	AC	59 ms; 6,940 KB
testcase_30	AC	33 ms; 6,940 KB
testcase_31	AC	44 ms; 6,940 KB
testcase_32	AC	169 ms; 71,424 KB

ソースコード

#[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, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($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"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

struct Trie {
    l: Option<Box<Trie>>,
    r: Option<Box<Trie>>,
    zero: [i32; 18],
    one: [i32; 18],
}

fn new() -> Trie {
    Trie {
        l: None,
        r: None,
        zero: [0; 18],
        one: [0; 18],
    }
}

fn add(t: &mut Trie, dep: usize, a: i32) {
    for i in 0..18 {
        if (a & 1 << i) != 0 {
            t.one[i] += 1;
        } else {
            t.zero[i] += 1;
        }
    }
    if dep >= 18 {
        return;
    }
    let now = if (a & 1 << (17 - dep)) != 0 {
        1
    } else {
        0
    };
    if now == 1 {
        if t.r.is_none() {
            t.r = Some(Box::new(new()));
        }
        add(&mut t.r.as_mut().unwrap(), dep + 1, a);
    } else {
        if t.l.is_none() {
            t.l = Some(Box::new(new()));
        }
        add(&mut t.l.as_mut().unwrap(), dep + 1, a);
    }
}

fn or_sum_whole(t: &Trie, a: i32) -> i64 {
    let mut s: i64 = 0;
    for i in 0..18 {
        if (a & 1 << i) != 0 {
            s += ((t.zero[i] + t.one[i]) as i64) << i;
        } else {
            s += (t.one[i] as i64) << i;
        }
    }
    s
}

fn or_sum(t: &Trie, dep: usize, a: i32, x: i32) -> i64 {
    if dep >= 18 {
        return 0;
    }
    let now = if (a & 1 << (17 - dep)) != 0 {
        1
    } else {
        0
    };
    let mut s: i64 = 0;
    if now == 0 {
        if (x & 1 << (17 - dep)) != 0 {
            if let Some(ref l) = t.l {
                s += or_sum_whole(l, a);
            }
            if let Some(ref r) = t.r {
                s += or_sum(r, dep + 1, a, x);
            }
        } else {
            if let Some(ref l) = t.l {
                s += or_sum(l, dep + 1, a, x);
            }
        }
    } else {
        if (x & 1 << (17 - dep)) != 0 {
            if let Some(ref r) = t.r {
                s += or_sum_whole(r, a);
            }
            if let Some(ref l) = t.l {
                s += or_sum(l, dep + 1, a, x);
            }
        } else {
            if let Some(ref r) = t.r {
                s += or_sum(r, dep + 1, a, x);
            }
        }
    }
    s
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, x: i32,
        a: [i32; n],
    }
    let mut trie = new();
    let mut sum = 0;
    for &a in &a {
        sum += if x < 1 << 18 {
            or_sum(&trie, 0, a, x)
        } else {
            or_sum_whole(&trie, a)
        };
        add(&mut trie, 0, a);
    }
    puts!("{}\n", sum);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}