#712224 (Rust) No.1167 Graduation Trip

提出ソース

結果

問題	No.1167 Graduation Trip
ユーザー	koba-e964
提出日時	2021-11-01 23:02:58
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	600 ms / 4,000 ms
コード長	4,774 bytes
コンパイル時間	13,016 ms
コンパイル使用メモリ	400,804 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-10 16:20:57
合計ジャッジ時間	23,911 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	370 ms 6,816 KB
testcase_01	AC	264 ms 6,816 KB
testcase_02	AC	192 ms 6,816 KB
testcase_03	AC	367 ms 6,816 KB
testcase_04	AC	373 ms 6,816 KB
testcase_05	AC	282 ms 6,816 KB
testcase_06	AC	362 ms 6,820 KB
testcase_07	AC	252 ms 6,816 KB
testcase_08	AC	202 ms 6,816 KB
testcase_09	AC	309 ms 6,820 KB
testcase_10	AC	567 ms 6,816 KB
testcase_11	AC	567 ms 6,816 KB
testcase_12	AC	585 ms 6,820 KB
testcase_13	AC	583 ms 6,816 KB
testcase_14	AC	577 ms 6,816 KB
testcase_15	AC	432 ms 6,816 KB
testcase_16	AC	322 ms 6,816 KB
testcase_17	AC	579 ms 6,820 KB
testcase_18	AC	514 ms 6,820 KB
testcase_19	AC	600 ms 6,816 KB
testcase_20	AC	7 ms 6,816 KB
testcase_21	AC	8 ms 6,816 KB
testcase_22	AC	6 ms 6,820 KB
testcase_23	AC	8 ms 6,816 KB
testcase_24	AC	8 ms 6,820 KB
testcase_25	AC	6 ms 6,820 KB
testcase_26	AC	6 ms 6,820 KB
testcase_27	AC	8 ms 6,816 KB
testcase_28	AC	8 ms 6,816 KB
testcase_29	AC	6 ms 6,816 KB
testcase_30	AC	31 ms 6,820 KB
testcase_31	AC	57 ms 6,816 KB
testcase_32	AC	62 ms 6,816 KB
testcase_33	AC	6 ms 6,820 KB
testcase_34	AC	6 ms 6,820 KB
testcase_35	AC	1 ms 6,816 KB
testcase_36	AC	1 ms 6,816 KB
testcase_37	AC	1 ms 6,820 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: method `update` is never used
  --> src/main.rs:70:12
   |
61 | / impl<I, BiOp> SegTree<I, BiOp>
62 | |     where BiOp: Fn(I, I) -> I,
63 | |           I: Clone {
   | |__________________- method in this implementation
...
70 |       pub fn update(&mut self, idx: usize, v: I) {
   |              ^^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

ソースコード

raw source code

#[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"));
}

/**
 * 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)
 *              yukicoder No. 833 (https://yukicoder.me/submissions/703521)
 */
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: Clone {
    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.clone(); 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].clone(), self.dat[2 * k + 2].clone());
        }
    }
    /* [a, b) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    #[allow(unused)]
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        let mut left = self.e.clone();
        let mut right = self.e.clone();
        a += self.n - 1;
        b += self.n - 1;
        while a < b {
            if (a & 1) == 0 {
                left = (self.op)(left, self.dat[a].clone());
            }
            if (b & 1) == 0 {
                right = (self.op)(self.dat[b - 1].clone(), right);
            }
            a = a / 2;
            b = (b - 1) / 2;
        }
        (self.op)(left, right)
    }
}

fn powmod(x: i64, mut e: i64, m: i64) -> i64 {
    let mut sum = 1;
    let mut cur = x % m;
    while e > 0 {
        if e % 2 != 0 {
            sum = sum * cur % m;
        }
        cur = cur * cur % m;
        e /= 2;
    }
    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();
}

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, q: usize,
        a: [u32; n],
        b: [[usize]; q],
    }
    let mut st = SegTree::new(n, |mut b1: Vec<u32>, b2| {
        for mut x in b2 {
            for &b in &b1 {
                x = min(x, x ^ b);
            }
            if x != 0 {
                b1.push(x);
            }
        }
        b1
    }, vec![]);
    for i in 0..n {
        if a[i] != 0 {
            st.dat[st.n - 1 + i] = vec![a[i]];
        }
    }
    for i in (0..st.n - 1).rev() {
        st.dat[i] = (st.op)(st.dat[2 * i + 1].clone(), st.dat[2 * i + 2].clone());
    }
    for mut b in b {
        b.insert(0, 0);
        b.push(n);
        let l = b.len();
        let mut f = 0;
        for i in 0..l - 1 {
            let x = st.query(b[i], b[i + 1]);
            f += b[i + 1] - b[i] - x.len();
        }
        puts!("{}\n", powmod(2, f as i64, 1_000_000_007));
    }
}