#918449 (Rust) No.2493 K-th in L2 with L1

• 問題: No.2493 K-th in L2 with L1
• ユーザー: naut3
• 提出日時: 2023-10-06 21:59:52
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 5 ms / 2,000 ms
• コード長: 2,542 bytes
• コンパイル時間: 12,953 ms
• コンパイル使用メモリ: 379,404 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-26 16:06:07
• 合計ジャッジ時間: 13,545 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 4

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#![allow(non_snake_case, unused_imports, unused_must_use)]
use std::io::{self, prelude::*};
use std::str;
fn main() {
    let (stdin, stdout) = (io::stdin(), io::stdout());
    let mut scan = Scanner::new(stdin.lock());
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! input {
        ($T: ty) => {
            scan.token::<$T>()
        };
        ($T: ty, $N: expr) => {
            (0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>()
        };
    }
    let Q = input!(usize);
    for _ in 0..Q {
        let D = input!(isize);
        let K = input!(isize);
        let mut P = std::collections::BTreeSet::new();
        for i in 0..=D {
            P.insert((i, D - i));
            P.insert((i, -(D - i)));
            P.insert((-i, D - i));
            P.insert((-i, -(D - i)));
        }
        let P = P.iter().map(|&p| p).collect::<Vec<_>>();
        //eprintln!("{:?}", P.clone());
        let mut isok = false;
        for &(y, x) in P.iter() {
            let d2 = (y).abs() * (y).abs() + (x).abs() * (x).abs();
            let mut c1 = 0;
            let mut c2 = 0;
            for &(py, px) in P.iter() {
                let d1 = (py).abs() * (py).abs() + (px).abs() * (px).abs();
                if d2 > d1 {
                    c1 += 1;
                }
                if d2 >= d1 {
                    c2 += 1;
                }
            }
            //eprintln!("{} {} {} {} {}", x, y, c1, c2, K);
            if c1 < K && K <= c2 {
                isok = true;
                writeln!(out, "Yes\n{} {}", x, y);
                break;
            }
        }
        if !isok {
            writeln!(out, "No");
        }
    }
}
struct Scanner<R> {
    reader: R,
    buf_str: Vec<u8>,
    buf_iter: str::SplitWhitespace<'static>,
}
impl<R: BufRead> Scanner<R> {
    fn new(reader: R) -> Self {
        Self {
            reader,
            buf_str: vec![],
            buf_iter: "".split_whitespace(),
        }
    }
    fn token<T: str::FromStr>(&mut self) -> T {
        loop {
            if let Some(token) = self.buf_iter.next() {
                return token.parse().ok().expect("Failed parse");
            }
            self.buf_str.clear();
            self.reader
                .read_until(b'\n', &mut self.buf_str)
                .expect("Failed read");
            self.buf_iter = unsafe {
                let slice = str::from_utf8_unchecked(&self.buf_str);
                std::mem::transmute(slice.split_whitespace())
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX