結果

問題 No.2210 equence Squence Seuence
ユーザー 👑 p-adic
提出日時 2022-11-29 11:39:27
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,529 bytes
コンパイル時間 10,839 ms
コンパイル使用メモリ 274,968 KB
最終ジャッジ日時 2025-02-09 02:07:34
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 10 TLE * 15
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize ( "O3" )
#pragma GCC target ( "avx" )
#include <bits/stdc++.h>
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 GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; 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 );
// |N| <= BOUNDを満たすNをSから構築
#define STOI( S , N , BOUND ) TYPE_OF( BOUND ) N = 0; { bool VARIABLE_FOR_POSITIVITY_FOR_STOI = true;  assert( S != "" ); if( S.substr( 0 , 1 ) == "-" ){ VARIABLE_FOR_POSITIVITY_FOR_STOI = false; S = S.substr( 1 ); assert( S != "" ); } assert( S.substr( 0 , 1 ) != " " ); while( S == "" ? false : S.substr( 0 , 1 ) != " " ){ assert( N < BOUND / 10 ? true : N == BOUND / 10 && stoi( S.substr( 0 , 1 ) ) <= BOUND % 10 ); N = N * 10 + stoi( S.substr( 0 , 1 ) ); S = S.substr( 1 ); } if( ! VARIABLE_FOR_POSITIVITY_FOR_STOI ){ N *= -1; } if( S != "" ){ S = S.substr( 1 ); } } 
// 1行で入力される変数の個数が適切か確認(半角空白の個数+1を調べる)
#define COUNT_VARIABLE( S , VARIABLE_NUMBER ) { int size = S.size(); int count = 0; for( int i = 0 ; i < size ; i++ ){ if( S.substr( i , 1 ) == " " ){ count++; } } assert( count + 1 == VARIABLE_NUMBER ); } 

inline CEXPR( int , bound_N , 200000 );

class Order
{
public:
  int m_A[bound_N];
  inline Order() : m_A() {};
  inline bool operator()( int i , int j ) const;
};

inline bool Order::operator()( int i , int j ) const
{
  if( i < j ){
    while( ++i <= j ){
      if( m_A[i] == 1 ){
	return false;
      } else if( m_A[i] == -1 ){
	return true;
      }
    }
    return false;
  } else if( j < i ){
    while( ++j <= i ){
      if( m_A[j] == 1 ){
	return true;
      } else if( m_A[j] == -1 ){
	return false;
      }
    }
    return false;
  }
  return false;
}

int main()
{
  UNTIE;
  CIN_ASSERT( N , 2 , bound_N );
  CIN_ASSERT( K , 1 , N );
  Order ord{};
  int A[bound_N];
  int coor[bound_N];
  int Ai;
  int Ai_prev = 0;
  FOR( i , 0 , N ){
    cin >> Ai;
    ASSERT( Ai , 1 , N );
    A[i] = Ai;
    ord.m_A[i] = ( Ai_prev < Ai ? 1 : Ai_prev == Ai ? 0 : -1 );
    Ai_prev = Ai;
    coor[i] = i;
  }
  CHECK_REDUNDANT_INPUT;
  sort( coor , coor + N , ord );
  int i0 = coor[K-1];
  if( i0 == 0 ){
    FOR( i , 1 , N ){
      if( i > 1 ){
	cout << " " << A[i];
      } else {
	cout << A[i];
      }
    }
  } else {
    FOR( i , 0 , N ){
      if( i != i0 ){
	if( i > 0 ){
	  cout << " " << A[i];
	} else {
	  cout << A[i];
	}
      }
    }
  }
  RETURN( "" );
}
0