結果

問題 No.946 箱箱箱
ユーザー akiradeveloperakiradeveloper
提出日時 2019-12-09 02:41:39
言語 Rust
(1.77.0)
結果
AC  
実行時間 845 ms / 2,000 ms
コード長 6,616 bytes
コンパイル時間 3,056 ms
コンパイル使用メモリ 161,384 KB
実行使用メモリ 66,124 KB
最終ジャッジ日時 2023-09-09 09:59:48
合計ジャッジ時間 39,356 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,384 KB
testcase_03 AC 838 ms
64,876 KB
testcase_04 AC 841 ms
64,136 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 842 ms
64,936 KB
testcase_07 AC 841 ms
64,940 KB
testcase_08 AC 845 ms
64,964 KB
testcase_09 AC 800 ms
65,000 KB
testcase_10 AC 838 ms
64,972 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 779 ms
64,880 KB
testcase_13 AC 843 ms
64,920 KB
testcase_14 AC 843 ms
64,992 KB
testcase_15 AC 839 ms
64,952 KB
testcase_16 AC 835 ms
64,928 KB
testcase_17 AC 837 ms
64,960 KB
testcase_18 AC 843 ms
64,992 KB
testcase_19 AC 830 ms
64,916 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 809 ms
65,004 KB
testcase_22 AC 839 ms
66,124 KB
testcase_23 AC 843 ms
64,960 KB
testcase_24 AC 810 ms
64,948 KB
testcase_25 AC 830 ms
64,972 KB
testcase_26 AC 836 ms
64,872 KB
testcase_27 AC 839 ms
64,932 KB
testcase_28 AC 832 ms
65,004 KB
testcase_29 AC 841 ms
64,936 KB
testcase_30 AC 843 ms
64,972 KB
testcase_31 AC 842 ms
64,936 KB
testcase_32 AC 810 ms
63,588 KB
testcase_33 AC 844 ms
64,956 KB
testcase_34 AC 842 ms
64,960 KB
testcase_35 AC 841 ms
64,972 KB
testcase_36 AC 842 ms
64,932 KB
testcase_37 AC 839 ms
64,888 KB
testcase_38 AC 829 ms
64,872 KB
testcase_39 AC 823 ms
64,252 KB
testcase_40 AC 807 ms
64,884 KB
testcase_41 AC 838 ms
64,964 KB
testcase_42 AC 838 ms
64,932 KB
testcase_43 AC 841 ms
64,988 KB
testcase_44 AC 837 ms
65,992 KB
testcase_45 AC 842 ms
64,940 KB
testcase_46 AC 842 ms
64,948 KB
testcase_47 AC 1 ms
4,376 KB
testcase_48 AC 1 ms
4,376 KB
testcase_49 AC 1 ms
4,380 KB
testcase_50 AC 1 ms
4,380 KB
testcase_51 AC 1 ms
4,380 KB
testcase_52 AC 1 ms
4,380 KB
testcase_53 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `out`
   --> Main.rs:156:13
    |
156 |     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 `xor` is assigned to, but never used
   --> Main.rs:162:13
    |
162 |     let mut xor = 0;
    |             ^^^
    |
    = note: consider using `_xor` instead

warning: variable does not need to be mutable
   --> Main.rs:156:9
    |
156 |     let mut out = BufWriter::new(out.lock());
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable `V` should have a snake case name
   --> Main.rs:126:17
    |
126 |         let mut V = vec![];
    |                 ^ help: convert the identifier to snake case (notice the capitalization): `v`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: 4 warnings emitted

ソースコード

diff # 

#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
    reader: R,
    buf: Vec<u8>,
    pos: usize,
}
impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}
impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                if len == 0 {
                    break;
                }
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

struct Rec {
    a: Vec<i64>,
    n: usize,
    memo_emp: Vec<Option<i64>>,
    memo_full: Vec<Vec<Option<i64>>>,
}
impl Rec {
    fn grundy_emp(&mut self, l: usize) -> i64 {
        if l == self.n {
            return 0
        }
        if let Some(x) = self.memo_emp[l] {
            return x;
        }

        let mut V = vec![];
        for r in l+1..self.n+1 {
            V.push(self.grundy_full(l,r))
        }
        V.sort();
        for i in 0..V.len() {
            if V[i] != i as i64 {
                self.memo_emp[l] = Some(i as i64);
                return i as i64;
            }
        }
        self.memo_emp[l] = Some(V.len() as i64);
        return V.len() as i64
    }
    fn grundy_full(&mut self, l: usize, r: usize) -> i64 {
        if let Some(x) = self.memo_full[l][r] {
            return x
        }
        let mut xor = 0;
        for i in l..r {
            xor ^= self.a[i];
        }
        let v = self.grundy_emp(r) ^ xor;
        self.memo_full[l][r] = Some(v);
        v
    }
}

fn solve() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    input!{
        n:usize,
        a:[i64;n]
    }

    let mut xor = 0;
    for i in 0..n {
        xor ^= a[i];
    }

    let fi = || {
        println!("Takahashi");
    };
    let se = || {
        println!("Takanashi");
    };

    let mut rec = Rec {
        memo_emp: vec![None;n+1],
        memo_full: vec![vec![None;n+1];n+1],
        a: a,
        n: n,
    };
    let g = rec.grundy_emp(0);
    if g > 0 {
        fi()
    } else {
        se()
    }
}
0