結果
問題 | No.2948 move move rotti |
ユーザー | torus711 |
提出日時 | 2024-10-25 22:31:52 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 431 ms / 4,000 ms |
コード長 | 4,839 bytes |
コンパイル時間 | 3,000 ms |
コンパイル使用メモリ | 172,008 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-25 22:32:01 |
合計ジャッジ時間 | 7,677 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,816 KB |
testcase_01 | AC | 3 ms
6,816 KB |
testcase_02 | AC | 3 ms
6,820 KB |
testcase_03 | AC | 371 ms
6,816 KB |
testcase_04 | AC | 16 ms
6,820 KB |
testcase_05 | AC | 3 ms
6,816 KB |
testcase_06 | AC | 3 ms
6,820 KB |
testcase_07 | AC | 35 ms
6,820 KB |
testcase_08 | AC | 372 ms
6,816 KB |
testcase_09 | AC | 371 ms
6,820 KB |
testcase_10 | AC | 3 ms
6,816 KB |
testcase_11 | AC | 3 ms
6,820 KB |
testcase_12 | AC | 33 ms
6,816 KB |
testcase_13 | AC | 99 ms
6,820 KB |
testcase_14 | AC | 27 ms
6,816 KB |
testcase_15 | AC | 417 ms
6,816 KB |
testcase_16 | AC | 431 ms
6,816 KB |
testcase_17 | AC | 409 ms
6,816 KB |
testcase_18 | AC | 330 ms
6,816 KB |
testcase_19 | AC | 191 ms
6,816 KB |
testcase_20 | AC | 227 ms
6,816 KB |
testcase_21 | AC | 425 ms
6,816 KB |
testcase_22 | AC | 147 ms
6,820 KB |
testcase_23 | AC | 343 ms
6,820 KB |
testcase_24 | AC | 100 ms
6,816 KB |
testcase_25 | AC | 160 ms
6,816 KB |
testcase_26 | AC | 5 ms
6,820 KB |
testcase_27 | AC | 3 ms
6,816 KB |
testcase_28 | AC | 15 ms
6,820 KB |
testcase_29 | AC | 3 ms
6,816 KB |
testcase_30 | AC | 5 ms
6,816 KB |
ソースコード
#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 <ranges> #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 VLL = vector< long long >; using VVLL = vector< vector< long long > >; template < typename T = int > using VT = vector< T >; template < typename T = int > using VVT = vector< VT< T > >; 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 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, typename V > auto make_vector( const int n, const V &v ) { return vector< T >( n, v ); } template < typename T, typename... TS > auto make_vector( const int n, TS... ts ) { return vector< decltype( make_vector< T >( forward< TS >( ts )...) ) >( n, make_vector< T >( forward< TS >( ts )... ) ); } template < typename T, typename V > auto make_vector0() { return vector< T >(); } template < typename T, typename... TS > auto make_vector0( const int n, TS... ts ) { return vector< decltype( make_vector0< T >( forward< TS >( ts )...) ) >( n, make_vector0< T >( forward< TS >( ts )... ) ); } 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 MAP_PRED( c ) transform( begin( c ), end( c ), begin( c ), bind( minus< int >(), _1, 1 ) ); #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 ̄|\/ // | |/ VI enumerate( const VVI &G, const int start ) { const int N = SZ( G ); static bool dp[ 1 << 16 ][ 16 ]; fill( AALL( dp ), false ); dp[ 1 << start ][ start ] = true; REP( s, 1 << N ) { REP( i, N ) { FOR( j, G[i] ) { if ( s & 1 << j ) { continue; } dp[ s | 1 << j ][j] |= dp[s][i]; } } } VI res( N ); REP( s, 1 << N ) { REP( i, N ) { if ( dp[s][i] ) { res[ __builtin_popcount( s ) - 1 ] |= 1 << i; } } } return res; } int main() { cin.tie( nullptr ); ios::sync_with_stdio( false ); cout << setprecision( 12 ) << fixed; IN( int, N, M, K ); VI X( K ); cin >> X; MAP_PRED( X ); VVI G( N ); REP( M ) { IN( int, u, v ); --u, --v; G[u].PB( v ); G[v].PB( u ); } VVI can_be_at_when; REP( u, N ) { can_be_at_when.EB( enumerate( G, u ) ); } REP( t, N ) { int s = ( 1 << N ) - 1; FOR( u, X ) { s &= can_be_at_when[u][t]; } if ( s ) { cout << "Yes" << endl; return 0; } } cout << "No" << endl; return 0; }