結果

問題 No.1470 Mex Sum
ユーザー watarimaycry2watarimaycry2
提出日時 2021-04-10 00:00:24
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 186 ms / 2,000 ms
コード長 2,936 bytes
コンパイル時間 101 ms
コンパイル使用メモリ 5,212 KB
実行使用メモリ 62,532 KB
最終ジャッジ日時 2023-09-07 19:00:15
合計ジャッジ時間 10,777 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
42,672 KB
testcase_01 AC 86 ms
42,684 KB
testcase_02 AC 123 ms
47,904 KB
testcase_03 AC 111 ms
48,072 KB
testcase_04 AC 112 ms
47,820 KB
testcase_05 AC 118 ms
48,052 KB
testcase_06 AC 112 ms
48,016 KB
testcase_07 AC 111 ms
47,932 KB
testcase_08 AC 112 ms
48,036 KB
testcase_09 AC 115 ms
47,904 KB
testcase_10 AC 114 ms
49,948 KB
testcase_11 AC 113 ms
47,956 KB
testcase_12 AC 184 ms
60,392 KB
testcase_13 AC 182 ms
60,228 KB
testcase_14 AC 186 ms
60,112 KB
testcase_15 AC 176 ms
60,256 KB
testcase_16 AC 176 ms
60,148 KB
testcase_17 AC 175 ms
59,928 KB
testcase_18 AC 174 ms
60,072 KB
testcase_19 AC 176 ms
60,076 KB
testcase_20 AC 181 ms
60,092 KB
testcase_21 AC 179 ms
60,564 KB
testcase_22 AC 179 ms
60,604 KB
testcase_23 AC 178 ms
62,476 KB
testcase_24 AC 179 ms
60,328 KB
testcase_25 AC 179 ms
60,504 KB
testcase_26 AC 179 ms
60,368 KB
testcase_27 AC 182 ms
60,384 KB
testcase_28 AC 180 ms
60,440 KB
testcase_29 AC 179 ms
60,304 KB
testcase_30 AC 181 ms
62,532 KB
testcase_31 AC 178 ms
60,396 KB
testcase_32 AC 177 ms
60,384 KB
testcase_33 AC 179 ms
60,356 KB
testcase_34 AC 179 ms
60,560 KB
testcase_35 AC 180 ms
60,340 KB
testcase_36 AC 180 ms
60,420 KB
testcase_37 AC 154 ms
58,456 KB
testcase_38 AC 152 ms
56,240 KB
testcase_39 AC 162 ms
55,748 KB
testcase_40 AC 156 ms
57,696 KB
testcase_41 AC 156 ms
56,248 KB
testcase_42 AC 156 ms
55,804 KB
testcase_43 AC 155 ms
56,460 KB
testcase_44 AC 156 ms
55,912 KB
testcase_45 AC 163 ms
58,484 KB
testcase_46 AC 157 ms
55,756 KB
testcase_47 AC 157 ms
55,824 KB
testcase_48 AC 157 ms
56,424 KB
testcase_49 AC 156 ms
55,792 KB
testcase_50 AC 158 ms
57,692 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 list = nextIntArray(N);
	var map = {
		"1" : 0,
		"2" : 0,
		"3" : 0
	};
	for(var i = 0; i < N; i++){
		if(list[i] == 1 || list[i] == 2){
			map[list[i]]++;
		}else{
			map[3]++;
		}
	}
	var output = 0;
	output += (map[1] * (map[1] - 1) / 2) * 2;
	output += map[1] * map[2] * 3;
	output += map[1] * map[3] * 2;
	output += (map[2] * (map[2] - 1) / 2);
	output += map[2] * map[3];
	output += (map[3] * (map[3] - 1) / 2);
	myout(output);
}
0