結果
| 問題 |
No.812 Change of Class
|
| コンテスト | |
| ユーザー |
 Grenache
|
| 提出日時 | 2019-05-01 18:32:48 |
| 言語 | Java (openjdk 23) |
| 結果 |
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 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 60 |
ソースコード
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);
}
}
}