結果

問題 No.2283 Prohibit Three Consecutive
ユーザー sten_sansten_san
提出日時 2023-04-28 21:54:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,724 bytes
コンパイル時間 2,078 ms
コンパイル使用メモリ 204,196 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-17 20:51:58
合計ジャッジ時間 2,748 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 WA -
testcase_03 AC 2 ms
5,248 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 1 ms
5,248 KB
testcase_08 WA -
testcase_09 AC 3 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 WA -
testcase_13 WA -
権限があれば一括ダウンロードができます

ソースコード

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

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

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

    while (t--) {
        int n; cin >> n;
        string s; cin >> s;

        auto solve = [&]() {
            for (int i = 0; i < n; ++i) {
                if (s[i] == s[(i + 1) % n] && s[(i + 1) % n] == s[(i + 2) % n]) {
                    return false;
                }
            }

            auto dp = vec<array<array<bool, 3>, 2>>(uns, n + 1);

            dp[0][0][0] = dp[0][1][0] = true;
            for (int i = 1; i <= n; ++i) {
                char c = s[i - 1];

                for (int j = 0; j < 2; ++j) {
                    if (c == '?' || c  - '0' == !j) {
                        dp[i][j][0] |= dp[i - 1][!j][1];
                        dp[i][j][0] |= dp[i - 1][!j][0];
                    }

                    if (c == '?' || c  - '0' == j) {
                        for (int k = 1; k < 3; ++k) {
                            dp[i][j][k] |= dp[i - 1][j][k - 1];
                        }
                    }
                }
            }

            int x = s[0] - '0', y = s[1] - '0';
            for (int i = 0; i < 2; ++i) {
                for (int j = 1; j < 3; ++j) {
                    if (!dp[n][i][j]) {
                        continue;
                    }

                    int count = j;
                    count += (x == i);
                    count += (x == i && y == i);

                    if (count < 3) {
                        return true;
                    }
                }
            }

            return false;
        };

        bool ans = false;

        [&]() {
            for (int x = 0; x < 2; ++x) {
                auto _1 = exchange(s[0], x + '0');
                if (_1 == s[0] || _1 == '?') {
                    for (int y = 0; y < 2; ++y) {
                        auto _2 = exchange(s[1], y + '0');
                        if (_2 == s[1] || _2 == '?') {
                            if (solve()) {
                                ans = true;
                                return;
                            }
                        }
                        s[1] = _2;
                    }
                }
                s[0] = _1;
            }
        }();

        cout << (ans ? "Yes" : "No") << endl;
    }
}
0