結果

問題 No.1465 Archaea
ユーザー watarimaycry2watarimaycry2
提出日時 2021-04-02 23:25:24
言語 JavaScript
(node v21.7.1)
結果
WA  
実行時間 -
コード長 2,943 bytes
コンパイル時間 85 ms
コンパイル使用メモリ 5,480 KB
実行使用メモリ 44,692 KB
最終ジャッジ日時 2023-08-25 13:55:43
合計ジャッジ時間 3,772 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 75 ms
44,344 KB
testcase_01 AC 74 ms
42,672 KB
testcase_02 AC 78 ms
42,180 KB
testcase_03 AC 75 ms
42,248 KB
testcase_04 AC 77 ms
42,180 KB
testcase_05 AC 80 ms
42,628 KB
testcase_06 AC 78 ms
42,604 KB
testcase_07 WA -
testcase_08 AC 83 ms
42,244 KB
testcase_09 AC 83 ms
42,404 KB
testcase_10 AC 85 ms
42,348 KB
testcase_11 WA -
testcase_12 AC 75 ms
42,144 KB
testcase_13 AC 73 ms
42,120 KB
testcase_14 AC 77 ms
42,696 KB
testcase_15 AC 74 ms
42,124 KB
testcase_16 AC 78 ms
42,316 KB
testcase_17 WA -
testcase_18 AC 76 ms
42,428 KB
testcase_19 AC 74 ms
44,164 KB
testcase_20 AC 81 ms
42,184 KB
testcase_21 AC 79 ms
42,424 KB
testcase_22 AC 78 ms
42,244 KB
testcase_23 AC 75 ms
42,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//Don't have to see. start------------------------------------------
var read = require('readline').createInterface({
	input: process.stdin, output: process.stdout
});
var obj; var inLine = []; var outputList = [];var retcode = new Set();
read.on('line', function(input){
	var tmp = input.split(' ');
	for(var i = 0; i < tmp.length; i++){
		inLine.push(tmp[i]);
		if(i == tmp.length - 1){
			retcode.add(inLine.length);
		}
	}
});
read.on('close', function(){
	obj = init(inLine);
	console.error('\n↑入力 ↓出力');
	Main();
	console.log(myconv(outputList, 9));
});
function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}
function nextArray(size, code){
	var ret = new Array(size);
	for(var i = 0; i < size; i++){
		if(code == 'int'){
			ret[i] = nextInt();
		}else{
			ret[i] = next();
		}
	}
	return ret;
}
function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');}
function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);}
function getCountMap(list){
	var map = {};
	for(var i = 0; i < list.length; i++){
		if(map[list[i]] == null){
			map[list[i]] = 0;
		}
		map[list[i]]++;
	}
	return map;
}
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';}},
		isReturn : function(){return retcode.has(this.index);}
	};
}
function myout(s){outputList.push(s);}
function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}
function isReturn(){return obj.isReturn();}
//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 N = nextInt();
	var K = nextInt();
	var used = new Set([1]);
	var queue = [[1,0]];
	while(queue.length > 0){
		var tmp = queue.shift();
		var now = tmp[0];
		var count = tmp[1];
		if((N - now) % 3 == 0){
			//myerr({now, count});
			var diff = N - now;
			if(diff / 3 <= K - count){
				myout("YES");
				return;
			}
		}
		if(count + 1 <= K && !used.has(now * 2) && now * 2 <= N){
			used.has(now * 2);
			queue.push([now * 2, count + 1]);
		}
	}
	myout("NO");
}
0