結果

問題 No.812 Change of Class
ユーザー GrenacheGrenache
提出日時 2019-05-01 18:32:48
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,545 ms / 4,000 ms
コード長 7,315 bytes
コンパイル時間 5,708 ms
コンパイル使用メモリ 77,920 KB
実行使用メモリ 89,156 KB
最終ジャッジ日時 2023-09-03 15:22:27
合計ジャッジ時間 50,597 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 576 ms
74,940 KB
testcase_01 AC 299 ms
62,100 KB
testcase_02 AC 466 ms
66,664 KB
testcase_03 AC 650 ms
78,528 KB
testcase_04 AC 617 ms
75,632 KB
testcase_05 AC 1,545 ms
79,168 KB
testcase_06 AC 1,496 ms
79,052 KB
testcase_07 AC 202 ms
57,976 KB
testcase_08 AC 181 ms
59,156 KB
testcase_09 AC 1,489 ms
81,052 KB
testcase_10 AC 1,528 ms
80,316 KB
testcase_11 AC 350 ms
69,348 KB
testcase_12 AC 1,117 ms
81,756 KB
testcase_13 AC 118 ms
55,324 KB
testcase_14 AC 120 ms
53,364 KB
testcase_15 AC 1,122 ms
72,568 KB
testcase_16 AC 271 ms
60,104 KB
testcase_17 AC 1,117 ms
75,612 KB
testcase_18 AC 875 ms
64,892 KB
testcase_19 AC 1,051 ms
75,900 KB
testcase_20 AC 1,519 ms
81,972 KB
testcase_21 AC 821 ms
67,100 KB
testcase_22 AC 544 ms
62,600 KB
testcase_23 AC 260 ms
60,272 KB
testcase_24 AC 282 ms
58,912 KB
testcase_25 AC 435 ms
62,656 KB
testcase_26 AC 1,349 ms
75,304 KB
testcase_27 AC 1,348 ms
79,048 KB
testcase_28 AC 872 ms
71,884 KB
testcase_29 AC 413 ms
62,336 KB
testcase_30 AC 1,170 ms
74,964 KB
testcase_31 AC 936 ms
71,580 KB
testcase_32 AC 572 ms
67,624 KB
testcase_33 AC 1,241 ms
79,216 KB
testcase_34 AC 291 ms
59,324 KB
testcase_35 AC 488 ms
62,220 KB
testcase_36 AC 317 ms
60,432 KB
testcase_37 AC 701 ms
65,100 KB
testcase_38 AC 255 ms
61,936 KB
testcase_39 AC 738 ms
64,980 KB
testcase_40 AC 349 ms
62,360 KB
testcase_41 AC 238 ms
61,792 KB
testcase_42 AC 1,221 ms
72,244 KB
testcase_43 AC 485 ms
69,840 KB
testcase_44 AC 934 ms
66,636 KB
testcase_45 AC 315 ms
60,120 KB
testcase_46 AC 415 ms
65,916 KB
testcase_47 AC 912 ms
66,600 KB
testcase_48 AC 914 ms
72,408 KB
testcase_49 AC 537 ms
62,452 KB
testcase_50 AC 194 ms
57,608 KB
testcase_51 AC 478 ms
62,600 KB
testcase_52 AC 712 ms
72,348 KB
testcase_53 AC 375 ms
62,464 KB
testcase_54 AC 358 ms
60,516 KB
testcase_55 AC 596 ms
79,852 KB
testcase_56 AC 640 ms
84,752 KB
testcase_57 AC 657 ms
85,228 KB
testcase_58 AC 536 ms
70,612 KB
testcase_59 AC 707 ms
89,156 KB
testcase_60 AC 121 ms
55,640 KB
testcase_61 AC 120 ms
55,556 KB
testcase_62 AC 120 ms
55,388 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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);
		}
	}
}
0