Submission #1778653


Source Code Expand

import java.util.*;
import java.io.*;

public class Main {
    private static IO io = new IO();
    
    public static void main(String[] args) {
        int x1 = io.nextInt();
        int y1 = io.nextInt();
        int x2 = io.nextInt();
        int y2 = io.nextInt();
        int t = io.nextInt();
        int v = io.nextInt();
        int n = io.nextInt();

        boolean pos = false;
        for (int i = 0; i < n; i++) {
			int x = io.nextInt();
			int y = io.nextInt();
			if (Math.sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1)) + Math.sqrt((x-x2)*(x-x2)+(y-y2)*(y-y2)) <= t*v)
				pos = true;
		}

		if (pos) System.out.println("YES");
        else System.out.println("NO");
	}

    private static class IO extends PrintWriter {
		private final InputStream in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;
		IO() {
			this(System.in);
		}
		IO(InputStream source) {
			super(System.out);
			this.in = source;
		}
		boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}
		int readByte() {
			if (hasNextByte()) return buffer[ptr++];
			else return -1;
		}
		boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}
		boolean isNewLine(int c) {
			return c == '\n' || c == '\r';
		}
		void skipUnprintable() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
		}
		void skipNewLine() {
			while (hasNextByte() && isNewLine(buffer[ptr])) ptr++;
		}
		boolean hasNext() {
			skipUnprintable();
			return hasNextByte();
		}
		boolean hasNextLine() {
			skipNewLine();
			return hasNextByte();
		}
		String next() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
		char[] nextCharArray(int len) {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			char[] s = new char[len];
			int i = 0;
			int b = readByte();
			while (isPrintableChar(b)) {
				if (i == len) {
					throw new InputMismatchException();
				}
				s[i++] = (char) b;
				b = readByte();
			}
			return s;
		}
		String nextLine() {
			if (!hasNextLine()) {
				throw new NoSuchElementException();
			}
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isNewLine(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
		long nextLong() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}
		int nextInt() {
			long nl = nextLong();
			if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
				throw new NumberFormatException();
			}
			return (int) nl;
		}
		char nextChar() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			return (char) readByte();
		}
		double nextDouble() {
			return Double.parseDouble(next());
		}
		int[] arrayInt(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}
		long[] arrayLong(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++) a[i] = nextLong();
			return a;
		}
		double[] arrayDouble(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++) a[i] = nextDouble();
			return a;
		}
		void arrayInt(int[]... a) {
			for (int i = 0; i < a[0].length; i++) for (int j = 0; j < a.length; j++) a[j][i] = nextInt();
		}
		int[][] matrixInt(int n, int m) {
			int[][] a = new int[n][];
			for (int i = 0; i < n; i++) a[i] = arrayInt(m);
			return a;
		}
		char[][] charMap(int n, int m) {
			char[][] a = new char[n][];
			for (int i = 0; i < n; i++) a[i] = nextCharArray(m);
			return a;
		}
		public void close() {
			super.close();
			try {
				in.close();
			} catch (IOException ignored) {
			}
		}
	}
}

Submission Info

Submission Time
Task C - 浮気調査
User creep04
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 4613 Byte
Status AC
Exec Time 84 ms
Memory 21588 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 68 ms 18260 KB
sample_02.txt AC 67 ms 21204 KB
sample_03.txt AC 68 ms 18388 KB
sample_04.txt AC 68 ms 20308 KB
test_01.txt AC 73 ms 18644 KB
test_02.txt AC 80 ms 21460 KB
test_03.txt AC 71 ms 21332 KB
test_04.txt AC 69 ms 17748 KB
test_05.txt AC 72 ms 21204 KB
test_06.txt AC 68 ms 21332 KB
test_07.txt AC 73 ms 19668 KB
test_08.txt AC 73 ms 19284 KB
test_09.txt AC 73 ms 20820 KB
test_10.txt AC 80 ms 21460 KB
test_11.txt AC 68 ms 17748 KB
test_12.txt AC 68 ms 19284 KB
test_13.txt AC 83 ms 20948 KB
test_14.txt AC 75 ms 20948 KB
test_15.txt AC 69 ms 19156 KB
test_16.txt AC 70 ms 21332 KB
test_17.txt AC 70 ms 18772 KB
test_18.txt AC 68 ms 19156 KB
test_19.txt AC 74 ms 19412 KB
test_20.txt AC 74 ms 19668 KB
test_21.txt AC 84 ms 18004 KB
test_22.txt AC 69 ms 21332 KB
test_23.txt AC 68 ms 18260 KB
test_24.txt AC 69 ms 21076 KB
test_25.txt AC 71 ms 19412 KB
test_26.txt AC 74 ms 19028 KB
test_27.txt AC 82 ms 19284 KB
test_28.txt AC 80 ms 21588 KB
test_29.txt AC 68 ms 19284 KB
test_30.txt AC 70 ms 20948 KB
test_31.txt AC 67 ms 19284 KB