結果
問題 | No.1170 Never Want to Walk |
ユーザー |
![]() |
提出日時 | 2021-11-24 15:54:49 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,085 bytes |
コンパイル時間 | 2,471 ms |
コンパイル使用メモリ | 78,592 KB |
実行使用メモリ | 68,816 KB |
最終ジャッジ日時 | 2024-06-27 01:17:48 |
合計ジャッジ時間 | 12,199 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
57,152 KB |
testcase_01 | AC | 55 ms
50,284 KB |
testcase_02 | AC | 57 ms
49,860 KB |
testcase_03 | AC | 56 ms
50,468 KB |
testcase_04 | AC | 56 ms
50,244 KB |
testcase_05 | AC | 54 ms
50,208 KB |
testcase_06 | AC | 56 ms
50,224 KB |
testcase_07 | AC | 55 ms
49,752 KB |
testcase_08 | AC | 56 ms
50,328 KB |
testcase_09 | AC | 56 ms
49,840 KB |
testcase_10 | AC | 57 ms
50,340 KB |
testcase_11 | AC | 56 ms
50,312 KB |
testcase_12 | AC | 68 ms
50,348 KB |
testcase_13 | AC | 77 ms
50,604 KB |
testcase_14 | AC | 70 ms
50,324 KB |
testcase_15 | AC | 68 ms
50,792 KB |
testcase_16 | AC | 67 ms
50,276 KB |
testcase_17 | AC | 68 ms
50,864 KB |
testcase_18 | AC | 67 ms
49,848 KB |
testcase_19 | AC | 70 ms
50,556 KB |
testcase_20 | AC | 77 ms
50,576 KB |
testcase_21 | AC | 66 ms
50,572 KB |
testcase_22 | AC | 106 ms
51,676 KB |
testcase_23 | AC | 93 ms
51,500 KB |
testcase_24 | AC | 108 ms
51,360 KB |
testcase_25 | AC | 103 ms
51,788 KB |
testcase_26 | AC | 100 ms
51,488 KB |
testcase_27 | AC | 425 ms
63,428 KB |
testcase_28 | AC | 410 ms
62,656 KB |
testcase_29 | AC | 416 ms
62,696 KB |
testcase_30 | AC | 415 ms
62,472 KB |
testcase_31 | AC | 402 ms
63,200 KB |
testcase_32 | TLE | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
ソースコード
import java.io.*; import java.util.*; 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[] values = new int[n + 1]; for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); } values[n] = Integer.MAX_VALUE; UnionFindTree uft = new UnionFindTree(n); int left = 0; int right = 0; for (int i = 0; i < n; i++) { while (values[left] - values[i] < a) { left++; } while (values[right] - values[i] <= b) { right++; } for (int j = left; j < right; j++) { uft.unite(i, j); } } 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) { return; } parents[yy] = xx; counts[xx] += counts[yy]; } public int getCount(int x) { return counts[find(x)]; } } static class Path implements Comparable<Path> { int cost; int left; int right; public Path(int cost, int left, int right) { this.cost = cost; this.left = left; this.right = right; } public int compareTo(Path another) { return cost - another.cost; } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); 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 String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }