結果
| 問題 | No.2493 K-th in L2 with L1 |
| ユーザー |
 kenichi
|
| 提出日時 | 2023-10-15 12:58:18 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 9 ms / 2,000 ms |
| コード長 | 7,963 bytes |
| コンパイル時間 | 12,875 ms |
| コンパイル使用メモリ | 378,192 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-09-16 21:59:46 |
| 合計ジャッジ時間 | 13,627 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 4 |
ソースコード
use std::io::*;use std::str::FromStr;//use std::collections::VecDeque;/*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 q: usize = read();for _i in 0..q{let d: usize = read();let k: usize = read();let mut grid_x_manhattan = Vec::new();let mut grid_y_manhattan = Vec::new();let mut tmp = 0;for _j in 0..=d * 2{for _k in 0..=d * 2{let grid_x: isize = _j as isize - d as isize;let grid_y: isize = _k as isize - d as isize;if (grid_x).abs() + (grid_y).abs() == d as isize{grid_x_manhattan.push(grid_x);grid_y_manhattan.push(grid_y);}}}if d != 0{for _j in 0..4 * d{let mut test_1 = 0;let mut test_2 = 0;for _k in 0..4 * d{if (grid_x_manhattan[_k]).pow(2) + (grid_y_manhattan[_k]).pow(2) < (grid_x_manhattan[_j]).pow(2) + (grid_y_manhattan[_j]).pow(2){test_1 += 1;}if (grid_x_manhattan[_k]).pow(2) + (grid_y_manhattan[_k]).pow(2) <= (grid_x_manhattan[_j]).pow(2) + (grid_y_manhattan[_j]).pow(2){test_2 += 1;}}if test_1 < k && test_2 >= k{println!("Yes");println!("{} {}",grid_x_manhattan[_j],grid_y_manhattan[_j]);tmp = 1;break;}}}else{for _j in 0..=0{let mut test_1 = 0;let mut test_2 = 0;for _k in 0..=0{if (grid_x_manhattan[_k]).pow(2) + (grid_y_manhattan[_k]).pow(2) < (grid_x_manhattan[_j]).pow(2) + (grid_y_manhattan[_j]).pow(2){test_1 += 1;}if (grid_x_manhattan[_k]).pow(2) + (grid_y_manhattan[_k]).pow(2) <= (grid_x_manhattan[_j]).pow(2) + (grid_y_manhattan[_j]).pow(2){test_2 += 1;}}if test_1 < k && test_2 >= k{println!("Yes");println!("{} {}",grid_x_manhattan[_j],grid_y_manhattan[_j]);tmp = 1;break;}}}if tmp == 0{println!("No");}}}pub fn mod_pow(mut base: u64, mut exp: u64, modulus: u64) -> u64{let mut result = 1;while exp > 0{if exp % 2 == 1{result = result * base % modulus;}base = base * base % modulus;exp >>= 1;}result}/*pub fn perfect(value_1: usize) -> usize {let mut perfect_number = Vec::new();let mut tmp_1 = 0;for _i in 2..=value_1 {let mut tmp = 0;for _j in 1..=((_i as f64).powf(0.5)) as usize {if _i % _j == 0 {if _j * _j == _i {tmp += _j;} else {tmp += _j + (_i / _j);}}}tmp -= _i;if tmp == _i {perfect_number.push(_i);}}for _i in &perfect_number{if tmp_1 == perfect_number.len() - 1{break;}println!("{}", _i);tmp_1 += 1;}perfect_number[perfect_number.len() - 1]}*/pub fn prime_number(value_1: usize, value_2: usize) -> usize {let mut primary = Vec::new();primary.push(2);for _i in 2..=value_1 {let mut flag = 0;for _j in &primary {if _i % _j == 0 {flag = 1;break;}}if flag == 0 {primary.push(_i);}if primary.len() == value_2 {return primary[primary.len() - 1];}}0}pub fn prime_amount(value_1: usize) -> usize {let mut primary = Vec::new();primary.push(2);for _i in 2..=value_1 {let mut flag = 0;for _j in &primary {if _i % _j == 0 {flag = 1;break;}}if flag == 0 {primary.push(_i);}}primary.len()}/*pub fn ctoi(c: char) -> isize {c as isize - '0' as isize}pub fn stoi(c: String) -> isize {c.parse::<isize>().unwrap()}*//*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;}}-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 {(x * 1000.0).floor() / 1000.0}*//*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 {if x >= y {x} else {y}}*//*pub fn max_2(x: isize, y: isize) -> isize {if x >= y {x} else {y}}*/pub fn max_u_2(x: usize, y: usize) -> usize {if x >= y {x} else {y}}/*pub fn min_2(x: isize, y: isize) -> isize {if x >= y {y} else {x}}*//*pub fn min_u_2(x: usize, y: usize) -> usize {if x >= y {y} else {x}}*//*pub fn max_3(x: isize, y: isize, z: isize) -> isize {if (x >= y && y >= z) || (x >= z && z >= y){x} else if (y >= x && x >= z) || (y >= z && z >= x) {y} else {z}}*//*pub fn max_u_3(x: usize, y: usize, z: usize) -> usize {if (x >= y && y >= z) || (x >= z && z >= y){x} else if (y >= x && x >= z) || (y >= z && z >= x) {y} else {z}}*//*pub fn min_3(x: isize, y: isize, z: isize) -> isize {if (x <= y && y <= z) || (x <= z && z <= y){x} else if (y <= x && x <= z) || (y <= z && z <= x) {y} else {z}}*//*pub fn min_u_3(x: usize, y: usize, z: usize) -> usize {if (x <= y && y <= z) || (x <= z && z <= y){x} else if (y <= x && x <= z) || (y <= z && z <= x) {y} else {z}}*/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")}pub fn read_line<T: FromStr>() -> String {let stdin = stdin();let stdin = stdin.lock();stdin.lines().next().expect("No line in the input").expect("Failed to read line")}