結果

問題 No.2283 Prohibit Three Consecutive
ユーザー miscalcmiscalc
提出日時 2023-04-28 21:50:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 884 ms / 2,000 ms
コード長 4,609 bytes
コンパイル時間 4,351 ms
コンパイル使用メモリ 270,332 KB
実行使用メモリ 27,912 KB
最終ジャッジ日時 2024-11-17 20:48:57
合計ジャッジ時間 8,068 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 1 ms
6,816 KB
testcase_03 AC 884 ms
18,100 KB
testcase_04 AC 771 ms
15,124 KB
testcase_05 AC 292 ms
6,816 KB
testcase_06 AC 283 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 51 ms
27,904 KB
testcase_09 AC 207 ms
27,912 KB
testcase_10 AC 49 ms
27,904 KB
testcase_11 AC 340 ms
27,888 KB
testcase_12 AC 85 ms
6,816 KB
testcase_13 AC 208 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

bool sub(ll N, string S)
{
  vector dp(N + 1, vector(3, vector(3, false)));
  dp.at(0).at(0).at(2) = true;
  for (ll i = 0; i < N; i++)
  {
    for (ll j = 0; j < 3; j++)
    {
      for (ll k = 0; k < 3; k++)
      {
        if (!dp.at(i).at(j).at(k))
          continue;
        for (ll nk = 0; nk < 2; nk++)
        {
          if (nk == 0 && S.at(i) == '1')
            continue;
          if (nk == 1 && S.at(i) == '0')
            continue;

          ll nj = (k == nk ? j + 1 : 1);
          if (nj == 3)
            continue;
          dp.at(i + 1).at(nj).at(nk) = true;
        }
      }
    }
  }

  for (ll j = 0; j < 3; j++)
  {
    for (ll k = 0; k < 2; k++)
    {
      if (dp.at(N).at(j).at(k))
        return true;
    }
  }
  return false;
}

bool solve(ll N, string S)
{
  for (ll b = 0; b < (1 << 4); b++)
  {
    string T = S;
    for (ll d = 0; d < 4; d++)
    {
      ll i = (N - 2 + d) % N;
      if (T.at(i) != '?')
        continue;
      if (b & (1 << d))
        T.at(i) = '1';
      else
        T.at(i) = '0';
    }
    if (T.at(N - 2) == T.at(N - 1) && T.at(N - 1) == T.at(0))
      continue;
    if (T.at(N - 1) == T.at(0) && T.at(0) == T.at(1))
      continue;
    //cerr << T << endl;
    if (sub(N, T))
      return true;
  }
  return false;
}

bool slow(ll N, string S)
{
  for (ll b = 0; b < (1 << N); b++)
  {
    string T = S;
    for (ll i = 0; i < N; i++)
    {
      if (T.at(i) != '?')
        continue;
      if (b & (1 << i))
        T.at(i) = '1';
      else
        T.at(i) = '0';
    }

    bool ok = true;
    for (ll i = 0; i < N; i++)
    {
      ll j = (i + 1) % N, k = (i + 2) % N;
      if (T.at(i) == T.at(j) && T.at(j) == T.at(k))
        ok = false;
    }
    if (ok)
      return true;
  }
  return false;
}

int main()
{
  /*
  for (ll t = 0; t < 100000; t++)
  {
    ll N = 3 + rand() % 5;
    string S;
    for (ll i = 0; i < N; i++)
    {
      S += "01?"[rand() % 3];
    }
    bool ans1 = slow(N, S), ans2 = solve(N, S);
    if (ans1 != ans2)
    {
      cout << N << endl;
      cout << S << endl;
      cout << ans1 << " " << ans2 << endl;
      return 0;
    }
    cerr << t << endl;
  }
  //*/

  //*
  ll T;
  cin >> T;
  while (T--)
  {
    ll N;
    string S;
    cin >> N >> S;
    cout << (solve(N, S) ? "Yes" : "No") << endl;
  }
  //*/
}
0