#617936 (Rust) No.1376 Simple LPS Problem

• 問題: No.1376 Simple LPS Problem
• ユーザー: ziita
• 提出日時: 2021-02-14 20:01:53
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 4,445 bytes
• コンパイル時間: 14,771 ms
• コンパイル使用メモリ: 397,188 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-07-22 06:43:14
• 合計ジャッジ時間: 17,758 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	1 ms; 6,948 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	1 ms; 6,944 KB
testcase_12	AC	1 ms; 6,940 KB
testcase_13	AC	1 ms; 6,940 KB
testcase_14	AC	1 ms; 6,940 KB
testcase_15	AC	1 ms; 6,940 KB
testcase_16	AC	1 ms; 6,944 KB
testcase_17	AC	1 ms; 6,944 KB
testcase_18	AC	1 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	2 ms; 6,940 KB
testcase_21	AC	1 ms; 6,944 KB
testcase_22	AC	1 ms; 6,944 KB
testcase_23	AC	1 ms; 6,940 KB
testcase_24	AC	1 ms; 6,944 KB
testcase_25	AC	1 ms; 6,944 KB
testcase_26	AC	1 ms; 6,944 KB
testcase_27	AC	1 ms; 6,940 KB
testcase_28	AC	1 ms; 6,944 KB
testcase_29	AC	1 ms; 6,940 KB
testcase_30	AC	1 ms; 6,940 KB
testcase_31	AC	1 ms; 6,940 KB
testcase_32	AC	1 ms; 6,940 KB
testcase_33	AC	1 ms; 6,940 KB
testcase_34	AC	1 ms; 6,940 KB
testcase_35	AC	1 ms; 6,944 KB
testcase_36	AC	1 ms; 6,944 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	1 ms; 6,940 KB
testcase_40	AC	1 ms; 6,944 KB
testcase_41	AC	1 ms; 6,940 KB
testcase_42	WA	-
testcase_43	AC	5 ms; 6,940 KB
testcase_44	AC	1 ms; 6,940 KB
testcase_45	AC	2 ms; 6,944 KB
testcase_46	AC	5 ms; 6,940 KB
testcase_47	AC	4 ms; 6,944 KB
testcase_48	AC	4 ms; 6,940 KB
testcase_49	AC	1 ms; 6,944 KB
testcase_50	AC	2 ms; 6,944 KB
testcase_51	AC	5 ms; 6,940 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	AC	1 ms; 6,944 KB
testcase_56	AC	1 ms; 6,940 KB
testcase_57	AC	1 ms; 6,944 KB
testcase_58	AC	2 ms; 6,944 KB
testcase_59	AC	3 ms; 6,944 KB
testcase_60	AC	1 ms; 6,944 KB
testcase_61	AC	1 ms; 6,940 KB

ソースコード

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

// const MOD: usize = 998244353;
const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/100;

fn solve() {
    let (n,k) = read!(usize,usize);
    if n <= 8 {
        let mut a = n;
        let mut s = vec![];
        for i in 0..(1<<n) {
            let mut v = vec![];
            for j in 0..n {
                if (i>>j)%2==1 {
                    v.push(1);
                }
                else {
                    v.push(0);
                }
            }
            let mut ans = 0;
            for j in 0..n {
                for k in j..n {
                    let mut flag =true;
                    for m in j..=k {
                        if v[m]!=v[k-(m-j)] {
                            flag = false;
                        }
                    }
                    if flag {
                        ans = max(ans, k-j+1);
                    }
                }
            }
            if ans == k {
                a = ans;
                s = v;
            }
        }
        if a != k {
            println!("-1");
        }
        else {
            for &s in &s {
                print!("{}",s);
            }
            println!();
        }
    }
    else {
        if k < 4 {
            println!("-1");
            return;
        }
        let mut v = [0,0,1,1,0,1];
        for i in 0..k {
            print!("1");
        }
        for i in 0..(n-k) {
            print!("{}",v[i%6]);
        }
        println!();
    }
}

fn run() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    solve();
}