結果

問題 No.947 ABC包囲網
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-12-12 04:51:40
言語 Java19
(openjdk 21)
結果
AC  
実行時間 571 ms / 2,000 ms
コード長 3,451 bytes
コンパイル時間 4,263 ms
コンパイル使用メモリ 84,308 KB
実行使用メモリ 54,872 KB
最終ジャッジ日時 2023-09-06 14:03:36
合計ジャッジ時間 21,387 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
50,808 KB
testcase_01 AC 70 ms
50,836 KB
testcase_02 AC 68 ms
50,664 KB
testcase_03 AC 69 ms
50,968 KB
testcase_04 AC 69 ms
50,812 KB
testcase_05 AC 70 ms
50,824 KB
testcase_06 AC 71 ms
50,872 KB
testcase_07 AC 69 ms
50,704 KB
testcase_08 AC 69 ms
50,876 KB
testcase_09 AC 69 ms
50,808 KB
testcase_10 AC 69 ms
50,696 KB
testcase_11 AC 70 ms
51,012 KB
testcase_12 AC 71 ms
50,828 KB
testcase_13 AC 69 ms
50,992 KB
testcase_14 AC 69 ms
50,844 KB
testcase_15 AC 94 ms
51,596 KB
testcase_16 AC 87 ms
51,576 KB
testcase_17 AC 85 ms
52,040 KB
testcase_18 AC 91 ms
51,696 KB
testcase_19 AC 93 ms
51,876 KB
testcase_20 AC 92 ms
51,436 KB
testcase_21 AC 97 ms
51,552 KB
testcase_22 AC 91 ms
51,552 KB
testcase_23 AC 89 ms
51,236 KB
testcase_24 AC 89 ms
51,440 KB
testcase_25 AC 90 ms
51,412 KB
testcase_26 AC 90 ms
51,268 KB
testcase_27 AC 88 ms
51,460 KB
testcase_28 AC 486 ms
53,992 KB
testcase_29 AC 552 ms
53,448 KB
testcase_30 AC 467 ms
53,836 KB
testcase_31 AC 559 ms
54,220 KB
testcase_32 AC 559 ms
54,808 KB
testcase_33 AC 565 ms
54,516 KB
testcase_34 AC 538 ms
54,132 KB
testcase_35 AC 547 ms
54,676 KB
testcase_36 AC 547 ms
54,416 KB
testcase_37 AC 571 ms
54,308 KB
testcase_38 AC 553 ms
54,240 KB
testcase_39 AC 561 ms
54,152 KB
testcase_40 AC 545 ms
54,716 KB
testcase_41 AC 543 ms
54,216 KB
testcase_42 AC 551 ms
53,936 KB
testcase_43 AC 506 ms
54,872 KB
testcase_44 AC 554 ms
54,184 KB
testcase_45 AC 548 ms
54,384 KB
testcase_46 AC 544 ms
54,084 KB
testcase_47 AC 555 ms
54,680 KB
testcase_48 AC 549 ms
54,828 KB
testcase_49 AC 555 ms
53,752 KB
testcase_50 AC 549 ms
53,772 KB
testcase_51 AC 80 ms
52,264 KB
testcase_52 AC 79 ms
52,540 KB
testcase_53 AC 78 ms
52,392 KB
testcase_54 AC 71 ms
50,984 KB
testcase_55 AC 70 ms
50,808 KB
testcase_56 AC 70 ms
50,712 KB
testcase_57 AC 91 ms
51,760 KB
testcase_58 AC 93 ms
51,464 KB
testcase_59 AC 92 ms
51,684 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.Arrays;

public class Main {

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

    double[] theta1 = new double[n];
    double[] theta2 = new double[n];
    for (int i = 0; i < n; i++) {
      theta1[i] = theta2[i] = Math.atan2(p[i][1], p[i][0]) + Math.PI;
      theta2[i] += Math.PI * 2;

    }

    Arrays.sort(theta1);
    Arrays.sort(theta2);
    long ret = 0;

    double eps = 0.000000000001;
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        double s = theta1[i];
        double t = theta1[j];

        if (t - s + eps >= Math.PI) {
          break;
        }
        int x = lowerBound(theta2, Math.PI + s + eps, i);
        int y = lowerBound(theta2, Math.PI + t - eps, i);
        ret += Math.max(0, y - x);

      }
    }
    System.out.println(ret);
  }

  public static int lowerBound(double[] a, double v, int to) {
    int low = -1, high = to;
    while (high - low > 1) {
      int h = high + low >>> 1;
      if (a[h] >= v) {
        high = h;
      } else {
        low = h;
      }
    }
    return high;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        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));
  }
}

0