結果

問題 No.1170 Never Want to Walk
ユーザー tentententen
提出日時 2023-02-01 15:17:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 581 ms / 2,000 ms
コード長 3,874 bytes
コンパイル時間 2,485 ms
コンパイル使用メモリ 88,572 KB
実行使用メモリ 67,612 KB
最終ジャッジ日時 2024-07-01 10:43:06
合計ジャッジ時間 12,552 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,368 KB
testcase_01 AC 54 ms
50,380 KB
testcase_02 AC 54 ms
50,464 KB
testcase_03 AC 54 ms
50,548 KB
testcase_04 AC 55 ms
50,148 KB
testcase_05 AC 57 ms
50,380 KB
testcase_06 AC 55 ms
50,608 KB
testcase_07 AC 54 ms
50,496 KB
testcase_08 AC 55 ms
50,352 KB
testcase_09 AC 55 ms
50,536 KB
testcase_10 AC 54 ms
50,416 KB
testcase_11 AC 56 ms
50,408 KB
testcase_12 AC 65 ms
50,724 KB
testcase_13 AC 65 ms
50,604 KB
testcase_14 AC 66 ms
50,612 KB
testcase_15 AC 63 ms
50,176 KB
testcase_16 AC 67 ms
50,728 KB
testcase_17 AC 67 ms
50,952 KB
testcase_18 AC 65 ms
50,288 KB
testcase_19 AC 67 ms
50,416 KB
testcase_20 AC 75 ms
50,540 KB
testcase_21 AC 64 ms
50,344 KB
testcase_22 AC 64 ms
50,572 KB
testcase_23 AC 67 ms
50,504 KB
testcase_24 AC 76 ms
50,388 KB
testcase_25 AC 65 ms
50,572 KB
testcase_26 AC 64 ms
50,496 KB
testcase_27 AC 429 ms
63,104 KB
testcase_28 AC 555 ms
65,344 KB
testcase_29 AC 530 ms
65,360 KB
testcase_30 AC 449 ms
63,476 KB
testcase_31 AC 479 ms
63,548 KB
testcase_32 AC 539 ms
67,612 KB
testcase_33 AC 453 ms
66,104 KB
testcase_34 AC 470 ms
63,828 KB
testcase_35 AC 448 ms
65,212 KB
testcase_36 AC 471 ms
64,432 KB
testcase_37 AC 458 ms
64,184 KB
testcase_38 AC 581 ms
66,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();
        int[] points = new int[n];
        for (int i = 0; i < n; i++) {
            points[i] = sc.nextInt();
        }
        int[] imos = new int[n];
        UnionFindTree uft = new UnionFindTree(n);
        for (int i = 0; i < n - 1; i++) {
            int left1 = i;
            int right1 = n;
            while (right1 - left1 > 1) {
                int m = (left1 + right1) / 2;
                if (points[m] - points[i] < a) {
                    left1 = m;
                } else {
                    right1 = m;
                }
            }
            int left2 = i;
            int right2 = n;
            while (right2 - left2 > 1) {
                int m = (left2 + right2) / 2;
                if (points[m] - points[i] <= b) {
                    left2 = m;
                } else {
                    right2 = m;
                }
            }
            if (right1 > left2) {
                continue;
            }
            imos[right1]++;
            imos[left2]--;
            uft.unite(i, right1);
        }
        for (int i = 1; i < n - 1; i++) {
            imos[i] += imos[i - 1];
            if (imos[i] > 0) {
                uft.unite(i, i + 1);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            sb.append(uft.getCount(i)).append("\n");
        }
        System.out.print(sb);
    }
    
    static class UnionFindTree {
        int[] parents;
        int[] counts;
        
        public UnionFindTree(int size) {
            parents = new int[size];
            counts = new int[size];
            for (int i = 0; i < size; i++) {
                parents[i] = i;
                counts[i] = 1;
            }
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public void unite(int x, int y) {
            int xx = find(x);
            int yy = find(y);
            if (xx != yy) {
                parents[xx] = yy;
                counts[yy] += counts[xx];
            }
        }
        
        public int getCount(int x) {
            return counts[find(x)];
        }
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
0