Submission #1731919

---

Source Code Expand

import java.util.Arrays;

public class Main {

  private static void solve() {
    int n = ni();
    long[] s = nal(2);
    
    int d = 20;
    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) {
        a[0] = (q[i][0] - q[j + 0][0]) * (q[i][1] - q[j + 0][1]);
        a[1] = (q[i][0] - q[j + 1][0]) * (q[i][1] - q[j + 1][1]);
        a[2] = (q[i][0] - q[j + 2][0]) * (q[i][1] - q[j + 2][1]);
        a[3] = (q[i][0] - q[j + 3][0]) * (q[i][1] - q[j + 3][1]);
        a[4] = (q[i][0] - q[j + 4][0]) * (q[i][1] - q[j + 4][1]);
        a[5] = (q[i][0] - q[j + 5][0]) * (q[i][1] - q[j + 5][1]);
        a[6] = (q[i][0] - q[j + 6][0]) * (q[i][1] - q[j + 6][1]);
        a[7] = (q[i][0] - q[j + 7][0]) * (q[i][1] - q[j + 7][1]);
        a[8] = (q[i][0] - q[j + 8][0]) * (q[i][1] - q[j + 8][1]);
        a[9] = (q[i][0] - q[j + 9][0]) * (q[i][1] - q[j + 9][1]);
        a[10] = (q[i][0] - q[j + 10][0]) * (q[i][1] - q[j + 10][1]);
        a[11] = (q[i][0] - q[j + 11][0]) * (q[i][1] - q[j + 11][1]);
        a[12] = (q[i][0] - q[j + 12][0]) * (q[i][1] - q[j + 12][1]);
        a[13] = (q[i][0] - q[j + 13][0]) * (q[i][1] - q[j + 13][1]);
        a[14] = (q[i][0] - q[j + 14][0]) * (q[i][1] - q[j + 14][1]);
        a[15] = (q[i][0] - q[j + 15][0]) * (q[i][1] - q[j + 15][1]);
        a[16] = (q[i][0] - q[j + 16][0]) * (q[i][1] - q[j + 16][1]);
        a[17] = (q[i][0] - q[j + 17][0]) * (q[i][1] - q[j + 17][1]);
        a[18] = (q[i][0] - q[j + 18][0]) * (q[i][1] - q[j + 18][1]);
        a[19] = (q[i][0] - q[j + 19][0]) * (q[i][1] - q[j + 19][1]);
        
        Arrays.sort(a);
        int b1 = Arrays.binarySearch(a, s[0]);
        int b2 = Arrays.binarySearch(a, 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

Judge Result