#344153 (Java21) No.812 Change of Class

• 問題: No.812 Change of Class
• ユーザー: Grenache
• 提出日時: 2019-05-01 18:32:48
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 1,225 ms / 4,000 ms
• コード長: 7,315 bytes
• コンパイル時間: 4,884 ms
• コンパイル使用メモリ: 83,028 KB
• 実行使用メモリ: 92,464 KB
• 最終ジャッジ日時: 2024-06-12 21:05:15
• 合計ジャッジ時間: 42,185 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	482 ms; 73,380 KB
testcase_01	AC	270 ms; 59,720 KB
testcase_02	AC	429 ms; 67,652 KB
testcase_03	AC	603 ms; 76,648 KB
testcase_04	AC	521 ms; 73,924 KB
testcase_05	AC	1,225 ms; 78,092 KB
testcase_06	AC	1,091 ms; 75,152 KB
testcase_07	AC	204 ms; 59,760 KB
testcase_08	AC	165 ms; 57,344 KB
testcase_09	AC	1,221 ms; 80,260 KB
testcase_10	AC	1,188 ms; 78,520 KB
testcase_11	AC	325 ms; 67,940 KB
testcase_12	AC	870 ms; 77,524 KB
testcase_13	AC	122 ms; 53,944 KB
testcase_14	AC	111 ms; 53,084 KB
testcase_15	AC	983 ms; 71,344 KB
testcase_16	AC	248 ms; 58,376 KB
testcase_17	AC	948 ms; 77,312 KB
testcase_18	AC	677 ms; 65,772 KB
testcase_19	AC	836 ms; 70,812 KB
testcase_20	AC	1,167 ms; 80,332 KB
testcase_21	AC	691 ms; 68,900 KB
testcase_22	AC	493 ms; 62,388 KB
testcase_23	AC	233 ms; 58,348 KB
testcase_24	AC	277 ms; 57,484 KB
testcase_25	AC	405 ms; 60,856 KB
testcase_26	AC	1,138 ms; 73,856 KB
testcase_27	AC	1,034 ms; 75,248 KB
testcase_28	AC	738 ms; 70,604 KB
testcase_29	AC	352 ms; 60,756 KB
testcase_30	AC	854 ms; 73,560 KB
testcase_31	AC	779 ms; 69,972 KB
testcase_32	AC	426 ms; 62,776 KB
testcase_33	AC	996 ms; 74,276 KB
testcase_34	AC	264 ms; 57,660 KB
testcase_35	AC	400 ms; 61,272 KB
testcase_36	AC	284 ms; 58,476 KB
testcase_37	AC	546 ms; 63,132 KB
testcase_38	AC	240 ms; 59,800 KB
testcase_39	AC	568 ms; 65,068 KB
testcase_40	AC	300 ms; 60,368 KB
testcase_41	AC	230 ms; 60,288 KB
testcase_42	AC	990 ms; 71,016 KB
testcase_43	AC	419 ms; 68,540 KB
testcase_44	AC	707 ms; 65,296 KB
testcase_45	AC	277 ms; 58,472 KB
testcase_46	AC	366 ms; 65,060 KB
testcase_47	AC	899 ms; 65,152 KB
testcase_48	AC	768 ms; 70,056 KB
testcase_49	AC	399 ms; 60,688 KB
testcase_50	AC	189 ms; 55,124 KB
testcase_51	AC	372 ms; 60,936 KB
testcase_52	AC	537 ms; 68,536 KB
testcase_53	AC	317 ms; 60,628 KB
testcase_54	AC	324 ms; 58,576 KB
testcase_55	AC	558 ms; 78,716 KB
testcase_56	AC	566 ms; 84,620 KB
testcase_57	AC	588 ms; 84,352 KB
testcase_58	AC	468 ms; 69,844 KB
testcase_59	AC	728 ms; 92,464 KB
testcase_60	AC	113 ms; 52,896 KB
testcase_61	AC	113 ms; 52,648 KB
testcase_62	AC	123 ms; 53,816 KB

ソースコード

import java.io.*;
import java.util.*;


public class Main_yukicoder812 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();

		Dijkstra di = new Dijkstra(n);
		UnionFind uf = new UnionFind(n);
		for (int i = 0; i < m; i++) {
			int p = sc.nextInt() - 1;
			int q = sc.nextInt() - 1;
			di.addEdge(p, q, 1);
			di.addEdge(q, p, 1);
			uf.unite(p, q);
		}

		int q = sc.nextInt();
		for (int i = 0; i < q; i++) {
			int a = sc.nextInt() - 1;

			long max = 0;
			for (int j = 0; j < n; j++) {
				long d = di.getShortestPath(a, j);
				if (d != di.INF) {
					max = Math.max(max, d);
				}
			}
			int cnt = 0;
			while (max > 1) {
				max = (max + 1) / 2;
				cnt++;
			}
			
			pr.printf("%d %d%n", uf.count(a) - 1, cnt);
		}
	}

	static class UnionFind {
		int n;
		// cnt : 異なる集合の数
		int cnt;
		// parent[x] : 0～n-1 の場合、要素xのroot要素
		//           : -1～-n の場合、自分自身がroot要素、
		//                            -parent[x]でxを含む集合の要素数
		int[] parent;
		// rank[x] : 要素xが属する木の高さ
		int[] rank;

		UnionFind(int n) {
			this.n = n;
			cnt = n;
			parent = new int[n];
			Arrays.fill(parent, -1);
			rank = new int[n];
			Arrays.fill(rank, 0);
		}

		// xのrootを求める
		int find(int x) {
			if (parent[x] < 0) {
				return x;
			} else {
				return parent[x] = find(parent[x]);
			}
		}

		// xとyが同じ集合に属するのか
		boolean same(int x, int y) {
			return find(x) == find(y);
		}

		// xとyの属する集合を併合する
		void unite(int x, int y) {
			x = find(x);
			y = find(y);
			if (x == y) {
				return;
			}

			cnt--;
			// rankが大きい集合をrootにする
			if (rank[x] > rank[y]) {
				parent[x] += parent[y];
				parent[y] = x;
			} else {
				parent[y] += parent[x];
				parent[x] = y;
				if (rank[x] == rank[y]) {
					rank[y]++;
				}
			}

			return;
		}

		// 要素xを含む集合の要素数
		int count(int x) {
			return -parent[find(x)];
		}

		// 異なる集合の数
		int count() {
			return cnt;
		}
	}

	// Dijkstra O(E logV)
	static class Dijkstra {
		long[] d;
		List<List<Edge>> edges;
		PriorityQueue<Vertex> pq;
		int n;
		int s;

		final long INF = Long.MAX_VALUE;

		Dijkstra(int n) {
			this.n = n;

			edges = new ArrayList<>(n);
			for (int ii = 0; ii < n; ii++) {
				edges.add(new ArrayList<Edge>());
			}

			s = - 1;
		}

		// i, j:0-indexed
		public void addEdge(int i, int j, int c) {
			edges.get(i).add(new Edge(i, j, c));
		}

		public long getShortestPath(int i, int j) {
			if (s != i) {
				d = new long[n];
				Arrays.fill(d, INF);
				d[i] = 0;
				pq = new PriorityQueue<Vertex>();
				pq.add(new Vertex(i, d[i]));

				while (!pq.isEmpty()) {
					Vertex u = pq.poll();
					if (d[u.me] < u.d) {
						continue;  // skip old vertex
					}

					List<Edge> uu = edges.get(u.me);
					for (int ii = 0, size = uu.size(); ii < size; ii++) {
						Edge v = uu.get(ii);
						if (d[u.me] != INF && d[v.v] > d[u.me] + v.w) {
							d[v.v] = d[u.me] + v.w;
							pq.add(new Vertex(v.v, d[v.v]));
						}
					}
				}

				s = i;
			}

			return d[j];
		}

		private static class Edge {
//			int u; // from
			int v; // to
			int w; // cost

			Edge(int u, int v, int w) {
//				this.u = u;
				this.v = v;
				this.w = w;
			}
		}

		private static class Vertex implements Comparable<Vertex> {
			int me; // me
			long d; // cost

			Vertex(int u, long w) {
				this.me = u;
				this.d = w;
			}

			@Override
			public int compareTo(Vertex o) {
				return Long.compare(this.d, o.d);
			}
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);
			
		solve();
			
		pr.close();
		sc.close();
	}

	static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

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

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}