結果
問題 | No.1882 Areas of Triangle |
ユーザー | kenichi |
提出日時 | 2023-08-18 17:40:06 |
言語 | Rust (1.77.0 + proconio) |
結果 |
RE
|
実行時間 | - |
コード長 | 5,518 bytes |
コンパイル時間 | 25,519 ms |
コンパイル使用メモリ | 384,292 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-05-05 23:04:52 |
合計ジャッジ時間 | 16,736 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | AC | 1 ms
5,376 KB |
testcase_26 | AC | 1 ms
5,376 KB |
testcase_27 | AC | 0 ms
5,376 KB |
testcase_28 | WA | - |
ソースコード
//use std::io::*; //use std::str::FromStr; use std::io; use std::cmp::Ordering; /* const LOW_CASE_ALPHABET: [char; 26] = [ 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', ]; */ fn main() { let mut input = String::new(); io::stdin().read_line(&mut input).expect("Failed to read line"); let mut input_iter = input.split_whitespace(); let n: usize = input_iter.next().unwrap().parse().expect("Invalid input"); let k: i32 = input_iter.next().unwrap().parse().expect("Invalid input"); let mut input = String::new(); io::stdin().read_line(&mut input).expect("Failed to read line"); let a: Vec<i32> = input .split_whitespace() .map(|x| x.parse().expect("Invalid input")) .collect(); let mut ans = 0; let mut sorted_a = a.clone(); sorted_a.sort(); for &x in &sorted_a { let idx = n - match sorted_a.binary_search_by(|&a| { if 2 * k <= a * x { Ordering::Greater }else{ Ordering::Less } }) { Ok(i) | Err(i) => i }; ans += idx } println!("{}",ans); } /* pub fn ctoi(c: char) -> isize { let n = c as isize - '0' as isize; return n; } pub fn stoi(c: String) -> isize { let n = c.parse::<isize>().unwrap(); return n; } pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize { for _i in start as usize..sentence.len() { if sentence[_i] == target { return _i as isize; } } return -1; } pub fn hex_to_binary_2(hex_string: String, x: u32) -> Option<String> { match i64::from_str_radix(&hex_string, x) { Ok(decimal) => Some(format!("{}", decimal)), Err(_) => None, } } pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> { match i64::from_str_radix(hex_string, x) { Ok(decimal) => Some(format!("{}", decimal)), Err(_) => None, } } pub fn my_floor(x: f64) -> f64 { let rounded = (x * 1000.0).floor() / 1000.0; rounded } pub fn upper_lower(x: char) -> char { let result: char; if x.is_uppercase() { result = x.to_ascii_lowercase(); } else if x.is_lowercase() { result = x.to_ascii_uppercase(); } else { result = x; } result } pub fn maxf_2(x: f64, y: f64) -> f64 { let result; if x >= y { result = x; } else { result = y; } result } pub fn max_2(x: isize, y: isize) -> isize { let result; if x >= y { result = x; } else { result = y; } result } pub fn max_u_2(x: usize, y: usize) -> usize { let result; if x >= y { result = x; } else { result = y; } result } pub fn min_u_2(x: usize, y: usize) -> usize { let result; if x <= y { result = x; } else { result = y; } result } pub fn min_2(x: isize, y: isize) -> isize { let result; if x >= y { result = y; } else { result = x; } result } pub fn min_2_i32(x: i32, y: i32) -> i32 { let result; if x >= y { result = y; } else { result = x; } result } pub fn max_3(x: isize, y: isize, z: isize) -> isize { let result; if x >= y && y >= z { result = x; } else if x >= z && z >= y { result = x; } else if y >= x && x >= z { result = y; } else if y >= z && z >= x { result = y; } else if z >= x && x >= y { result = z; } else { result = z; } result } pub fn max_u_3(x: usize, y: usize, z: usize) -> usize { let result; if x >= y && y >= z { result = x; } else if x >= z && z >= y { result = x; } else if y >= x && x >= z { result = y; } else if y >= z && z >= x { result = y; } else if z >= x && x >= y { result = z; } else { result = z; } result } pub fn min_3(x: isize, y: isize, z: isize) -> isize { let result; if x <= y && y <= z { result = x; } else if x <= z && z <= y { result = x; } else if y <= x && x <= z { result = y; } else if y <= z && z <= x { result = y; } else if z <= x && x <= y { result = z; } else { result = z; } result } pub fn min_u_3(x: usize, y: usize, z: usize) -> usize { let result; if x <= y && y <= z { result = x; } else if x <= z && z <= y { result = x; } else if y <= x && x <= z { result = y; } else if y <= z && z <= x { result = y; } else if z <= x && x <= y { result = z; } else { result = z; } result } pub fn read_text() -> String { let mut word = String::new(); std::io::stdin().read_line(&mut word).ok(); let answer = word.trim().to_string(); answer } pub fn read_array() -> Vec<char> { let array: String = read(); let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>(); chars } pub fn read<T: FromStr>() -> T { let stdin = stdin(); let stdin = stdin.lock(); let token: String = stdin .bytes() .map(|c| c.expect("failed to read char") as char) .skip_while(|c| c.is_whitespace()) .take_while(|c| !c.is_whitespace()) .collect(); token.parse().ok().expect("failed to parse token") } */