結果
| 問題 | No.1205 Eye Drops | 
| コンテスト | |
| ユーザー |  watarimaycry2 | 
| 提出日時 | 2020-10-10 13:51:55 | 
| 言語 | JavaScript (node v23.5.0) | 
| 結果 | 
                                AC
                                 
                             | 
| 実行時間 | 321 ms / 2,000 ms | 
| コード長 | 2,081 bytes | 
| コンパイル時間 | 145 ms | 
| コンパイル使用メモリ | 5,120 KB | 
| 実行使用メモリ | 60,256 KB | 
| 最終ジャッジ日時 | 2024-07-20 15:55:59 | 
| 合計ジャッジ時間 | 6,248 ms | 
| ジャッジサーバーID (参考情報) | judge4 / judge2 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 2 | 
| other | AC * 37 | 
ソースコード
//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");
}
            
            
            
        