結果

問題 No.1205 Eye Drops
ユーザー watarimaycry2watarimaycry2
提出日時 2020-10-10 13:51:55
言語 JavaScript
(node v20.8.0)
結果
AC  
実行時間 366 ms / 2,000 ms
コード長 2,081 bytes
コンパイル時間 134 ms
コンパイル使用メモリ 5,292 KB
実行使用メモリ 69,748 KB
最終ジャッジ日時 2023-09-27 21:24:10
合計ジャッジ時間 7,498 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 84 ms
42,528 KB
testcase_01 AC 89 ms
42,436 KB
testcase_02 AC 87 ms
42,772 KB
testcase_03 AC 85 ms
42,748 KB
testcase_04 AC 85 ms
42,576 KB
testcase_05 AC 86 ms
42,864 KB
testcase_06 AC 86 ms
42,752 KB
testcase_07 AC 84 ms
42,636 KB
testcase_08 AC 85 ms
42,992 KB
testcase_09 AC 86 ms
42,964 KB
testcase_10 AC 89 ms
42,848 KB
testcase_11 AC 89 ms
42,952 KB
testcase_12 AC 86 ms
42,932 KB
testcase_13 AC 85 ms
42,608 KB
testcase_14 AC 86 ms
42,940 KB
testcase_15 AC 86 ms
42,860 KB
testcase_16 AC 86 ms
42,788 KB
testcase_17 AC 86 ms
42,792 KB
testcase_18 AC 85 ms
42,656 KB
testcase_19 AC 89 ms
44,824 KB
testcase_20 AC 89 ms
42,820 KB
testcase_21 AC 87 ms
42,784 KB
testcase_22 AC 88 ms
42,880 KB
testcase_23 AC 87 ms
42,628 KB
testcase_24 AC 87 ms
42,792 KB
testcase_25 AC 86 ms
42,956 KB
testcase_26 AC 87 ms
42,980 KB
testcase_27 AC 87 ms
42,696 KB
testcase_28 AC 88 ms
42,576 KB
testcase_29 AC 86 ms
42,740 KB
testcase_30 AC 87 ms
42,804 KB
testcase_31 AC 88 ms
42,680 KB
testcase_32 AC 203 ms
60,676 KB
testcase_33 AC 201 ms
60,720 KB
testcase_34 AC 202 ms
60,556 KB
testcase_35 AC 200 ms
60,612 KB
testcase_36 AC 202 ms
60,684 KB
testcase_37 AC 366 ms
69,748 KB
testcase_38 AC 87 ms
42,584 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

//Don't have to see. start------------------------------------------
var read = require('readline').createInterface({
	input: process.stdin, output: process.stdout
});
var obj; var inLine = [];
read.on('line', function(input){inLine.push(input);});
read.on('close', function(){
	obj = init(inLine);
	console.error('\n↑入力 ↓出力');
	Main();
});
function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}
function nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}
function nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();}
function init(input){  
	return {
		list : input, index : 0, max : input.length,
		hasNext : function(){return (this.index < this.max);},
		next : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}}
	};
}
function myout(s){console.log(s);}
function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}
//param "no" is
//unknown or outlier : return i. 1: parseInt.
//2: split space. 4: split space and parseInt.
//6: split 1 character. 7: split 1 character and parseInt.
//8: join space. 9: join nextline. 0: join no character.
function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\n');case 0:return i.join('');default:return i;}}catch(e){return i;}}

//Don't have to see. end------------------------------------------
function Main(){
	var one = nextIntArray();
	var N = one[0];
	var M = one[1];
	var now = 0;
	var t = 0;
	for(var i = 0; i < M; i++){
		var tmp = nextIntArray();
		var ti = tmp[0];
		var pi = tmp[1];
		if(Math.abs(ti - t) < Math.abs(now - pi)){
			myout("No");
			return;
		}else{
			t = ti;
			now = pi;
		}
	}
	myout("Yes");
}
0