結果

問題 No.1293 2種類の道路
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-11-21 18:34:47
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,874 bytes
コンパイル時間 3,577 ms
コンパイル使用メモリ 92,864 KB
実行使用メモリ 94,868 KB
最終ジャッジ日時 2024-07-23 15:57:00
合計ジャッジ時間 12,570 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 82 ms
51,444 KB
testcase_01 AC 82 ms
51,404 KB
testcase_02 AC 80 ms
51,188 KB
testcase_03 AC 80 ms
51,228 KB
testcase_04 WA -
testcase_05 AC 81 ms
51,252 KB
testcase_06 AC 81 ms
51,168 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 526 ms
84,436 KB
testcase_15 AC 533 ms
84,224 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

class DisjointSet {
  public int[] upper; // minus:num_element(root) plus:root(normal)
  // public int[] w;

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

  public DisjointSet(DisjointSet ds) {
    this.upper = Arrays.copyOf(ds.upper, ds.upper.length);
  }

  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;
      }
      // w[x] += w[y];
      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 int[][] toBucket() {
    int n = upper.length;
    int[][] ret = new int[n][];
    int[] rp = new int[n];
    for (int i = 0; i < n; i++) {
      if (upper[i] < 0)
        ret[i] = new int[-upper[i]];
    }
    for (int i = 0; i < n; i++) {
      int r = root(i);
      ret[r][rp[r]++] = i;
    }
    return ret;
  }
}

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    int d = ni();
    int w = ni();
    DisjointSet ds1 = new DisjointSet(n);
    for (int i = 0; i < d; i++) {
      ds1.union(ni() - 1, ni() - 1);
    }

    List<Set<Integer>> list = new ArrayList<>();
    for (int i = 0; i < n; i++) {
      Set<Integer> set = new HashSet<>();
      set.add(ds1.root(i));
      list.add(set);
    }

    DisjointSet ds2 = new DisjointSet(n);
    for (int i = 0; i < w; i++) {
      int a = ds2.root(ni() - 1);
      int b = ds2.root(ni() - 1);

      var set1 = list.get(a);
      var set2 = list.get(b);
      list.set(a, null);
      list.set(b, null);

      if (ds2.union(a, b)) {
        continue;
      }
      if (set1.size() < set2.size()) {
        var tmp = set1;
        set1 = set2;
        set2 = tmp;
      }
      for (int v : set2) {
        set1.add(v);
      }
      list.set(ds2.root(a), set1);
    }

    long ret = 0;
    int[][] buc1 = ds1.toBucket();
    int[][] buc2 = ds2.toBucket();

    for (int[] b : buc2) {
      if (b == null)
        continue;
      long x = 0;
      for (int root : list.get(ds2.root(b[0]))) {
        x += buc1[root].length;
      }
      ret += (x - 1) * b.length;
    }
    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 = 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