結果

問題 No.1059 素敵な集合
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-05-23 09:53:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 193 ms / 2,000 ms
コード長 3,472 bytes
コンパイル時間 2,691 ms
コンパイル使用メモリ 89,608 KB
実行使用メモリ 59,904 KB
最終ジャッジ日時 2024-07-23 09:37:31
合計ジャッジ時間 6,573 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
51,192 KB
testcase_01 AC 149 ms
52,532 KB
testcase_02 AC 144 ms
55,968 KB
testcase_03 AC 82 ms
51,100 KB
testcase_04 AC 81 ms
51,304 KB
testcase_05 AC 82 ms
51,476 KB
testcase_06 AC 142 ms
55,116 KB
testcase_07 AC 135 ms
53,244 KB
testcase_08 AC 152 ms
55,420 KB
testcase_09 AC 128 ms
53,208 KB
testcase_10 AC 151 ms
55,420 KB
testcase_11 AC 144 ms
56,168 KB
testcase_12 AC 133 ms
52,988 KB
testcase_13 AC 163 ms
55,292 KB
testcase_14 AC 87 ms
51,204 KB
testcase_15 AC 177 ms
56,452 KB
testcase_16 AC 131 ms
55,076 KB
testcase_17 AC 150 ms
55,620 KB
testcase_18 AC 147 ms
59,904 KB
testcase_19 AC 179 ms
52,852 KB
testcase_20 AC 193 ms
55,368 KB
testcase_21 AC 178 ms
55,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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


class DJSet {
  public int[] upper;

  public DJSet(int n) {
    upper = new int[n];
    Arrays.fill(upper, -1);
  }

  public int root(int x) {
    return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
  }

  public boolean equiv(int x, int y) {
    return root(x) == root(y);
  }

  public boolean union(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      if (upper[y] < upper[x]) {
        int d = x;
        x = y;
        y = d;
      }
      upper[x] += upper[y];
      upper[y] = x;
    }
    return x == y;
  }

  public int count() {
    int ct = 0;
    for (int u : upper)
      if (u < 0)
        ct++;
    return ct;
  }
}


public class Main {

  private static void solve() {
    int l = ni();
    int r = ni();

    DJSet ds = new DJSet(r + 1);
    for (int i = l; i <= r; i++) {
      for (int j = i + i; j <= r; j += i) {
        ds.union(i, j);
      }
    }

    Set<Integer> set = new HashSet<>();
    for (int i = l; i <= r; i++) {
      set.add(ds.root(i));
    }
    System.out.println(set.size() - 1);
  }



  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