結果
問題 |
No.3171 Color Restoration
|
ユーザー |
![]() |
提出日時 | 2025-08-01 02:59:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,950 bytes |
コンパイル時間 | 4,507 ms |
コンパイル使用メモリ | 266,356 KB |
実行使用メモリ | 7,716 KB |
最終ジャッジ日時 | 2025-08-01 02:59:08 |
合計ジャッジ時間 | 5,440 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#ifndef ONLINE_JUDGE #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> #include <cassert> #include <atcoder/all> using namespace std; using namespace atcoder; using ll = long long; using mint = modint998244353; //using mint = modint1000000007; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++) #define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--) #define all(v) v.begin(), v.end() void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); } #define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); } template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; } template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; } template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; } template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; } const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0}; int main() { set<string> one = {"gray","brown","green","cyan","blue","yellow","orange","red"}; set<string> two = {"gray","green","blue","yellow","red"}; set<string> three = {"gray","green","cyan","blue","violet","orange","red"}; vector<string> s(3); cin >> s; sort(all(s)); vector<string> ans; do { bool ok = true; if(!one.count(s[0])) ok = false; if(!two.count(s[1])) ok = false; if(!three.count(s[2])) ok = false; if(ok) { if(!ans.empty()) { cout << "No" << endl; return 0; } ans = s; } } while(next_permutation(all(s))); if(ans.empty()) cout << "No" << endl; else cout << "Yes" << endl; return 0; }