結果

問題 No.1078 I love Matrix Construction
ユーザー 👑 hos.lyric
提出日時 2020-06-12 21:31:41
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 353 ms / 2,000 ms
コード長 3,165 bytes
コンパイル時間 885 ms
コンパイル使用メモリ 125,516 KB
実行使用メモリ 35,928 KB
最終ジャッジ日時 2024-06-22 07:17:59
合計ジャッジ時間 6,716 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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();
      auto S = new int[N];
      auto T = new int[N];
      auto U = new int[N];
      foreach (i; 0 .. N) {
        S[i] = readInt() - 1;
      }
      foreach (i; 0 .. N) {
        T[i] = readInt() - 1;
      }
      foreach (i; 0 .. N) {
        U[i] = readInt();
      }
      
      auto graph = new int[][][](2, N * N * 2);
      void ae(int u, int v) {
        graph[0][u] ~= v;
        graph[1][v] ~= u;
      }
      
      foreach (i; 0 .. N) {
        foreach (j; 0 .. N) {
          const u = S[i] * N + j;
          const v = j * N + T[i];
          const s = (U[i] >> 0) & 1;
          const t = (U[i] >> 1) & 1;
          debug {
            writeln(u, " ", v, " ", s, " ", t);
          }
          ae(u * 2 + s, v * 2 + (t ^ 1));
          ae(v * 2 + t, u * 2 + (s ^ 1));
        }
      }
      auto res = scc(graph);
      bool ok = true;
      foreach (u; 0 .. N * N) {
        ok = ok && (res[1][u * 2 + 0] != res[1][u * 2 + 1]);
      }
      if (ok) {
        auto ans = new int[N * N];
        foreach (u; 0 .. N * N) {
          ans[u] = (res[1][u * 2 + 0] < res[1][u * 2 + 1]) ? 1 : 0;
        }
        foreach (x; 0 .. N) {
          foreach (y; 0 .. N) {
            if (y > 0) write(" ");
            write(ans[x * N + y]);
          }
          writeln();
        }
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0