結果

問題 No.800 四平方定理
ユーザー tanzaku
提出日時 2019-03-17 21:33:17
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1,147 ms / 2,000 ms
コード長 2,903 bytes
コンパイル時間 13,790 ms
コンパイル使用メモリ 387,800 KB
実行使用メモリ 40,964 KB
最終ジャッジ日時 2024-07-07 20:52:49
合計ジャッジ時間 25,957 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::collections::VecDeque`
  --> src/main.rs:72:5
   |
72 | use std::collections::VecDeque;
   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
   |
   = note: `#[warn(unused_imports)]` on by default

ソースコード

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

#[allow(unused_macros)]
macro_rules! input {
(source = $s:expr, $($r:tt)*) => {
input_inner!{$s, $($r)*}
};
($($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)*}
};
}
#[allow(unused_macros)]
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)*}
};
($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
let mut $var = read_value!($next, $t);
input_inner!{$next $($r)*}
};
}
#[allow(unused_macros)]
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, string) => {
read_value!($next, String).chars().collect::<String>()
};
($next:expr, chars) => {
read_value!($next, String).chars().collect::<Vec<char>>()
};
($next:expr, bytes) => {
read_value!($next, String).into_bytes()
};
($next:expr, usize1) => {
read_value!($next, usize) - 1
};
($next:expr, $t:ty) => {
$next().parse::<$t>().expect("Parse error")
};
}
#[allow(unused)]
use std::io::{Stdin, Bytes, BufReader, StdinLock};
use std::collections::VecDeque;
fn lb(vec: &Vec<i32>, v: i32) -> usize {
let mut low = -1_isize;
let mut high = vec.len() as isize;
while high - low > 1 {
let mid = (low + high) / 2;
if vec[mid as usize] < v {
low = mid;
} else {
high = mid;
}
}
high as usize
}
fn ub(vec: &Vec<i32>, v: i32) -> usize {
let mut low = -1_isize;
let mut high = vec.len() as isize;
while high - low > 1 {
let mid = (low + high) / 2;
if vec[mid as usize] <= v {
low = mid;
} else {
high = mid;
}
}
high as usize
}
fn main() {
input! {
n: i32,
d: i32,
};
let mut sum = Vec::new();
let mut sub = Vec::new();
for i in 1..=n {
for j in 1..=n {
sum.push(i*i+j*j);
}
}
for i in 1..=n {
for j in 1..=n {
sub.push(i*i-j*j);
}
}
sum.sort();
let mut ans = 0;
for i in sub.into_iter() {
let l = lb(&sum, i + d);
let u = ub(&sum, i + d);
ans += u - l;
}
println!("{}", ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0