結果
問題 | No.826 連絡網 |
ユーザー | tenten |
提出日時 | 2022-08-12 11:22:10 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 2,210 bytes |
コンパイル時間 | 2,881 ms |
コンパイル使用メモリ | 78,204 KB |
実行使用メモリ | 64,540 KB |
最終ジャッジ日時 | 2023-10-23 21:06:18 |
合計ジャッジ時間 | 7,610 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
53,496 KB |
testcase_01 | AC | 50 ms
53,512 KB |
testcase_02 | AC | 50 ms
53,508 KB |
testcase_03 | AC | 52 ms
53,520 KB |
testcase_04 | AC | 54 ms
53,548 KB |
testcase_05 | AC | 51 ms
51,564 KB |
testcase_06 | AC | 53 ms
53,512 KB |
testcase_07 | AC | 55 ms
53,544 KB |
testcase_08 | AC | 54 ms
53,512 KB |
testcase_09 | AC | 55 ms
53,540 KB |
testcase_10 | AC | 51 ms
53,508 KB |
testcase_11 | AC | 53 ms
53,528 KB |
testcase_12 | AC | 122 ms
60,224 KB |
testcase_13 | AC | 93 ms
57,476 KB |
testcase_14 | AC | 109 ms
59,448 KB |
testcase_15 | AC | 81 ms
54,184 KB |
testcase_16 | AC | 96 ms
57,456 KB |
testcase_17 | AC | 94 ms
57,324 KB |
testcase_18 | AC | 91 ms
57,284 KB |
testcase_19 | AC | 135 ms
64,540 KB |
testcase_20 | AC | 137 ms
64,016 KB |
testcase_21 | AC | 57 ms
53,608 KB |
testcase_22 | AC | 93 ms
57,380 KB |
testcase_23 | AC | 103 ms
57,520 KB |
testcase_24 | AC | 94 ms
55,092 KB |
testcase_25 | AC | 136 ms
63,012 KB |
testcase_26 | AC | 90 ms
57,584 KB |
testcase_27 | AC | 128 ms
60,240 KB |
testcase_28 | AC | 112 ms
59,536 KB |
testcase_29 | AC | 93 ms
57,404 KB |
testcase_30 | AC | 136 ms
62,928 KB |
testcase_31 | AC | 98 ms
57,332 KB |
ソースコード
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 p = sc.nextInt(); UnionFindTree uft = new UnionFindTree(n + 1); boolean[] isNotPrime = new boolean[n + 1]; for (int i = 2; i <= n; i++) { if (!isNotPrime[i]) { for (int j = 2; j * i <= n; j++) { isNotPrime[j * i] = true; 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 (parents[x] == 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) { return; } counts[xx] += counts[yy]; parents[yy] = xx; } public int getCount(int x) { return counts[find(x)]; } } } 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 { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }