結果

問題 No.667 Mice's Luck(ネズミ達の運)
ユーザー watarimaycry2watarimaycry2
提出日時 2021-12-04 18:55:22
言語 JavaScript
(node v20.8.0)
結果
AC  
実行時間 207 ms / 2,000 ms
コード長 2,894 bytes
コンパイル時間 64 ms
コンパイル使用メモリ 5,332 KB
実行使用メモリ 60,448 KB
最終ジャッジ日時 2023-09-21 07:06:42
合計ジャッジ時間 3,314 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 91 ms
42,568 KB
testcase_01 AC 87 ms
42,528 KB
testcase_02 AC 87 ms
42,376 KB
testcase_03 AC 88 ms
42,680 KB
testcase_04 AC 91 ms
42,792 KB
testcase_05 AC 110 ms
48,008 KB
testcase_06 AC 158 ms
53,320 KB
testcase_07 AC 207 ms
60,448 KB
testcase_08 AC 129 ms
51,536 KB
testcase_09 AC 128 ms
53,648 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 if(code == 'long'){
			ret[i] = BigInt(next());
		}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 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 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 s = next();
	var N = s.length;
	var ok = 0;
	var ng = 0;
	for(var i = 0; i < N; i++){
		if(s[i] == "o"){
			ok++;
		}else{
			ng++;
		}
	}
	for(var i = 0; i < N; i++){
		myout(ok / (ok + ng) * 100);
		if(s[i] == "o"){
			ok--;
		}else{
			ng--;
		}
	}
}
0