結果

問題 No.1170 Never Want to Walk
ユーザー hiromi_ayase
提出日時 2020-08-15 04:16:11
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 4,225 bytes
コンパイル時間 2,503 ms
コンパイル使用メモリ 89,800 KB
実行使用メモリ 58,188 KB
最終ジャッジ日時 2024-10-10 17:09:59
合計ジャッジ時間 12,411 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 30 TLE * 1 -- * 6
権限があれば一括ダウンロードができます

ソースコード

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);
}
}
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));
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0