結果

問題 No.135 とりあえず1次元の問題
ユーザー HiroakiSoftware
提出日時 2015-01-26 00:38:56
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
TLE  
実行時間 -
コード長 1,573 bytes
コンパイル時間 285 ms
コンパイル使用メモリ 28,800 KB
実行使用メモリ 10,752 KB
最終ジャッジ日時 2025-01-03 03:10:45
合計ジャッジ時間 21,405 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20 TLE * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:18:15: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   18 |         scanf ( "%d" , &BufNums );
      |         ~~~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:26:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   26 |                 scanf ( "%d" , pBuf + i );
      |                 ~~~~~~^~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <stdio.h>



int *pX = nullptr;
int N = 0;


int GetDiff ( int idx1 , int idx2 );


int main ( void ) {


	int *pBuf;
	int BufNums;

	scanf ( "%d" , &BufNums );

	pBuf = new int  [ BufNums ];
	pX =  new int  [ BufNums ];
	N = 0;


	for ( int i = 0; i < BufNums; i++ ) {
		scanf ( "%d" , pBuf + i );
	}

	bool bExistNumber;
	for ( int i = 0; i < BufNums; i++ ) {
		bExistNumber = false;

		for ( int j = 0; j < N; j++ ) {
			if ( *( pX + j ) == *( pBuf + i ) ) {

				bExistNumber = true;
				break;
			}

		}
		if ( bExistNumber == false ) {
			*( pX + N ) = *( pBuf + i );
			N++;
		}
	}

	int diff = 0 , diffbuf;

	for ( int i = 0; i < ( N - 1 ); i++ ) {
		//printf ( "Call\n" );
		if ( i == 0 ) {

			diff = GetDiff ( i , i + 1 );

		} else {
			diffbuf = GetDiff ( i , i + 1 );
			if ( diffbuf != -1 ) {
				if ( diffbuf < diff ) diff = diffbuf;
			}
		}
		if ( diff == 1 )break;
	}
	delete []pX;
	delete []pBuf;

	if ( diff == -1 ) diff = 0;
	printf ( "%d\n" , diff );
	return 0;
}

int GetDiff ( int idx1 , int idx2 ) {
	//printf ( "%d %d\n" , idx1 , idx2 );
	bool bEnableCurrent = false;
	int Current;

	if ( *( pX + idx1 ) != *( pX + idx2 ) ) {
		bEnableCurrent = true;
		Current = *( pX + idx1 ) - *( pX + idx2 );
		if ( Current < 0 ) Current *= -1;
		if ( Current == 1 ) return Current;
	}

	int diff= -1 , idxnext;

	idxnext = idx2 + 1;
	diff = ( idxnext < N ) ? GetDiff ( idx1 , idxnext ) : -1;

	if ( diff == 1 )return diff;

	if ( bEnableCurrent ) {
		if (diff != -1 )return ( Current < diff ) ? Current : diff;
		return Current;
	}
	return diff;

}
0