#911564 (C++17) No.2911 位相の公理

• 問題: No.2911 位相の公理
• ユーザー: 👑 p-adic
• 提出日時: 2023-09-08 11:51:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: TLE
• 実行時間: -
• コード長: 1,939 bytes
• コンパイル時間: 582 ms
• コンパイル使用メモリ: 71,556 KB
• 実行使用メモリ: 13,880 KB
• 最終ジャッジ日時: 2024-09-21 17:54:49
• 合計ジャッジ時間: 4,637 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 9,888 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	TLE	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-

ソースコード

// 誤解法（愚直O(M^3)解）チェック
#include <iostream>
#include <cassert>

using namespace std;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr )
#define CEXPR( LL , BOUND , VALUE ) constexpr const LL BOUND = VALUE
#define CIN( LL , A ) LL A; cin >> A
#define ASSERT( A , MIN , MAX ) assert( ( MIN ) <= A && A <= ( MAX ) )
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX )
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ )
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES )
#define QUIT return 0
#define COUT( ANSWER ) cout << ( ANSWER ) << "\n";
#define RETURN( ANSWER ) COUT( ANSWER ); QUIT

int main()
{
  UNTIE;
  CEXPR( int , bound_N , 16 );
  CIN_ASSERT( N , 1 , bound_N );
  CEXPR( int , bound_M , 1 << 12 );
  CIN_ASSERT( M , 1 , N < 12 ? 1 << N : bound_M );
  int s[bound_M] = {};
  string one = "1";
  int ambient = ( 1 << N ) - 1;
  bool found_zero = false;
  bool found_ambient = false;
  FOR( m , 0 , M ){
    int& s_m = s[m];
    CIN( string , s_bit );
    FOR( n , 0 , N ){
      ( s_m <<= 1 ) |= ( s_bit.substr( n , 1 ) == one ? 1 : 0 );
    }
    if( s_m == 0 ){
      found_zero = true;
    } else if( s_m == ambient ){
      found_ambient = true;
    }
  }
  if( ! found_zero || ! found_ambient ){
    RETURN( "No" );
  }
  FOR( m0 , 1 , M ){
    int& sm0 = s[m0];
    FOR( m1 , 0 , m0 ){
      int& sm1 = s[m1];
      int AND = sm0 & sm1;
      int OR = sm0 | sm1;
      bool found_AND = false;
      bool found_OR = false;
      FOR( m2 , 0 , M ){
	int& s_m2 = s[m2];
	if( s_m2 == AND ){
	  found_AND = true;
	} else if( s_m2 == OR ){
	  found_OR = true;
	}
      }
      if( ! found_AND || ! found_OR ){
	RETURN( "No" );
      }
    }
  }
  RETURN( "Yes" );
}