#811234 (C++17) No.2126 MEX Game

• 問題: No.2126 MEX Game
• ユーザー: 👑 p-adic
• 提出日時: 2022-10-27 10:19:21
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 1,884 bytes
• コンパイル時間: 2,819 ms
• コンパイル使用メモリ: 202,148 KB
• 実行使用メモリ: 4,348 KB
• 最終ジャッジ日時: 2023-10-19 05:25:01
• 合計ジャッジ時間: 3,734 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,348 KB
testcase_01	AC	2 ms; 4,348 KB
testcase_02	AC	2 ms; 4,348 KB
testcase_03	AC	2 ms; 4,348 KB
testcase_04	AC	3 ms; 4,348 KB
testcase_05	AC	2 ms; 4,348 KB
testcase_06	AC	2 ms; 4,348 KB
testcase_07	WA	-
testcase_08	AC	2 ms; 4,348 KB
testcase_09	AC	2 ms; 4,348 KB
testcase_10	AC	30 ms; 4,348 KB
testcase_11	AC	30 ms; 4,348 KB
testcase_12	AC	30 ms; 4,348 KB
testcase_13	AC	30 ms; 4,348 KB
testcase_14	AC	31 ms; 4,348 KB
testcase_15	AC	31 ms; 4,348 KB
testcase_16	AC	30 ms; 4,348 KB
testcase_17	AC	24 ms; 4,348 KB
testcase_18	AC	26 ms; 4,348 KB
testcase_19	AC	17 ms; 4,348 KB
testcase_20	AC	17 ms; 4,348 KB
testcase_21	AC	31 ms; 4,348 KB
testcase_22	AC	2 ms; 4,348 KB
testcase_23	AC	2 ms; 4,348 KB
testcase_24	AC	2 ms; 4,348 KB
testcase_25	AC	2 ms; 4,348 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	3 ms; 4,348 KB
testcase_29	WA	-

ソースコード

// Writer解チェック
#include<bits/stdc++.h>
using namespace std;

using ll = long long;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#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 FOREQ( VAR , INITIAL , FINAL ) for( TYPE_OF( FINAL ) VAR = INITIAL ; VAR <= FINAL ; VAR ++ )  
#define QUIT return 0 
#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; QUIT 

#define CHECK_REDUNDANT_INPUT string VARIABLE_FOR_CHECK_REDUNDANT_INPUT = ""; cin >> VARIABLE_FOR_CHECK_REDUNDANT_INPUT; assert( VARIABLE_FOR_CHECK_REDUNDANT_INPUT == "" ); assert( ! cin );
// #define CHECK_REDUNDANT_INPUT string VARIABLE_FOR_CHECK_REDUNDANT_INPUT = ""; getline( cin , VARIABLE_FOR_CHECK_REDUNDANT_INPUT ); assert( VARIABLE_FOR_CHECK_REDUNDANT_INPUT == "" ); assert( ! cin );

int main()
{
  constexpr const int bound = 100000;
  CIN_ASSERT( N , 1 , bound );
  int count[bound + 1] = {};
  int Ai;
  int lim_Ai = 0;
  FOREQ( i , 1 , N ){
    cin >> Ai;
    ASSERT( Ai , 0 , bound );
    if( lim_Ai < Ai ){
      lim_Ai = Ai;
    }
    count[Ai]++;
  }
  CHECK_REDUNDANT_INPUT;
  bool found_3 = false;
  int count_a;
  lim_Ai++;
  FOREQ( a , 0 , lim_Ai ){
    count_a = count[a];
    if( count_a == 0 ){
      RETURN( a );
    } else if( count_a == 1 ){
      if( found_3 ){
	RETURN( a );
      }
      FOREQ( b , a + 1 , lim_Ai ){
	count_a = count[b];
	if( count_a == 0 ){
	  if( b * 2 - 1 == N ){
	    RETURN( b - 1 );
	  } else {
	    RETURN( b );
	  }
	} else if( count_a == 1 ){
	  RETURN( b );
	} else if( count_a > 2 ){
	  RETURN( a );
	}
      }
    } else if( found_3 ? false : count_a > 2 ){
      found_3 = true;
    }
  }
  QUIT;
}