結果

問題 No.2064 Smallest Sequence on Grid
ユーザー watarimaycry2watarimaycry2
提出日時 2022-09-02 21:36:51
言語 JavaScript
(node v21.7.1)
結果
WA  
実行時間 -
コード長 3,318 bytes
コンパイル時間 265 ms
コンパイル使用メモリ 7,076 KB
実行使用メモリ 63,412 KB
最終ジャッジ日時 2024-11-16 02:37:28
合計ジャッジ時間 8,799 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
40,192 KB
testcase_01 AC 68 ms
40,448 KB
testcase_02 AC 70 ms
40,064 KB
testcase_03 AC 69 ms
42,192 KB
testcase_04 AC 68 ms
40,064 KB
testcase_05 AC 71 ms
42,100 KB
testcase_06 AC 73 ms
40,064 KB
testcase_07 AC 71 ms
40,448 KB
testcase_08 AC 76 ms
42,324 KB
testcase_09 AC 76 ms
42,320 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 177 ms
61,156 KB
testcase_27 WA -
testcase_28 AC 166 ms
61,124 KB
testcase_29 AC 157 ms
58,864 KB
testcase_30 WA -
権限があれば一括ダウンロードができます

ソースコード

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 if(code == 'long'){
			ret[i] = nextLong();
		}else if(code == 'double'){
			ret[i] = nextDouble();
		}else{
			ret[i] = next();
		}
	}
	return ret;
}
function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');} function nextLongArray(size){return nextArray(size, 'long');} function nextDoubleArray(size){return nextArray(size, 'double');}
function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);} function nextLong(){return BigInt(next());} function nextDouble(){return parseFloat(next());}
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 H = nextInt();
	var W = nextInt();
	var alpha = "abcdefghijklmnopqrstuvwxyz";
	var list = nextStrArray(H);
	var y = 0;
	var x = 0;
	var output = [];
	while(true){
		output.push(list[y][x]);
		if(y == H - 1 && x == W - 1){
			break;
		}
		if(y < H - 1 && x < W - 1){
			var nextY = list[y + 1][x];
			var nextX = list[y][x + 1];
			if(alpha.indexOf(nextY) < alpha.indexOf(nextX)){
				y++;
			}else{
				x++;
			}
			continue;
		}else if(y < H - 1){
			y++;
		}else{
			x++;
		}
	}
	myout(myconv(output, 0));
}
0