結果

問題 No.1209 XOR Into You
ユーザー koba-e964koba-e964
提出日時 2020-08-30 14:25:27
言語 Rust
(1.72.1)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 5,053 bytes
コンパイル時間 4,275 ms
コンパイル使用メモリ 168,300 KB
実行使用メモリ 15,412 KB
最終ジャッジ日時 2023-08-09 12:26:06
合計ジャッジ時間 9,883 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 50 ms
4,380 KB
testcase_05 AC 49 ms
4,376 KB
testcase_06 AC 64 ms
9,204 KB
testcase_07 AC 99 ms
14,012 KB
testcase_08 AC 89 ms
13,400 KB
testcase_09 AC 89 ms
13,376 KB
testcase_10 AC 80 ms
13,104 KB
testcase_11 AC 87 ms
13,384 KB
testcase_12 AC 82 ms
13,112 KB
testcase_13 AC 91 ms
13,612 KB
testcase_14 AC 75 ms
13,180 KB
testcase_15 AC 89 ms
13,156 KB
testcase_16 AC 82 ms
13,160 KB
testcase_17 AC 77 ms
13,132 KB
testcase_18 AC 120 ms
14,880 KB
testcase_19 AC 86 ms
13,120 KB
testcase_20 AC 96 ms
13,672 KB
testcase_21 AC 72 ms
12,972 KB
testcase_22 AC 108 ms
15,352 KB
testcase_23 AC 110 ms
15,264 KB
testcase_24 AC 108 ms
15,272 KB
testcase_25 AC 104 ms
15,292 KB
testcase_26 AC 104 ms
15,404 KB
testcase_27 AC 107 ms
15,296 KB
testcase_28 AC 104 ms
15,304 KB
testcase_29 AC 108 ms
15,412 KB
testcase_30 AC 104 ms
15,252 KB
testcase_31 AC 77 ms
5,548 KB
testcase_32 AC 80 ms
5,472 KB
testcase_33 AC 78 ms
5,524 KB
testcase_34 AC 81 ms
5,484 KB
testcase_35 AC 78 ms
5,504 KB
testcase_36 AC 79 ms
5,560 KB
testcase_37 AC 77 ms
4,948 KB
testcase_38 AC 88 ms
13,924 KB
testcase_39 AC 81 ms
13,256 KB
testcase_40 AC 104 ms
15,340 KB
権限があれば一括ダウンロードができます

ソースコード

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, [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());
}

/**
 * Segment Tree. This data structure is useful for fast folding on intervals of an array
 * whose elements are elements of monoid I. Note that constructing this tree requires the identity
 * element of I and the operation of I.
 * Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)
 *              AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)
 */
struct SegTree<I, BiOp> {
    n: usize,
    dat: Vec<I>,
    op: BiOp,
    e: I,
}

impl<I, BiOp> SegTree<I, BiOp>
    where BiOp: Fn(I, I) -> I,
          I: Copy {
    pub fn new(n_: usize, op: BiOp, e: I) -> Self {
        let mut n = 1;
        while n < n_ { n *= 2; } // n is a power of 2
        SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e}
    }
    /* ary[k] <- v */
    pub fn update(&mut self, idx: usize, v: I) {
        let mut k = idx + self.n - 1;
        self.dat[k] = v;
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);
        }
    }
    /* [a, b) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        let mut left = self.e;
        let mut right = self.e;
        a += self.n - 1;
        b += self.n - 1;
        while a < b {
            if (a & 1) == 0 {
                left = (self.op)(left, self.dat[a]);
            }
            if (b & 1) == 0 {
                right = (self.op)(self.dat[b - 1], right);
            }
            a = a / 2;
            b = (b - 1) / 2;
        }
        (self.op)(left, right)
    }
}

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,
        a: [i64; n],
        b: [i64; n],
    }
    macro_rules! fail {
        () => {
            puts!("-1\n");
            return;
        }
    }
    if a[0] != b[0] {
        fail!();
    }
    let mut hm = HashMap::new();
    for i in 1..n {
        *hm.entry(a[i] ^ a[i - 1]).or_insert(0) += 1;
        *hm.entry(b[i] ^ b[i - 1]).or_insert(0) -= 1;
    }
    for (_, &v) in &hm {
        if v != 0 {
            fail!();
        }
    }
    let mut inv = HashMap::new();
    let mut count = 0;
    for i in 0..n - 1 {
        let val = a[i] ^ a[i + 1];
        inv.entry(val).or_insert(vec![]).push(count);
        count += 1;
    }
    let mut st = SegTree::new(n, |x, y| x + y, 0i64);
    let mut ans = 0;
    for i in (0..n - 1).rev() {
        let val = b[i] ^ b[i + 1];
        let ent = inv.entry(val).or_insert(vec![]);
        let idx = ent.pop().unwrap();
        ans += st.query(0, idx);
        st.update(idx, st.query(idx, idx + 1) + 1);
    }
    puts!("{}\n", ans);
}

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();
}
0