結果

問題 No.812 Change of Class
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-04-19 20:27:20
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 541 ms / 4,000 ms
コード長 2,370 bytes
コンパイル時間 927 ms
コンパイル使用メモリ 126,440 KB
実行使用メモリ 28,528 KB
最終ジャッジ日時 2024-06-22 00:46:41
合計ジャッジ時間 13,755 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 60
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
int N, M;
int[] U, V;
int Q;
int[] A;
void main() {
try {
for (; ; ) {
N = readInt();
M = readInt();
U = new int[M];
V = new int[M];
foreach (i; 0 .. M) {
U[i] = readInt() - 1;
V[i] = readInt() - 1;
}
Q = readInt();
A = new int[Q];
foreach (q; 0 .. Q) {
A[q] = readInt() - 1;
}
auto graph = new int[][N];
foreach (i; 0 .. M) {
graph[U[i]] ~= V[i];
graph[V[i]] ~= U[i];
}
foreach (q; 0 .. Q) {
DList!int que;
auto dist = new int[N];
dist[] = -1;
dist[A[q]] = 0;
que.insertBack(A[q]);
for (; !que.empty; ) {
const u = que.front;
que.removeFront;
foreach (v; graph[u]) {
if (dist[v] == -1) {
dist[v] = dist[u] + 1;
que.insertBack(v);
}
}
}
int cnt, mx;
foreach (u; 0 .. N) {
if (dist[u] != -1) {
++cnt;
chmax(mx, dist[u]);
}
}
int ans;
for (ans = 0; (1 << ans) < mx; ++ans) {}
writeln(cnt - 1, " ", ans);
}
}
} catch (EOFException e) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0