Submission #1729820


Source Code Expand


public class Main {

	private static void solve() {
		int n = ni();
		long s1 = nl();
		long s2 = nl();
		int[][] p = ntable(n, 2);

		int count = 0;
		for (int i = 0; i < n; i ++) {
			for (int j = i + 1; j < n; j ++) {
				long v = ((long)p[i][0] - p[j][0]) * (p[i][1] - p[j][1]);
				
				if (s1 <= v && v <= s2) {
					count ++;
				}
			}
		}
		System.out.println(count);
	}

	public static void main(String[] args) {
		reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
		solve();
		out.flush();
	}

	private static java.io.InputStream is = System.in;
	private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
	private static java.util.StringTokenizer tokenizer = null;
	private static java.io.BufferedReader reader;

	public static String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new java.util.StringTokenizer(reader.readLine());
			} catch (Exception e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	private static double nd() {
		return Double.parseDouble(next());
	}

	private static long nl() {
		return Long.parseLong(next());
	}

	private static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}

	private static char[] ns() {
		return next().toCharArray();
	}

	private static long[] nal(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nl();
		return a;
	}

	private static int[][] ntable(int n, int m) {
		int[][] table = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				table[i][j] = ni();
			}
		}
		return table;
	}

	private static int[][] nlist(int n, int m) {
		int[][] table = new int[m][n];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				table[j][i] = ni();
			}
		}
		return table;
	}

	private static int ni() {
		return Integer.parseInt(next());
	}

	private static void tr(Object... o) {
		if (is != System.in)
			System.out.println(java.util.Arrays.deepToString(o));
	}
}

Submission Info

Submission Time
Task H - 平和協定
User hiromi_ayase
Language Java8 (OpenJDK 1.8.0)
Score 10
Code Size 2178 Byte
Status TLE
Exec Time 4209 ms
Memory 38988 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 10 / 10 0 / 90
Status
AC × 3
AC × 17
AC × 28
TLE × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.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
Subtask2 sample_01.txt, sample_02.txt, sample_03.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt
Case Name Status Exec Time Memory
sample_01.txt AC 73 ms 19152 KB
sample_02.txt AC 70 ms 19668 KB
sample_03.txt AC 72 ms 22612 KB
subtask1_01.txt AC 101 ms 20820 KB
subtask1_02.txt AC 108 ms 19156 KB
subtask1_03.txt AC 108 ms 19796 KB
subtask1_04.txt AC 129 ms 21460 KB
subtask1_05.txt AC 102 ms 20948 KB
subtask1_06.txt AC 116 ms 21716 KB
subtask1_07.txt AC 96 ms 19668 KB
subtask1_08.txt AC 85 ms 21460 KB
subtask1_09.txt AC 131 ms 19924 KB
subtask1_10.txt AC 135 ms 20692 KB
subtask1_11.txt AC 135 ms 21460 KB
subtask1_12.txt AC 142 ms 20308 KB
subtask1_13.txt AC 137 ms 21972 KB
subtask1_14.txt AC 135 ms 17108 KB
subtask2_01.txt AC 215 ms 24276 KB
subtask2_02.txt AC 836 ms 28856 KB
subtask2_03.txt AC 506 ms 26624 KB
subtask2_04.txt AC 757 ms 29656 KB
subtask2_05.txt AC 3656 ms 32152 KB
subtask2_06.txt AC 2986 ms 30944 KB
subtask2_07.txt AC 463 ms 25460 KB
subtask2_08.txt AC 973 ms 28328 KB
subtask2_09.txt AC 3016 ms 27820 KB
subtask2_10.txt TLE 4209 ms 38988 KB
subtask2_11.txt TLE 4209 ms 35328 KB
subtask2_12.txt TLE 4209 ms 37272 KB
subtask2_13.txt TLE 4209 ms 36924 KB
subtask2_14.txt TLE 4205 ms 37328 KB
subtask2_15.txt TLE 4205 ms 36004 KB
subtask2_16.txt TLE 4205 ms 37016 KB
subtask2_17.txt TLE 4209 ms 35056 KB
subtask2_18.txt TLE 4206 ms 36584 KB
subtask2_19.txt TLE 4209 ms 35572 KB
subtask2_20.txt TLE 4205 ms 35912 KB
subtask2_21.txt TLE 4209 ms 35608 KB
subtask2_22.txt TLE 4205 ms 35608 KB
subtask2_23.txt TLE 4209 ms 36736 KB
subtask2_24.txt TLE 4205 ms 37492 KB
subtask2_25.txt TLE 4209 ms 35512 KB
subtask2_26.txt TLE 4209 ms 34600 KB
subtask2_27.txt TLE 4205 ms 34240 KB
subtask2_28.txt TLE 4205 ms 37184 KB
subtask2_29.txt TLE 4209 ms 33740 KB
subtask2_30.txt AC 3151 ms 35240 KB
subtask2_31.txt AC 3439 ms 36432 KB