結果

問題 No.1170 Never Want to Walk
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-08-15 04:18:36
言語 Java21
(openjdk 21)
結果
AC  
実行時間 536 ms / 2,000 ms
コード長 4,255 bytes
コンパイル時間 2,479 ms
コンパイル使用メモリ 90,536 KB
実行使用メモリ 56,456 KB
最終ジャッジ日時 2024-10-10 17:10:20
合計ジャッジ時間 13,273 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
38,272 KB
testcase_01 AC 78 ms
38,080 KB
testcase_02 AC 77 ms
37,932 KB
testcase_03 AC 77 ms
38,080 KB
testcase_04 AC 76 ms
37,932 KB
testcase_05 AC 77 ms
38,256 KB
testcase_06 AC 77 ms
38,228 KB
testcase_07 AC 77 ms
38,160 KB
testcase_08 AC 74 ms
38,072 KB
testcase_09 AC 74 ms
38,228 KB
testcase_10 AC 76 ms
38,180 KB
testcase_11 AC 75 ms
37,932 KB
testcase_12 AC 102 ms
39,184 KB
testcase_13 AC 101 ms
39,176 KB
testcase_14 AC 98 ms
39,188 KB
testcase_15 AC 99 ms
39,192 KB
testcase_16 AC 101 ms
39,076 KB
testcase_17 AC 103 ms
39,088 KB
testcase_18 AC 102 ms
38,916 KB
testcase_19 AC 101 ms
38,828 KB
testcase_20 AC 102 ms
39,104 KB
testcase_21 AC 100 ms
39,028 KB
testcase_22 AC 101 ms
38,972 KB
testcase_23 AC 100 ms
38,744 KB
testcase_24 AC 102 ms
39,056 KB
testcase_25 AC 101 ms
38,848 KB
testcase_26 AC 100 ms
38,812 KB
testcase_27 AC 503 ms
56,404 KB
testcase_28 AC 526 ms
56,404 KB
testcase_29 AC 530 ms
56,000 KB
testcase_30 AC 516 ms
56,264 KB
testcase_31 AC 507 ms
55,832 KB
testcase_32 AC 536 ms
56,456 KB
testcase_33 AC 510 ms
56,168 KB
testcase_34 AC 509 ms
56,436 KB
testcase_35 AC 532 ms
56,328 KB
testcase_36 AC 501 ms
56,128 KB
testcase_37 AC 508 ms
56,032 KB
testcase_38 AC 506 ms
56,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {

  static 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;
    }
  }

  private static void solve() {
    int n = ni();
    int a = ni();
    int b = ni();
    int[] x = na(n);

    int l = 0;
    int r = 0;
    DisjointSet ds = new DisjointSet(n);
    for (int i = 0; i < n; i++) {
      while (l < n && x[i] + a > x[l]) {
        l++;
      }
      while (r < n && x[i] + b >= x[r]) {
        r++;
      }

      for (int j = l; j < r; j++) {
        ds.union(i, j);
      }
      l = Math.max(l, r - 1);
    }

    for (int i = 0; i < n; i++) {
      out.println(-ds.upper[ds.root(i)]);
    }
  }

  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