Submission #1731962
Source Code Expand
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); long[] s = nal(2); int d = 3000; int m = n + d; long[][] q = new long[m][2]; for (int i = 0; i < m; i ++) { if (i < n) { q[i][0] = ni(); q[i][1] = ni(); } else { q[i][0] = 100000000; q[i][1] = 100000000; } } long[] a = new long[d]; int ret = 0; for (int i = 0; i < n - 1; i ++) { for (int j = i + 1; j < n; j += d) { int to = Math.min(n, j + d) - j; for (int k = 0; k < to; k ++) { a[k] = (q[i][0] - q[j + k][0]) * (q[i][1] - q[j + k][1]); } Arrays.sort(a, 0, to); int b1 = Arrays.binarySearch(a, 0, to, s[0]); int b2 = Arrays.binarySearch(a, 0, to, s[1] + 1); if (b1 < 0) b1 = -b1 - 1; if (b2 < 0) b2 = -b2 - 1; ret += b2 - b1; } } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = System.getProperty("debug"); if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } 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 | 3462 Byte |
Status | TLE |
Exec Time | 4210 ms |
Memory | 277092 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 10 / 10 | 0 / 90 | ||||||||
Status |
|
|
|
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 | 72 ms | 23380 KB |
sample_02.txt | AC | 72 ms | 23124 KB |
sample_03.txt | AC | 72 ms | 18388 KB |
subtask1_01.txt | AC | 305 ms | 27928 KB |
subtask1_02.txt | AC | 367 ms | 21992 KB |
subtask1_03.txt | AC | 403 ms | 24656 KB |
subtask1_04.txt | AC | 436 ms | 25312 KB |
subtask1_05.txt | AC | 245 ms | 26916 KB |
subtask1_06.txt | AC | 349 ms | 27072 KB |
subtask1_07.txt | AC | 182 ms | 21404 KB |
subtask1_08.txt | AC | 79 ms | 20564 KB |
subtask1_09.txt | AC | 448 ms | 25312 KB |
subtask1_10.txt | AC | 473 ms | 28992 KB |
subtask1_11.txt | AC | 482 ms | 29728 KB |
subtask1_12.txt | AC | 515 ms | 26084 KB |
subtask1_13.txt | AC | 545 ms | 25468 KB |
subtask1_14.txt | AC | 487 ms | 27552 KB |
subtask2_01.txt | AC | 896 ms | 29128 KB |
subtask2_02.txt | TLE | 4209 ms | 35820 KB |
subtask2_03.txt | AC | 2962 ms | 32400 KB |
subtask2_04.txt | TLE | 4209 ms | 35840 KB |
subtask2_05.txt | TLE | 4209 ms | 40188 KB |
subtask2_06.txt | TLE | 4205 ms | 46016 KB |
subtask2_07.txt | AC | 2616 ms | 33132 KB |
subtask2_08.txt | TLE | 4209 ms | 38448 KB |
subtask2_09.txt | TLE | 4209 ms | 45996 KB |
subtask2_10.txt | TLE | 4209 ms | 42224 KB |
subtask2_11.txt | TLE | 4209 ms | 43984 KB |
subtask2_12.txt | TLE | 4209 ms | 45336 KB |
subtask2_13.txt | TLE | 4209 ms | 46876 KB |
subtask2_14.txt | TLE | 4205 ms | 45136 KB |
subtask2_15.txt | TLE | 4209 ms | 45532 KB |
subtask2_16.txt | TLE | 4205 ms | 45700 KB |
subtask2_17.txt | TLE | 4209 ms | 46832 KB |
subtask2_18.txt | TLE | 4209 ms | 42552 KB |
subtask2_19.txt | TLE | 4205 ms | 43028 KB |
subtask2_20.txt | TLE | 4209 ms | 41128 KB |
subtask2_21.txt | TLE | 4209 ms | 41444 KB |
subtask2_22.txt | TLE | 4205 ms | 46340 KB |
subtask2_23.txt | TLE | 4209 ms | 46536 KB |
subtask2_24.txt | TLE | 4209 ms | 46180 KB |
subtask2_25.txt | TLE | 4209 ms | 46860 KB |
subtask2_26.txt | TLE | 4209 ms | 45272 KB |
subtask2_27.txt | TLE | 4209 ms | 44596 KB |
subtask2_28.txt | TLE | 4205 ms | 46528 KB |
subtask2_29.txt | TLE | 4209 ms | 43480 KB |
subtask2_30.txt | TLE | 4210 ms | 277092 KB |
subtask2_31.txt | TLE | 4209 ms | 47084 KB |