結果

問題 No.1362 [Zelkova 8th Tune] Black Sheep
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-22 21:35:45
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 179 ms / 1,000 ms
コード長 2,696 bytes
コンパイル時間 65 ms
コンパイル使用メモリ 5,376 KB
実行使用メモリ 46,720 KB
最終ジャッジ日時 2024-06-07 23:56:50
合計ジャッジ時間 7,217 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
40,576 KB
testcase_01 AC 75 ms
40,320 KB
testcase_02 AC 73 ms
40,448 KB
testcase_03 AC 82 ms
40,320 KB
testcase_04 AC 75 ms
40,576 KB
testcase_05 AC 74 ms
40,448 KB
testcase_06 AC 75 ms
40,192 KB
testcase_07 AC 74 ms
40,320 KB
testcase_08 AC 74 ms
40,192 KB
testcase_09 AC 75 ms
40,320 KB
testcase_10 AC 76 ms
40,320 KB
testcase_11 AC 73 ms
40,192 KB
testcase_12 AC 73 ms
40,192 KB
testcase_13 AC 179 ms
46,208 KB
testcase_14 AC 114 ms
45,824 KB
testcase_15 AC 85 ms
44,672 KB
testcase_16 AC 86 ms
44,672 KB
testcase_17 AC 111 ms
46,336 KB
testcase_18 AC 101 ms
45,312 KB
testcase_19 AC 105 ms
46,464 KB
testcase_20 AC 94 ms
45,568 KB
testcase_21 AC 98 ms
45,440 KB
testcase_22 AC 110 ms
46,208 KB
testcase_23 AC 120 ms
46,464 KB
testcase_24 AC 99 ms
46,720 KB
testcase_25 AC 111 ms
46,336 KB
testcase_26 AC 111 ms
46,464 KB
testcase_27 AC 126 ms
46,464 KB
testcase_28 AC 124 ms
46,464 KB
testcase_29 AC 113 ms
46,592 KB
testcase_30 AC 114 ms
46,336 KB
testcase_31 AC 104 ms
46,336 KB
testcase_32 AC 109 ms
46,720 KB
testcase_33 AC 97 ms
46,208 KB
testcase_34 AC 98 ms
46,080 KB
testcase_35 AC 75 ms
40,576 KB
testcase_36 AC 73 ms
40,320 KB
testcase_37 AC 72 ms
40,448 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 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 s = next();
	var map = {};
	for(var i = 0; i < s.length; i++){
		if(map[s[i]] == null){
			map[s[i]] = {
				index : i + 1,
				count : 0,
				v : s[i]
			};
		}
		map[s[i]].count++;
	}
	var key = Object.keys(map);
	var L = key[0];
	var R = key[1];
	myerr(map);
	if(map[L].count > map[R].count){
		myout(map[R].index + " " + map[R].v);
	}else{
		myout(map[L].index + " " + map[L].v);
	}
}
0