Submission #241664

Source Code Expand

import java.util.*;

public class Main {

	private void solve() {

		@SuppressWarnings("resource")
		Scanner sc = new Scanner(System.in);

		long[] book = { sc.nextLong(), sc.nextLong() };

		int kosu = sc.nextInt();

		long[][] box = new long[kosu][2];
		for (int i = 0; i < kosu; i++) {
			box[i][0] = sc.nextLong();
			box[i][1] = sc.nextLong();
		}

		for (int i = 0; i < kosu; i++) {
			System.out.println(judge(book, box[i]) ? "YES" : "NO");
		}
	}

	private boolean judge(long[] book, long[] box) {
		boolean ok = false;
		if ((book[0] < box[0] && book[1] < box[1]) || (book[0] < box[1] && book[1] < box[0])) {
			ok = true;
		} else {
			double bookX = Math.sqrt(Math.pow((double) book[0], 2) + Math.pow((double) book[1], 2));
			double boxX = Math.sqrt(Math.pow((double) box[0], 2) + Math.pow((double) box[1], 2));
			double ratio = bookX / boxX;
			if (ratio < 1 && (book[0] * ratio < book[1] || book[1] * ratio < book[0])) {
				ok = true;
			}
		}
		return ok;
	}

	public static void main(String[] args) {
		new Main().solve();
	}
}

Submission Info

Submission Time
Task B - 高橋君と禁断の書
User kakiageudon
Language Java (OpenJDK 1.7.0)
Score 0
Code Size 1089 Byte
Status WA
Exec Time 969 ms
Memory 36512 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
AC × 2
WA × 29
Set Name Test Cases
Sample subtask0-sample-01.txt
All subtask0-sample-01.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask1-27.txt, subtask1-28.txt, subtask1-29.txt, subtask1-30.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 411 ms 23324 KiB
subtask1-01.txt AC 406 ms 23260 KiB
subtask1-02.txt WA 519 ms 25092 KiB
subtask1-03.txt WA 715 ms 29508 KiB
subtask1-04.txt WA 782 ms 31724 KiB
subtask1-05.txt WA 754 ms 30436 KiB
subtask1-06.txt WA 817 ms 33280 KiB
subtask1-07.txt WA 811 ms 32500 KiB
subtask1-08.txt WA 813 ms 32904 KiB
subtask1-09.txt WA 808 ms 32672 KiB
subtask1-10.txt WA 924 ms 35620 KiB
subtask1-11.txt WA 931 ms 36256 KiB
subtask1-12.txt WA 922 ms 35396 KiB
subtask1-13.txt WA 969 ms 36128 KiB
subtask1-14.txt WA 914 ms 35672 KiB
subtask1-15.txt WA 919 ms 36312 KiB
subtask1-16.txt WA 933 ms 36256 KiB
subtask1-17.txt WA 929 ms 36312 KiB
subtask1-18.txt WA 934 ms 36044 KiB
subtask1-19.txt WA 921 ms 36220 KiB
subtask1-20.txt WA 925 ms 36144 KiB
subtask1-21.txt WA 909 ms 36228 KiB
subtask1-22.txt WA 919 ms 36116 KiB
subtask1-23.txt WA 933 ms 36512 KiB
subtask1-24.txt WA 932 ms 35916 KiB
subtask1-25.txt WA 953 ms 35608 KiB
subtask1-26.txt WA 949 ms 36484 KiB
subtask1-27.txt WA 942 ms 36268 KiB
subtask1-28.txt WA 929 ms 36264 KiB
subtask1-29.txt WA 922 ms 36220 KiB
subtask1-30.txt WA 933 ms 35672 KiB