結果

問題 No.3171 Color Restoration
ユーザー 👑 hos.lyric
提出日時 2025-06-06 22:00:39
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,768 bytes
コンパイル時間 982 ms
コンパイル使用メモリ 110,048 KB
実行使用メモリ 7,844 KB
最終ジャッジ日時 2025-06-06 22:00:41
合計ジャッジ時間 1,868 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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)); }


enum A = [
["gray","brown","green","cyan","blue","yellow","orange","red"],
["gray","green","blue","yellow","red"],
["gray","green","cyan","blue","violet","orange","red"],
];

void main() {
  try {
    for (; ; ) {
      auto S = new string[3];
      foreach (i; 0 .. 3) S[i] = readToken;
      S.sort;
      
      int ans;
      do {
        bool ok = true;
        foreach (i; 0 .. 3) ok = ok && A[i].count(S[i]);
        if (ok) ++ans;
      } while (S.nextPermutation);
      debug writeln(ans);
      writeln((ans == 1) ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}
0