結果

問題 No.2986 Permutation Puzzle
ユーザー 👑 hos.lyric
提出日時 2024-12-11 10:20:46
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 247 ms / 2,000 ms
コード長 3,905 bytes
コンパイル時間 2,727 ms
コンパイル使用メモリ 119,168 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-11 10:20:54
合計ジャッジ時間 5,853 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!uint.gcdImpl`

ソースコード

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; }
string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }
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)); }
void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const K = readInt;
      auto A = new int[][](N, N); foreach (x; 0 .. N) foreach (y; 0 .. N) A[x][y] = readInt - 1;
      auto B = new int[][](N, N); foreach (x; 0 .. N) foreach (y; 0 .. N) B[x][y] = readInt - 1;
      
      auto C = new int[][][](K + 1, N, N);
      auto ops = new int[K];
      C[0] = A;
      bool dfs(int k) {
        if (k == K) {
          return (C[K] == B);
        }
        foreach (x0; 0 .. N) {
          ops[k] = x0;
          foreach (x; 0 .. N) foreach (y; 0 .. N) C[k + 1][C[k][x0][x]][y] = C[k][x][y];
          if (dfs(k + 1)) return true;
        }
        foreach (y0; 0 .. N) {
          ops[k] = N + y0;
          foreach (x; 0 .. N) foreach (y; 0 .. N) C[k + 1][x][C[k][y][y0]] = C[k][x][y];
          if (dfs(k + 1)) return true;
        }
        return false;
      }
      const res = dfs(0);
      assert(res);
      debug {
        foreach (k; 0 .. K + 1) {
          writefln("C[%s] = %s", k, C[k]);
        }
        writeln("ops = ", ops);
      }
      
      int[] ans;
      foreach_reverse (k; 0 .. K) {
        auto perm = new int[N];
        int now;
        if (ops[k] < N) {
          const x0 = ops[k];
          foreach (y; 0 .. N) perm[y] = C[k][x0][y];
          now = C[k][x0][x0];
        } else {
          const y0 = ops[k] - N;
          foreach (x; 0 .. N) perm[x] = C[k][x][y0];
          now = C[k][y0][y0];
        }
        int lcm = 1;
        {
          auto vis = new bool[N];
          foreach (u; 0 .. N) if (!vis[u]) {
            int c;
            for (int v = u; !vis[v]; v = perm[v]) {
              vis[v] = true;
              ++c;
            }
            lcm = lcm / gcd(lcm, c) * c;
          }
        }
        debug writeln("perm = ", perm, ", lcm = ", lcm, ", now = ", now);
        foreach (_; 0 .. lcm - 1) {
          ans ~= (ops[k] < N) ? now : (N + now);
          now = perm[now];
        }
      }
      
      writeln(ans.length);
      foreach (op; ans) {
        if (op < N) {
          writeln("R ", op + 1);
        } else {
          writeln("C ", op - N + 1);
        }
      }
      
      debug {
        auto b = new int[][](N, N);
        foreach (x; 0 .. N) foreach (y; 0 .. N) b[x][y] = B[x][y];
        foreach (op; ans) {
          auto bb = new int[][](N, N);
          if (op < N) {
            const x0 = op;
            foreach (x; 0 .. N) foreach (y; 0 .. N) bb[b[x0][x]][y] = b[x][y];
          } else {
            const y0 = op - N;
            foreach (x; 0 .. N) foreach (y; 0 .. N) bb[x][b[y][y0]] = b[x][y];
          }
          b = bb;
        }
        assert(b == A);
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0