結果
問題 | No.826 連絡網 |
ユーザー | tenten |
提出日時 | 2023-03-15 10:00:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 303 ms / 2,000 ms |
コード長 | 2,597 bytes |
コンパイル時間 | 3,257 ms |
コンパイル使用メモリ | 88,932 KB |
実行使用メモリ | 46,304 KB |
最終ジャッジ日時 | 2023-10-18 12:15:15 |
合計ジャッジ時間 | 9,272 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,840 KB |
testcase_01 | AC | 53 ms
36,872 KB |
testcase_02 | AC | 53 ms
36,848 KB |
testcase_03 | AC | 64 ms
36,976 KB |
testcase_04 | AC | 70 ms
37,208 KB |
testcase_05 | AC | 60 ms
36,884 KB |
testcase_06 | AC | 60 ms
36,888 KB |
testcase_07 | AC | 67 ms
37,204 KB |
testcase_08 | AC | 62 ms
36,900 KB |
testcase_09 | AC | 67 ms
37,232 KB |
testcase_10 | AC | 56 ms
36,864 KB |
testcase_11 | AC | 64 ms
37,004 KB |
testcase_12 | AC | 222 ms
44,068 KB |
testcase_13 | AC | 125 ms
40,284 KB |
testcase_14 | AC | 181 ms
42,620 KB |
testcase_15 | AC | 87 ms
38,504 KB |
testcase_16 | AC | 145 ms
40,872 KB |
testcase_17 | AC | 129 ms
40,292 KB |
testcase_18 | AC | 115 ms
39,896 KB |
testcase_19 | AC | 249 ms
45,420 KB |
testcase_20 | AC | 257 ms
45,268 KB |
testcase_21 | AC | 76 ms
37,388 KB |
testcase_22 | AC | 127 ms
40,336 KB |
testcase_23 | AC | 146 ms
40,988 KB |
testcase_24 | AC | 112 ms
39,432 KB |
testcase_25 | AC | 303 ms
46,276 KB |
testcase_26 | AC | 112 ms
39,676 KB |
testcase_27 | AC | 244 ms
44,740 KB |
testcase_28 | AC | 196 ms
43,392 KB |
testcase_29 | AC | 128 ms
40,280 KB |
testcase_30 | AC | 291 ms
46,304 KB |
testcase_31 | AC | 139 ms
40,764 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 p = sc.nextInt(); UnionFindTree uft = new UnionFindTree(n + 1); for (int i = 2; i <= n; i++) { for (int j = 2; j * i <= n; j++) { uft.unite(i, j * i); } } System.out.println(uft.getCount(p)); } 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 void unite(int x, int y) { int xx = find(x); int yy = find(y); if (xx != yy) { parents[yy] = xx; counts[xx] += counts[yy]; } } 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(); } }