結果

問題 No.826 連絡網
ユーザー uwiuwi
提出日時 2019-05-04 04:13:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 165 ms / 2,000 ms
コード長 3,854 bytes
コンパイル時間 5,154 ms
コンパイル使用メモリ 78,400 KB
実行使用メモリ 55,660 KB
最終ジャッジ日時 2023-08-15 18:27:33
合計ジャッジ時間 9,231 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,336 KB
testcase_01 AC 44 ms
49,364 KB
testcase_02 AC 45 ms
49,464 KB
testcase_03 AC 56 ms
50,692 KB
testcase_04 AC 58 ms
51,008 KB
testcase_05 AC 49 ms
49,468 KB
testcase_06 AC 49 ms
49,328 KB
testcase_07 AC 56 ms
51,180 KB
testcase_08 AC 50 ms
48,228 KB
testcase_09 AC 57 ms
51,084 KB
testcase_10 AC 46 ms
49,272 KB
testcase_11 AC 57 ms
50,712 KB
testcase_12 AC 131 ms
53,240 KB
testcase_13 AC 92 ms
51,364 KB
testcase_14 AC 119 ms
53,736 KB
testcase_15 AC 72 ms
51,980 KB
testcase_16 AC 104 ms
51,336 KB
testcase_17 AC 97 ms
51,700 KB
testcase_18 AC 89 ms
51,100 KB
testcase_19 AC 149 ms
53,996 KB
testcase_20 AC 153 ms
54,384 KB
testcase_21 AC 58 ms
51,168 KB
testcase_22 AC 101 ms
51,392 KB
testcase_23 AC 107 ms
52,012 KB
testcase_24 AC 88 ms
51,900 KB
testcase_25 AC 161 ms
55,660 KB
testcase_26 AC 90 ms
51,348 KB
testcase_27 AC 144 ms
54,188 KB
testcase_28 AC 123 ms
54,000 KB
testcase_29 AC 100 ms
51,360 KB
testcase_30 AC 165 ms
55,552 KB
testcase_31 AC 102 ms
51,772 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190503;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	// 0411-
	void solve()
	{
		int n = ni(), K = ni();
		DJSet ds = new DJSet(n+1);
		for(int d = 2;d <= n;d++) {
			for(int e = d*2;e <= n;e+=d) {
				ds.union(d, e);
			}
		}
		out.println(-ds.upper[ds.root(K)]);
	}
	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper)
				if (u < 0)
					ct++;
			return ct;
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0