Submission #1871929


Source Code Expand

use std::io::{stdin, Read, StdinLock};
use std::str::FromStr;

struct Scanner<'a> {
    stdin: StdinLock<'a>,
}

impl<'a> Scanner<'a> {
    fn new(stdin: StdinLock<'a>) -> Scanner<'a> {
        return Scanner {stdin: stdin}
    }

    fn read1<T: FromStr>(&mut self) -> Option<T> {
        let token = self.stdin.by_ref().bytes().map(|c| c.unwrap() as char)
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        return token.parse::<T>().ok();
    }

    fn read<T: FromStr>(&mut self) -> T {
        return self.read1().unwrap()
    }
}

fn main() {
    let stdin = stdin();
    let stdin = stdin.lock();
    let mut scanner = Scanner::new(stdin);

    let xa: i32 = scanner.read();
    let ya: i32 = scanner.read();
    let xb: i32 = scanner.read();
    let yb: i32 = scanner.read();
    let t: i32 = scanner.read();
    let v: i32 = scanner.read();
    let n: i32 = scanner.read();

    let threshold: f64 = (t * v) as f64;

    let mut result = false;
    for _ in 0..n {
        let x: i32 = scanner.read();
        let y: i32 = scanner.read();

        let distance =
            (((xa - x).pow(2) + (ya - y).pow(2)) as f64).sqrt() +
            (((xb - x).pow(2) + (yb - y).pow(2)) as f64).sqrt();

        if distance - 1e-11 < threshold {
            result = true;
        }
    }

    if result {
        println!("YES");
    } else {
        println!("NO");
    }
}

Submission Info

Submission Time
Task C - 浮気調査
User yucchiy
Language Rust (1.15.1)
Score 100
Code Size 1523 Byte
Status AC
Exec Time 2 ms
Memory 4352 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 35
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 4352 KB
sample_02.txt AC 2 ms 4352 KB
sample_03.txt AC 2 ms 4352 KB
sample_04.txt AC 2 ms 4352 KB
test_01.txt AC 2 ms 4352 KB
test_02.txt AC 2 ms 4352 KB
test_03.txt AC 2 ms 4352 KB
test_04.txt AC 2 ms 4352 KB
test_05.txt AC 2 ms 4352 KB
test_06.txt AC 2 ms 4352 KB
test_07.txt AC 2 ms 4352 KB
test_08.txt AC 2 ms 4352 KB
test_09.txt AC 2 ms 4352 KB
test_10.txt AC 2 ms 4352 KB
test_11.txt AC 2 ms 4352 KB
test_12.txt AC 2 ms 4352 KB
test_13.txt AC 2 ms 4352 KB
test_14.txt AC 2 ms 4352 KB
test_15.txt AC 2 ms 4352 KB
test_16.txt AC 2 ms 4352 KB
test_17.txt AC 2 ms 4352 KB
test_18.txt AC 2 ms 4352 KB
test_19.txt AC 2 ms 4352 KB
test_20.txt AC 2 ms 4352 KB
test_21.txt AC 2 ms 4352 KB
test_22.txt AC 2 ms 4352 KB
test_23.txt AC 2 ms 4352 KB
test_24.txt AC 2 ms 4352 KB
test_25.txt AC 2 ms 4352 KB
test_26.txt AC 2 ms 4352 KB
test_27.txt AC 2 ms 4352 KB
test_28.txt AC 2 ms 4352 KB
test_29.txt AC 2 ms 4352 KB
test_30.txt AC 2 ms 4352 KB
test_31.txt AC 2 ms 4352 KB