結果

問題 No.2442 線形写像
ユーザー haihamabossuhaihamabossu
提出日時 2023-08-25 22:47:33
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 142 ms / 2,000 ms
コード長 2,174 bytes
コンパイル時間 25,148 ms
コンパイル使用メモリ 378,336 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-25 08:03:49
合計ジャッジ時間 13,467 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

pub mod scanner {
pub struct Scanner {
buf: Vec<String>,
}
impl Scanner {
pub fn new() -> Self {
Self { buf: vec![] }
}
pub fn new_from(source: &str) -> Self {
let source = String::from(source);
let buf = Self::split(source);
Self { buf }
}
pub fn next<T: std::str::FromStr>(&mut self) -> T {
loop {
if let Some(x) = self.buf.pop() {
return x.parse().ok().expect("");
}
let mut source = String::new();
std::io::stdin().read_line(&mut source).expect("");
self.buf = Self::split(source);
}
}
fn split(source: String) -> Vec<String> {
source
.split_whitespace()
.rev()
.map(String::from)
.collect::<Vec<_>>()
}
}
}
use crate::scanner::Scanner;
use std::io::Write;
fn main() {
let mut scanner = Scanner::new();
let out = std::io::stdout();
let mut out = std::io::BufWriter::new(out.lock());
let t: usize = 1;
for _ in 0..t {
solve(&mut scanner, &mut out);
}
}
fn dfs(l: usize, r: usize, k: usize, a: &Vec<usize>) -> bool {
if l + 1 == r {
return true;
}
let m = (r + l) / 2;
let mut count = 0;
for i in l..m {
let j = i + m - l;
let vi = (a[i] >> k) & 1;
let vj = (a[j] >> k) & 1;
if vi != vj {
count += 1;
}
}
if count == 0 || count == m - l {
return dfs(l, m, k, a) && dfs(m, r, k, a);
} else {
return false;
}
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
let n: usize = scanner.next();
let mut m = 1usize;
for _ in 0..n {
m *= 2;
}
let m = m;
let a = (0..m).map(|_| scanner.next::<usize>()).collect::<Vec<_>>();
let mut ans = a[0] == 0;
for k in 0..64 {
ans &= dfs(0, m, k, &a);
}
if ans {
writeln!(out, "Yes").unwrap();
} else {
writeln!(out, "No").unwrap();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0