#49256 (C++11) No.274 The Wall

• 問題: No.274 The Wall
• ユーザー: test
• 提出日時: 2015-09-15 18:38:48
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 10 ms / 2,000 ms
• コード長: 1,101 bytes
• コンパイル時間: 264 ms
• コンパイル使用メモリ: 23,680 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 02:06:26
• 合計ジャッジ時間: 1,198 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 6,816 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	0 ms; 6,944 KB
testcase_06	AC	0 ms; 6,940 KB
testcase_07	AC	0 ms; 6,940 KB
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	1 ms; 6,940 KB
testcase_10	AC	1 ms; 6,944 KB
testcase_11	AC	1 ms; 6,944 KB
testcase_12	AC	5 ms; 6,940 KB
testcase_13	AC	1 ms; 6,944 KB
testcase_14	AC	2 ms; 6,940 KB
testcase_15	AC	4 ms; 6,944 KB
testcase_16	AC	7 ms; 6,940 KB
testcase_17	AC	8 ms; 6,940 KB
testcase_18	AC	6 ms; 6,940 KB
testcase_19	AC	8 ms; 6,944 KB
testcase_20	AC	9 ms; 6,944 KB
testcase_21	AC	9 ms; 6,940 KB
testcase_22	AC	10 ms; 6,944 KB
testcase_23	AC	10 ms; 6,940 KB
testcase_24	AC	10 ms; 6,940 KB
testcase_25	AC	10 ms; 6,944 KB

コンパイルメッセージ

main.cpp: In function ‘int main(int, char**)’:
main.cpp:35:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   35 |         scanf("%d%d", &N, &_block::M);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:36:54: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   36 |         for(int k = 0; k < N; ++k){ tau[k] = k; scanf("%d%d", &block[k].L, &block[k].R); }
      |                                                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

#include <stdio.h>

struct _block{ 
	int L, R; 
public:
	static int M; 
}; 
int _block::M = 0; 

bool is_yes(int const N, _block *block, int *tau){
	int tau_id = N, T = -1; 
	int min_L = _block::M, min_id = tau_id, temp = 0, i = 0; 
	bool isTurn = false; 
	_block *p = NULL; 
	while(0 < tau_id){ 
		min_L = _block::M; min_id = tau_id; temp = 0; 
		isTurn = false; 
		for(i = 0; i < tau_id; ++i){
			p = block + tau[i]; 
			if(T < (temp = p->L                ) && min_L > temp){ min_L = temp; min_id = i; isTurn = false; }
			if(T < (temp = _block::M - 1 - p->R) && min_L > temp){ min_L = temp; min_id = i; isTurn = true ; }
		}
		if(tau_id == min_id){ return false; }
		if(!isTurn){ T = block[tau[min_id]].R; }else{ T = _block::M - 1 - block[tau[min_id]].L; }
		tau[min_id] = tau[tau_id - 1]; --tau_id; 
	}
	return true; 
}

int main(int argc, char *argv[]){
	_block block[2002]; 
	int tau[2002]; 
	int N = 0; 
	scanf("%d%d", &N, &_block::M);
	for(int k = 0; k < N; ++k){ tau[k] = k; scanf("%d%d", &block[k].L, &block[k].R); }

	printf("%s\n", ((is_yes(N, block, tau))? "YES" : "NO")); 
	return 0;
}