結果

問題 No.1813 Magical Stones
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-01-14 21:26:52
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 225 ms / 2,000 ms
コード長 2,768 bytes
コンパイル時間 711 ms
コンパイル使用メモリ 124,416 KB
実行使用メモリ 21,772 KB
最終ジャッジ日時 2024-06-22 14:02:34
合計ジャッジ時間 5,466 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

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

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }
Tuple!(int, int[]) scc(in int[][][] graph) {
const n = cast(int)(graph[0].length);
int compN;
auto compIds = new int[n];
int[] us;
void dfs(int s, int u, int a, int b) {
if (compIds[u] == a) {
compIds[u] = b;
foreach (v; graph[s][u]) {
dfs(s, v, a, b);
}
if (s == 0) {
us ~= u;
}
}
}
foreach (u; 0 .. n) {
dfs(0, u, 0, -1);
}
foreach_reverse (u; us) {
if (compIds[u] == -1) {
dfs(1, u, -1, compN);
++compN;
}
}
return tuple(compN, compIds);
}
void main() {
try {
for (; ; ) {
const N = readInt();
const M = readInt();
auto A = new int[M];
auto B = new int[M];
foreach (i; 0 .. M) {
A[i] = readInt() - 1;
B[i] = readInt() - 1;
}
auto graph = new int[][][](2, N);
foreach (i; 0 .. M) {
graph[0][A[i]] ~= B[i];
graph[1][B[i]] ~= A[i];
}
const res = scc(graph);
auto outdeg = new int[res[0]];
auto indeg = new int[res[0]];
foreach (i; 0 .. M) {
const x = res[1][A[i]];
const y = res[1][B[i]];
if (x != y) {
++outdeg[x];
++indeg[y];
}
}
debug {
if (N <= 10) {
writeln("res = ", res);
writeln("outdeg = ", outdeg);
writeln("indeg = ", indeg);
}
}
int ans = 0;
if (res[0] > 1) {
chmax(ans, cast(int)(indeg.count(0)));
chmax(ans, cast(int)(outdeg.count(0)));
}
writeln(ans);
}
} catch (EOFException e) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0