結果
問題 | No.1170 Never Want to Walk |
ユーザー | tenten |
提出日時 | 2023-06-21 11:40:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 390 ms / 2,000 ms |
コード長 | 3,626 bytes |
コンパイル時間 | 3,150 ms |
コンパイル使用メモリ | 86,256 KB |
実行使用メモリ | 66,372 KB |
最終ジャッジ日時 | 2023-09-11 07:06:35 |
合計ジャッジ時間 | 13,585 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,256 KB |
testcase_01 | AC | 42 ms
49,388 KB |
testcase_02 | AC | 43 ms
49,396 KB |
testcase_03 | AC | 45 ms
49,692 KB |
testcase_04 | AC | 43 ms
49,296 KB |
testcase_05 | AC | 43 ms
49,404 KB |
testcase_06 | AC | 43 ms
49,348 KB |
testcase_07 | AC | 43 ms
49,568 KB |
testcase_08 | AC | 44 ms
49,256 KB |
testcase_09 | AC | 43 ms
49,624 KB |
testcase_10 | AC | 42 ms
49,304 KB |
testcase_11 | AC | 43 ms
49,380 KB |
testcase_12 | AC | 55 ms
49,764 KB |
testcase_13 | AC | 54 ms
49,504 KB |
testcase_14 | AC | 57 ms
50,428 KB |
testcase_15 | AC | 57 ms
50,148 KB |
testcase_16 | AC | 54 ms
49,616 KB |
testcase_17 | AC | 57 ms
49,400 KB |
testcase_18 | AC | 55 ms
49,736 KB |
testcase_19 | AC | 55 ms
49,504 KB |
testcase_20 | AC | 55 ms
49,364 KB |
testcase_21 | AC | 56 ms
49,588 KB |
testcase_22 | AC | 56 ms
49,432 KB |
testcase_23 | AC | 57 ms
50,220 KB |
testcase_24 | AC | 57 ms
49,696 KB |
testcase_25 | AC | 54 ms
50,304 KB |
testcase_26 | AC | 56 ms
49,444 KB |
testcase_27 | AC | 375 ms
62,940 KB |
testcase_28 | AC | 377 ms
64,288 KB |
testcase_29 | AC | 361 ms
63,480 KB |
testcase_30 | AC | 373 ms
63,004 KB |
testcase_31 | AC | 377 ms
63,404 KB |
testcase_32 | AC | 359 ms
64,952 KB |
testcase_33 | AC | 368 ms
66,332 KB |
testcase_34 | AC | 390 ms
65,680 KB |
testcase_35 | AC | 377 ms
66,204 KB |
testcase_36 | AC | 371 ms
66,372 KB |
testcase_37 | AC | 382 ms
65,792 KB |
testcase_38 | AC | 376 ms
66,100 KB |
ソースコード
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 left = 0; int right = 0; UnionFindTree uft = new UnionFindTree(n); int[] imos = new int[n]; for (int i = 0; i < n; i++) { while (left < n && points[left] - points[i] < a) { left++; } if (left >= n) { break; } while (right < n && points[right] - points[i] <= b) { right++; } if (left == right) { continue; } uft.unite(i, left); imos[left]++; imos[right - 1]--; } if (imos[0] > 0) { uft.unite(0, 1); } for (int i = 1; i < n; 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(); } }