結果
問題 |
No.3171 Color Restoration
|
ユーザー |
|
提出日時 | 2025-06-06 22:37:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,786 bytes |
コンパイル時間 | 2,663 ms |
コンパイル使用メモリ | 226,644 KB |
実行使用メモリ | 6,272 KB |
最終ジャッジ日時 | 2025-06-06 22:37:55 |
合計ジャッジ時間 | 3,937 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; #define int int64_t template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #define pi pair<int, int> #define vi vector<int> #define pb push_back #define all(x) (x).begin(), (x).end() template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &x : v) in >> x; return in; } template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) { for (const auto &x : v) out << x << ' '; return out; } template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; } template <typename T1, typename T2> ostream &operator<<(ostream &out, const pair<T1, T2> &p) { out << p.first << ' ' << p.second; return out; } const int MOD = 1000000007; void solve() { vector<string> v1 = {"gray", "brown", "green", "cyan", "blue", "yellow", "orange", "red"}, v2 = {"gray", "green", "blue", "yellow", "red"}, v3 = {"gray", "green", "cyan", "blue", "violet", "orange", "red"}; string s1, s2, s3; cin >> s1 >> s2 >> s3; vector<string> s = {s1, s2, s3}; sort(all(s)); int count = 0; do { if (find(all(v1), s[0]) != v1.end() && find(all(v2), s[1]) != v2.end() && find(all(v3), s[2]) != v3.end()) count++; } while (next_permutation(all(s))); cout << (count == 1 ? "Yes\n" : "No\n"); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) solve(); return 0; }