結果
問題 | No.2283 Prohibit Three Consecutive |
ユーザー | akiaa11 |
提出日時 | 2023-08-22 16:10:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 3,486 bytes |
コンパイル時間 | 4,685 ms |
コンパイル使用メモリ | 264,948 KB |
実行使用メモリ | 10,044 KB |
最終ジャッジ日時 | 2024-05-09 21:57:13 |
合計ジャッジ時間 | 5,747 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 38 ms
7,424 KB |
testcase_04 | AC | 37 ms
6,656 KB |
testcase_05 | AC | 54 ms
5,376 KB |
testcase_06 | AC | 54 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 39 ms
9,796 KB |
testcase_09 | AC | 28 ms
9,856 KB |
testcase_10 | AC | 26 ms
9,856 KB |
testcase_11 | AC | 25 ms
10,044 KB |
testcase_12 | AC | 34 ms
5,376 KB |
testcase_13 | AC | 69 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)n-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} constexpr ll INF=numeric_limits<ll>::max() / 4; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int t;cin>>t; int n; string s; int dp[200010][8]; rep(ti, t){ cin>>n>>s; s += s; int a = 0; rep(i, 3) a += ((s[i] == '?') << i); int u = 0; rep(k, 8){ rep(i, 3) if(a >> i & 1){ s[i] = s[n + i] = "10"[k >> i & 1]; } rep(i, s.size() + 1) rep(j, 8) dp[i][j] = 0; dp[0][0] = 1; rep(i, s.size()) rep(j, 8) if(dp[i][j]){ int u = j << 1; u &= 7; if((s[i] == '?' || s[i] == '0') && (u != 0 || i <= 1)) dp[i + 1][u] = 1; if((s[i] == '?' || s[i] == '1') && u != 6) dp[i + 1][u | 1] = 1; } rep(i, 8) u |= dp[s.size()][i]; } cout<<vecs{"Yes", "No"}[!u]<<endl; } }