結果

問題 No.2393 Bit Grid Connected Component
ユーザー haihamabossuhaihamabossu
提出日時 2023-07-28 21:38:00
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 34 ms / 2,000 ms
コード長 1,741 bytes
コンパイル時間 13,664 ms
コンパイル使用メモリ 391,988 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-06 18:00:23
合計ジャッジ時間 14,847 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 20
権限があれば一括ダウンロードができます

ソースコード

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());
solve(&mut scanner, &mut out);
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
let mut ans = vec![0usize; 100];
ans[0] = 1;
{
let mut b = 2usize;
for i in 1..=60 {
ans[i] = ans[i - 1] + b;
b *= 2;
}
}
let t: usize = scanner.next();
for _ in 0..t {
let x: usize = scanner.next();
let y: usize = scanner.next();
let mut z = y;
while ((x >> z) & 1) == 1 {
z += 1;
}
z -= 1;
writeln!(out, "{}", ans[z]).unwrap();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0