結果

問題 No.2148 ひとりUNO
ユーザー sten_sansten_san
提出日時 2022-12-06 15:11:27
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 13 ms / 2,000 ms
コード長 4,160 bytes
コンパイル時間 2,339 ms
コンパイル使用メモリ 216,560 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-13 05:45:43
合計ジャッジ時間 4,676 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/dsu>

int main() {
    int t; cin >> t;

    while (t--) {
        int n; cin >> n;
        auto c = vec<array<int, 2>>(uns, n);
        for (auto &[a, b] : c) {
            char c; cin >> c >> b; --b;
            a = string_view("BGR").find(c);
        }

        atcoder::dsu dsu(n + 3);
        for (auto &[c, d] : c) {
            dsu.merge(c, 3 + d);
        }

        if (!all_of(begin(c), end(c), [&](auto _) { return dsu.same(3 + c[0][1], 3 + _[1]); })) {
            cout << "NO" << endl;
            continue;
        }

        bool f[3] = {};
        for (auto [c, d] : c) {
            f[c] = true;
        }

        if (accumulate(begin(f), end(f), 0) <= 2) {
            cout << "YES" << endl;
            continue;
        }

        auto p = vec<array<bool, 3>>(uns, n);
        for (auto [c, d] : c) {
            p[d][c] = true;
        }

        array<int, 3> q = {};
        for (auto [c, d] : c) {
            ++q[c];
        }

        int e[3][3] = {};
        for (auto v : p) {
            for (int i = 0; i < 3; ++i) {
                for (int j = i + 1; j < 3; ++j) {
                    if (v[i] && v[j]) {
                        ++e[i][j];
                    }
                }
            }
        }

        bool g = false;
        for (int i = 0; i < 3 && !g; ++i) {
            for (int j = i + 1; j < 3 && !g; ++j) {
                if (2 <= e[i][j]) {
                    g = true;
                }
            }
        }

        if (g) {
            cout << "YES" << endl;
            continue;
        }

        if (2 <= count_if(begin(p), end(p), [](auto _) { return 2 <= _[0] + _[1] + _[2]; })) {
            cout << "YES" << endl;
            continue;
        }

        if (3 <= count_if(begin(q), end(q), [](auto _) { return 2 <= _; })) {
            cout << "NO" << endl;
            continue;
        }

        cout << "YES" << endl;
    }
}
0