結果
問題 | No.2301 Namorientation |
ユーザー |
👑 |
提出日時 | 2023-05-12 22:03:24 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 295 ms / 3,000 ms |
コード長 | 2,851 bytes |
コンパイル時間 | 1,078 ms |
コンパイル使用メモリ | 121,892 KB |
実行使用メモリ | 23,872 KB |
最終ジャッジ日時 | 2024-06-22 17:56:02 |
合計ジャッジ時間 | 13,970 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
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; }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;int[] A, B;int[][] G;void main() {try {for (; ; ) {N = readInt;A = new int[N];B = new int[N];foreach (i; 0 .. N) {A[i] = readInt - 1;B[i] = readInt - 1;}G = new int[][N];foreach (i; 0 .. N) {G[A[i]] ~= i;G[B[i]] ~= i;}auto deg = new int[N];DList!int que;foreach (u; 0 .. N) {deg[u] = cast(int)(G[u].length);if (deg[u] == 1) {que ~= u;}}auto ans = new int[N];ans[] = -1;auto del = new bool[N];for (; !que.empty; ) {const u = que.front;que.removeFront;del[u] = true;foreach (i; G[u]) if (!~ans[i]) {int v = -1;if (u == A[i]) {ans[i] = 0;v = B[i];} else {ans[i] = 1;v = A[i];}if (--deg[v] == 1) {que ~= v;}}}debug {writeln("ans = ", ans);writeln("del = ", del);}foreach (s; 0 .. N) if (!del[s]) {for (int u = s; ; ) {del[u] = true;int v = -1;foreach (i; G[u]) if (!~ans[i]) {if (u == A[i]) {ans[i] = 0;v = B[i];} else {ans[i] = 1;v = A[i];}break;}assert(~v);if (v == s) break;u = v;}}foreach (i; 0 .. N) {writeln(["->", "<-"][ans[i]]);}debug {writeln("========");}}} catch (EOFException e) {}}