結果

問題 No.849 yuki国の分割統治
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-07-06 00:04:21
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,013 bytes
コンパイル時間 2,888 ms
コンパイル使用メモリ 91,156 KB
実行使用メモリ 68,616 KB
最終ジャッジ日時 2024-04-16 08:17:17
合計ジャッジ時間 16,347 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 102 ms
53,140 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 103 ms
53,044 KB
testcase_04 AC 102 ms
53,168 KB
testcase_05 WA -
testcase_06 AC 102 ms
52,972 KB
testcase_07 AC 532 ms
65,844 KB
testcase_08 AC 542 ms
66,848 KB
testcase_09 AC 507 ms
65,540 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 534 ms
66,036 KB
testcase_13 AC 564 ms
67,056 KB
testcase_14 WA -
testcase_15 AC 493 ms
66,016 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 493 ms
65,576 KB
testcase_22 AC 579 ms
68,616 KB
testcase_23 AC 595 ms
68,488 KB
testcase_24 AC 547 ms
65,476 KB
testcase_25 WA -
testcase_26 AC 100 ms
53,132 KB
testcase_27 AC 100 ms
53,148 KB
testcase_28 AC 102 ms
53,136 KB
testcase_29 AC 102 ms
53,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.HashSet;
import java.util.Set;

public class Main {

  private static void solve() {

    long a = nl();
    long b = nl();
    long c = nl();
    long d = nl();

    int n = ni();
    long[][] p = new long[n][2];

    for (int i = 0; i < n; i++) {
      p[i] = new long[] {nl(), nl()};
    }

    long det = a * d - b * c;
    Set<String> set = new HashSet<>();
    if (det == 0) {
      long g = gcd(a, c);
      //b/a * g

      if (g != 0) {
        for (long[] v : p) {
          long x = v[0] % g;
          long y = v[1] * a - v[0] * b;
          set.add(x + ":" + y);
        }
      } else {
        g = gcd(b, d);
        for (long[] v : p) {
          long x = v[0] * b - v[1] * a;
          long y = v[1] % g;
          set.add(x + ":" + y);
        }
      }
      System.out.println(set.size());
    } else {

      for (long[] v : p) {

        long s = v[0] * d  - v[1] * c;
        long t = -v[0] * b + v[1] * a;

        long s2 = s % det;
        long t2 = t % det;
        if (s2 < 0) s2 += det;
        if (t2 < 0) t2 += det;
        
        long v0 = (a * s2 + c * t2) / det;
        long v1 = (b * s2 + d * t2) / det;
        set.add(v0 + ":" + v1);
        

      }
      System.out.println(set.size());
    }
  }

  public static long invl(long a, long mod) {
    long b = mod;
    long p = 1, q = 0;
    while (b > 0) {
      long c = a / b;
      long d;
      d = a;
      a = b;
      b = d % b;
      d = p;
      p = q;
      q = d - c * q;
    }
    return p < 0 ? p + mod : p;
  }


  public static long gcd(long a, long b) {
    while (b > 0) {
      long c = a;
      a = b;
      b = c % b;
    }
    return a;
  }


  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