結果

問題 No.5004 Room Assignment
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-01 02:01:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 541 ms / 5,000 ms
コード長 5,329 bytes
コンパイル時間 2,679 ms
実行使用メモリ 59,948 KB
スコア 121,754,601
平均クエリ数 7622.82
最終ジャッジ日時 2021-12-01 02:02:07
合計ジャッジ時間 59,903 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 498 ms
56,596 KB
testcase_01 AC 489 ms
57,624 KB
testcase_02 AC 524 ms
57,568 KB
testcase_03 AC 506 ms
57,324 KB
testcase_04 AC 486 ms
56,500 KB
testcase_05 AC 509 ms
58,052 KB
testcase_06 AC 502 ms
56,872 KB
testcase_07 AC 484 ms
57,488 KB
testcase_08 AC 532 ms
58,756 KB
testcase_09 AC 497 ms
56,660 KB
testcase_10 AC 507 ms
57,336 KB
testcase_11 AC 531 ms
56,956 KB
testcase_12 AC 472 ms
57,192 KB
testcase_13 AC 497 ms
57,216 KB
testcase_14 AC 527 ms
57,148 KB
testcase_15 AC 495 ms
57,632 KB
testcase_16 AC 490 ms
56,672 KB
testcase_17 AC 510 ms
57,320 KB
testcase_18 AC 483 ms
56,844 KB
testcase_19 AC 496 ms
58,136 KB
testcase_20 AC 527 ms
56,368 KB
testcase_21 AC 506 ms
57,120 KB
testcase_22 AC 500 ms
56,940 KB
testcase_23 AC 512 ms
56,888 KB
testcase_24 AC 512 ms
57,468 KB
testcase_25 AC 482 ms
56,960 KB
testcase_26 AC 521 ms
57,972 KB
testcase_27 AC 492 ms
56,708 KB
testcase_28 AC 476 ms
56,380 KB
testcase_29 AC 522 ms
56,728 KB
testcase_30 AC 484 ms
56,796 KB
testcase_31 AC 502 ms
57,748 KB
testcase_32 AC 520 ms
56,596 KB
testcase_33 AC 491 ms
59,004 KB
testcase_34 AC 499 ms
57,384 KB
testcase_35 AC 539 ms
57,836 KB
testcase_36 AC 498 ms
57,152 KB
testcase_37 AC 500 ms
57,360 KB
testcase_38 AC 510 ms
57,004 KB
testcase_39 AC 504 ms
56,844 KB
testcase_40 AC 478 ms
56,496 KB
testcase_41 AC 521 ms
59,948 KB
testcase_42 AC 488 ms
57,076 KB
testcase_43 AC 484 ms
59,116 KB
testcase_44 AC 529 ms
57,624 KB
testcase_45 AC 502 ms
56,840 KB
testcase_46 AC 486 ms
56,932 KB
testcase_47 AC 527 ms
57,748 KB
testcase_48 AC 476 ms
56,772 KB
testcase_49 AC 489 ms
56,656 KB
testcase_50 AC 537 ms
56,468 KB
testcase_51 AC 506 ms
57,180 KB
testcase_52 AC 493 ms
56,416 KB
testcase_53 AC 541 ms
56,700 KB
testcase_54 AC 486 ms
56,648 KB
testcase_55 AC 478 ms
57,528 KB
testcase_56 AC 530 ms
56,884 KB
testcase_57 AC 485 ms
56,956 KB
testcase_58 AC 502 ms
57,096 KB
testcase_59 AC 510 ms
56,944 KB
testcase_60 AC 497 ms
57,664 KB
testcase_61 AC 505 ms
57,756 KB
testcase_62 AC 518 ms
57,372 KB
testcase_63 AC 508 ms
57,672 KB
testcase_64 AC 504 ms
57,908 KB
testcase_65 AC 527 ms
58,100 KB
testcase_66 AC 478 ms
57,876 KB
testcase_67 AC 495 ms
56,664 KB
testcase_68 AC 517 ms
57,520 KB
testcase_69 AC 488 ms
56,572 KB
testcase_70 AC 506 ms
57,812 KB
testcase_71 AC 537 ms
57,920 KB
testcase_72 AC 486 ms
58,104 KB
testcase_73 AC 498 ms
58,676 KB
testcase_74 AC 531 ms
56,780 KB
testcase_75 AC 481 ms
56,564 KB
testcase_76 AC 489 ms
56,540 KB
testcase_77 AC 521 ms
56,724 KB
testcase_78 AC 502 ms
56,860 KB
testcase_79 AC 508 ms
57,708 KB
testcase_80 AC 530 ms
57,028 KB
testcase_81 AC 519 ms
58,164 KB
testcase_82 AC 499 ms
57,372 KB
testcase_83 AC 502 ms
58,272 KB
testcase_84 AC 496 ms
56,976 KB
testcase_85 AC 509 ms
56,676 KB
testcase_86 AC 482 ms
56,884 KB
testcase_87 AC 510 ms
57,176 KB
testcase_88 AC 522 ms
57,248 KB
testcase_89 AC 502 ms
57,796 KB
testcase_90 AC 510 ms
57,012 KB
testcase_91 AC 509 ms
56,688 KB
testcase_92 AC 504 ms
57,344 KB
testcase_93 AC 505 ms
56,688 KB
testcase_94 AC 531 ms
56,828 KB
testcase_95 AC 506 ms
56,640 KB
testcase_96 AC 521 ms
57,228 KB
testcase_97 AC 504 ms
57,660 KB
testcase_98 AC 494 ms
56,828 KB
testcase_99 AC 504 ms
57,156 KB
権限があれば一括ダウンロードができます

ソースコード

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 t = ni();
    int r = ni();
    int max = 6000;

    int[][] s = new int[max][3];
    int n = 0;

    int buc = 40;
    int m = 4;
    Set<int[]> list = new HashSet<>();
    for (int i = 0; i < t; i++) {
      for (int v : ask()) {
        s[n][0] = n;
        s[n][1] = v;
        s[n][2] = i;

        list.add(s[n]);
        n++;
      }

      if (list.size() >= buc) {
        int[][] ret = pick(list);
        int[] u = ret[0];
        int[] v = ret[1];
        ans(m - 1, u, v);
      } else {
        ans(0, null, null);
      }
    }
  }

  private static int[][] pick(Set<int[]> set) {
    List<int[]> list = new ArrayList<>(set);
    Collections.sort(list, (a, b) -> a[1] - b[1]);
    int min = Integer.MAX_VALUE;
    int minArg = -1;

    int m = 4;
    for (int i = 0; i <= list.size() - m; i++) {
      int a = list.get(i)[1];
      int b = list.get(i + m - 1)[1];

      if (b - a < min) {
        min = b - a;
        minArg = i;
      }
    }
    int[][] ret = new int[m][];
    for (int i = 0; i < m; i++) {
      ret[i] = list.get(minArg + i);
    }

    System.err.println(min);

    // remove from list
    for (int i = 0; i < m; i++) {
      set.remove(ret[i]);
    }

    int[] u = new int[m - 1];
    int[] v = new int[m - 1];
    for (int j = 0; j < m - 1; j++) {
      u[j] = ret[j][0];
      v[j] = ret[j + 1][0];
    }
    return new int[][] { u, v };
  }

  private static int[] ask() {
    int n = ni();
    int[] s = na(n);
    return s;
  }

  private static void ans(int m, int[] u, int[] v) {
    out.println(m);
    for (int i = 0; i < m; i++) {
      out.println((u[i] + 1) + " " + (v[i] + 1));
    }
    out.flush();
  }

  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