結果

問題 No.826 連絡網
ユーザー holegumaholeguma
提出日時 2019-07-17 13:13:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 156 ms / 2,000 ms
コード長 4,215 bytes
コンパイル時間 2,591 ms
コンパイル使用メモリ 78,168 KB
実行使用メモリ 60,540 KB
最終ジャッジ日時 2024-06-01 05:45:45
合計ジャッジ時間 6,842 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,224 KB
testcase_01 AC 56 ms
50,288 KB
testcase_02 AC 55 ms
50,228 KB
testcase_03 AC 59 ms
50,324 KB
testcase_04 AC 59 ms
50,052 KB
testcase_05 AC 57 ms
50,272 KB
testcase_06 AC 57 ms
50,336 KB
testcase_07 AC 60 ms
50,236 KB
testcase_08 AC 57 ms
50,316 KB
testcase_09 AC 59 ms
49,960 KB
testcase_10 AC 56 ms
50,232 KB
testcase_11 AC 60 ms
50,112 KB
testcase_12 AC 147 ms
56,084 KB
testcase_13 AC 100 ms
53,824 KB
testcase_14 AC 130 ms
56,204 KB
testcase_15 AC 84 ms
50,920 KB
testcase_16 AC 109 ms
53,796 KB
testcase_17 AC 102 ms
53,960 KB
testcase_18 AC 112 ms
53,976 KB
testcase_19 AC 152 ms
60,540 KB
testcase_20 AC 152 ms
60,476 KB
testcase_21 AC 61 ms
50,308 KB
testcase_22 AC 102 ms
53,768 KB
testcase_23 AC 110 ms
53,872 KB
testcase_24 AC 100 ms
51,608 KB
testcase_25 AC 156 ms
58,136 KB
testcase_26 AC 101 ms
51,588 KB
testcase_27 AC 141 ms
56,340 KB
testcase_28 AC 128 ms
56,300 KB
testcase_29 AC 102 ms
53,916 KB
testcase_30 AC 154 ms
58,180 KB
testcase_31 AC 112 ms
53,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int n = ir.nextInt();
		int p = ir.nextInt();
		UnionFindTree uf = new UnionFindTree(n + 1);
		boolean[] prime = new boolean[n + 1];
		Arrays.fill(prime, true);
		for (int i = 2; i <= n / 2; i++) {
			if (prime[i]) {
				for (int j = i * 2; j <= n; j += i) {
					prime[j] = false;
					uf.unite(i, j);
				}
			}
		}
		out.println(uf.size(p));
	}

	static class UnionFindTree {

		private int[] par;
		private int[] rank;
		private int g;

		public UnionFindTree(int size) {
			par = new int[size];
			rank = new int[size];
			g = size;
			for (int i = 0; i < size; i++) {
				par[i] = -1;
				rank[i] = 0;
			}
		}

		public int find(int x) {
			if (par[x] < 0)
				return x;
			else
				return par[x] = find(par[x]);
		}

		public void unite(int x, int y) {
			x = find(x);
			y = find(y);
			if (x == y)
				return;
			else if (rank[x] > rank[y]) {
				par[x] += par[y];
				par[y] = x;
			} else {
				par[y] += par[x];
				par[x] = y;
				if (rank[x] == rank[y])
					rank[y]++;
			}
			g--;
		}

		public int groups() {
			return g;
		}

		public int size(int x) {
			return -par[find(x)];
		}

		public boolean same(int x, int y) {
			return find(x) == find(y);
		}
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}
0