結果

問題 No.1505 Zero-Product Ranges
ユーザー watarimaycry2watarimaycry2
提出日時 2021-05-14 23:45:20
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 231 ms / 2,000 ms
コード長 2,902 bytes
コンパイル時間 251 ms
コンパイル使用メモリ 6,816 KB
実行使用メモリ 58,320 KB
最終ジャッジ日時 2024-10-02 05:59:49
合計ジャッジ時間 9,775 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
42,448 KB
testcase_01 AC 76 ms
42,320 KB
testcase_02 AC 75 ms
42,484 KB
testcase_03 AC 231 ms
54,196 KB
testcase_04 AC 146 ms
56,628 KB
testcase_05 AC 111 ms
51,264 KB
testcase_06 AC 114 ms
49,220 KB
testcase_07 AC 109 ms
48,408 KB
testcase_08 AC 104 ms
48,620 KB
testcase_09 AC 109 ms
50,592 KB
testcase_10 AC 110 ms
50,872 KB
testcase_11 AC 114 ms
52,320 KB
testcase_12 AC 108 ms
49,864 KB
testcase_13 AC 129 ms
52,724 KB
testcase_14 AC 119 ms
52,836 KB
testcase_15 AC 146 ms
57,736 KB
testcase_16 AC 144 ms
55,036 KB
testcase_17 AC 144 ms
55,096 KB
testcase_18 AC 143 ms
55,224 KB
testcase_19 AC 77 ms
42,216 KB
testcase_20 AC 78 ms
40,192 KB
testcase_21 AC 76 ms
40,576 KB
testcase_22 AC 142 ms
54,460 KB
testcase_23 AC 145 ms
58,320 KB
testcase_24 AC 150 ms
56,164 KB
testcase_25 AC 139 ms
57,784 KB
testcase_26 AC 143 ms
56,168 KB
testcase_27 AC 143 ms
55,832 KB
testcase_28 AC 143 ms
58,028 KB
testcase_29 AC 143 ms
56,684 KB
testcase_30 AC 140 ms
55,084 KB
testcase_31 AC 140 ms
58,224 KB
testcase_32 AC 117 ms
50,180 KB
testcase_33 AC 111 ms
50,312 KB
testcase_34 AC 117 ms
49,936 KB
testcase_35 AC 114 ms
49,732 KB
testcase_36 AC 113 ms
49,928 KB
testcase_37 AC 115 ms
50,140 KB
testcase_38 AC 116 ms
50,180 KB
testcase_39 AC 116 ms
49,980 KB
testcase_40 AC 119 ms
50,152 KB
testcase_41 AC 120 ms
50,028 KB
testcase_42 AC 93 ms
45,440 KB
testcase_43 AC 94 ms
47,476 KB
testcase_44 AC 94 ms
47,820 KB
testcase_45 AC 93 ms
47,476 KB
testcase_46 AC 92 ms
47,052 KB
testcase_47 AC 96 ms
47,820 KB
testcase_48 AC 93 ms
45,568 KB
testcase_49 AC 90 ms
45,184 KB
testcase_50 AC 94 ms
45,568 KB
testcase_51 AC 97 ms
45,696 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 N = nextInt();
	var list = nextIntArray(N);
	var sum = N * (N + 1) / 2;
	var count = 0;
	for(var i = 0; i < N; i++){
		if(list[i] == 0){
			sum -= count * (count + 1) / 2;
			count = 0;
		}else{
			count++;
		}
	}
	sum -= count * (count + 1) / 2;
	myout(sum);
}
0