結果

問題 No.2984 [Cherry Anniversary 4] 満開の願いを込めた 27 の桜
ユーザー 👑 hos.lyric
提出日時 2024-12-09 11:53:56
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 231 ms / 4,000 ms
コード長 2,827 bytes
コンパイル時間 3,171 ms
コンパイル使用メモリ 121,728 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-09 11:54:06
合計ジャッジ時間 8,090 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
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; }
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 numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        long[3][3][3] A;
        foreach (i; 0 .. 3) foreach (j; 0 .. 3) foreach (k; 0 .. 3) A[i][j][k] = readLong;
        long[3][3] X, Y, Z;
        foreach (j; 0 .. 3) foreach (k; 0 .. 3) X[j][k] = readLong;
        foreach (i; 0 .. 3) foreach (k; 0 .. 3) Y[i][k] = readLong;
        foreach (i; 0 .. 3) foreach (j; 0 .. 3) Z[i][j] = readLong;
        
        long[3][3] x, y, z;
        foreach (i; 0 .. 3) foreach (j; 0 .. 3) foreach (k; 0 .. 3) {
          x[j][k] += A[i][j][k];
          y[i][k] += A[i][j][k];
          z[i][j] += A[i][j][k];
        }
        
        int getCost(T)(T ps) {
          int cnt;
          foreach (i; 0 .. 3) if (ps[i] == i) ++cnt;
          return (cnt == 3) ? 0 : (cnt == 1) ? 1 : 2;
        }
        
        int ans = -1;
        foreach (ps; iota(3).permutations) foreach (qs; iota(3).permutations) foreach (rs; iota(3).permutations) {
          bool ok = true;
          foreach (j; 0 .. 3) foreach (k; 0 .. 3) ok = ok && (X[j][k] == x[qs[j]][rs[k]]);
          foreach (i; 0 .. 3) foreach (k; 0 .. 3) ok = ok && (Y[i][k] == y[ps[i]][rs[k]]);
          foreach (i; 0 .. 3) foreach (j; 0 .. 3) ok = ok && (Z[i][j] == z[ps[i]][qs[j]]);
          if (ok) {
            int cost;
            cost += getCost(ps);
            cost += getCost(qs);
            cost += getCost(rs);
            if (!~ans || ans > cost) ans = cost;
            debug writeln(ps, " ", qs, " ", rs, ": ", cost);
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0