結果

問題 No.2283 Prohibit Three Consecutive
ユーザー rniya
提出日時 2023-04-28 22:06:21
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 2,537 bytes
コンパイル時間 2,348 ms
コンパイル使用メモリ 203,172 KB
最終ジャッジ日時 2025-02-12 15:13:39
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 13
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif
using namespace std;
typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}
template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}
template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }
template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }
template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}
template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }
void solve() {
    int N;
    string S;
    cin >> N >> S;
    vector dp(4, vector<bool>(4, false)), ndp(4, vector<bool>(4, false));
    for (int i = 0; i < 2; i++) {
        if (S[0] != '?' and S[0] - '0' != i) continue;
        for (int j = 0; j < 2; j++) {
            if (S[1] != '?' and S[1] - '0' != j) continue;
            dp[i + 2 * j][i + 2 * j] = true;
        }
    }
    for (int k = 2; k < N; k++) {
        char c = S[k];
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                if (not dp[i][j]) continue;
                for (int d = 0; d < 2; d++) {
                    if (c != '?' and c - '0' != d) continue;
                    if (j == 0 and d == 0) continue;
                    if (j == 3 and d == 1) continue;
                    ndp[i][j / 2 + 2 * d] = true;
                }
                dp[i][j] = false;
            }
        }
        swap(dp, ndp);
    }
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
            if (not dp[i][j]) continue;
            int c = j / 2, d = i & 1;
            if (i == 0 and c == 0) continue;
            if (i == 3 and c == 1) continue;
            if (j == 0 and d == 0) continue;
            if (j == 3 and d == 1) continue;
            cout << "Yes\n";
            return;
        }
    }
    cout << "No\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0