結果
問題 | No.1280 Beyond C |
ユーザー | fukafukatani |
提出日時 | 2020-11-06 21:31:04 |
言語 | Rust (1.72.1) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 2,096 bytes |
コンパイル時間 | 1,591 ms |
コンパイル使用メモリ | 152,056 KB |
実行使用メモリ | 5,008 KB |
最終ジャッジ日時 | 2023-09-29 18:15:06 |
合計ジャッジ時間 | 2,093 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 17 ms
4,380 KB |
testcase_16 | AC | 12 ms
4,380 KB |
testcase_17 | AC | 16 ms
4,376 KB |
testcase_18 | AC | 18 ms
4,980 KB |
testcase_19 | AC | 17 ms
5,008 KB |
testcase_20 | AC | 31 ms
4,600 KB |
testcase_21 | AC | 30 ms
4,660 KB |
testcase_22 | AC | 31 ms
4,540 KB |
ソースコード
#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let v = read_vec::<i64>(); let (n, m, c) = (v[0], v[1], v[2]); let a = read_vec::<i64>(); let mut b = read_vec::<i64>(); b.sort(); let mut ans = 0i64; for num in a { ans += (b.len() - b.upper_bound(&(c / num))) as i64; } println!("{}", ans as f64 / n as f64 / m as f64); } fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } use std::cmp::Ordering; pub trait BinarySearch<T> { fn lower_bound(&self, x: &T) -> usize; fn upper_bound(&self, x: &T) -> usize; } impl<T: Ord> BinarySearch<T> for [T] { fn lower_bound(&self, x: &T) -> usize { let mut low = 0; let mut high = self.len(); while low != high { let mid = (low + high) / 2; match self[mid].cmp(x) { Ordering::Less => { low = mid + 1; } Ordering::Equal | Ordering::Greater => { high = mid; } } } low } fn upper_bound(&self, x: &T) -> usize { let mut low = 0; let mut high = self.len(); while low != high { let mid = (low + high) / 2; match self[mid].cmp(x) { Ordering::Less | Ordering::Equal => { low = mid + 1; } Ordering::Greater => { high = mid; } } } low } }