結果
問題 | No.2283 Prohibit Three Consecutive |
ユーザー |
![]() |
提出日時 | 2023-04-28 21:39:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,674 bytes |
コンパイル時間 | 1,091 ms |
コンパイル使用メモリ | 116,856 KB |
最終ジャッジ日時 | 2025-02-12 14:59:49 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 3 WA * 9 TLE * 1 |
ソースコード
#include <iostream>#include <iomanip>#include <sstream>#include <vector>#include <string>#include <set>#include <unordered_set>#include <map>#include <unordered_map>#include <stack>#include <queue>#include <deque>#include <algorithm>#include <functional>#include <iterator>#include <limits>#include <numeric>#include <utility>#include <type_traits>#include <cmath>#include <cassert>#include <cstdio>using namespace std;using namespace placeholders;using LL = long long;using ULL = unsigned long long;using VI = vector< int >;using VVI = vector< vector< int > >;using VS = vector< string >;using ISS = istringstream;using OSS = ostringstream;using PII = pair< int, int >;using VPII = vector< pair< int, int > >;template < typename T = int > using VT = vector< T >;template < typename T = int > using VVT = vector< vector< T > >;template < typename T = int > using LIM = numeric_limits< T >;template < typename T = int > using OSI = ostream_iterator< T >;template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i) << v[i]; } return s; }void in_impl(){};template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }#define NUMBERED( name, number ) NUMBERED2( name, number )#define NUMBERED2( name, number ) name ## _ ## number#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )#define REP2( i, n ) REP3( i, 0, n )#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )#define GET_REP( a, b, c, F, ... ) F#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )#define FOR( e, c ) for ( auto &&e : c )#define ALL( c ) begin( c ), end( c )#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof(remove_all_extents< decltype( a ) >::type )#define SZ( v ) ( (int)( v ).size() )#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }#define PB push_back#define EM emplace#define EB emplace_back#define BI back_inserter#define MP make_pair#define fst first#define snd second#define DUMP( x ) cerr << #x << " = " << ( x ) << endl// Λ Λ__// /(*゚ー゚)/\// /|  ̄U U ̄|\/// | |/bool solve(){IN( int, N );IN( string, S );N *= 2;S += S;static int dp[ 1 << 18 ][4];fill( AALL( dp ), 0 );dp[0][0] = 1;REP( i, N ){REP( j, 4 ){REP( k, 2 ){if ( S[i] != '?' && S[i] - '0' != k ||j == 0 && k == 0 || j == 3 && k == 1 ){continue;}dp[ i + 1 ][ ( ( j << 1 ) % 4 ) | k ] |= dp[i][j];}}}REP( j, 4 ){if ( dp[N][j] ){return true;}}return false;}int main(){cin.tie( nullptr );ios::sync_with_stdio( false );cout << setprecision( 12 ) << fixed;IN( int, T );REP( T ){cout << ( solve() ? "Yes" : "No" ) << '\n';}cout << flush;return 0;}