結果
問題 | No.1470 Mex Sum |
ユーザー | watarimaycry2 |
提出日時 | 2021-04-10 00:00:24 |
言語 | JavaScript (node v21.7.1) |
結果 |
AC
|
実行時間 | 170 ms / 2,000 ms |
コード長 | 2,936 bytes |
コンパイル時間 | 76 ms |
コンパイル使用メモリ | 6,944 KB |
実行使用メモリ | 57,764 KB |
最終ジャッジ日時 | 2024-06-25 12:46:35 |
合計ジャッジ時間 | 10,911 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
40,448 KB |
testcase_01 | AC | 73 ms
40,192 KB |
testcase_02 | AC | 130 ms
46,848 KB |
testcase_03 | AC | 97 ms
46,464 KB |
testcase_04 | AC | 97 ms
46,464 KB |
testcase_05 | AC | 96 ms
46,720 KB |
testcase_06 | AC | 98 ms
46,720 KB |
testcase_07 | AC | 96 ms
46,464 KB |
testcase_08 | AC | 99 ms
46,336 KB |
testcase_09 | AC | 99 ms
46,336 KB |
testcase_10 | AC | 99 ms
46,720 KB |
testcase_11 | AC | 98 ms
46,720 KB |
testcase_12 | AC | 163 ms
57,320 KB |
testcase_13 | AC | 161 ms
57,452 KB |
testcase_14 | AC | 160 ms
57,212 KB |
testcase_15 | AC | 162 ms
57,344 KB |
testcase_16 | AC | 162 ms
57,172 KB |
testcase_17 | AC | 165 ms
57,092 KB |
testcase_18 | AC | 160 ms
57,044 KB |
testcase_19 | AC | 163 ms
57,104 KB |
testcase_20 | AC | 163 ms
57,080 KB |
testcase_21 | AC | 166 ms
57,272 KB |
testcase_22 | AC | 168 ms
57,596 KB |
testcase_23 | AC | 166 ms
57,360 KB |
testcase_24 | AC | 165 ms
57,432 KB |
testcase_25 | AC | 170 ms
57,316 KB |
testcase_26 | AC | 163 ms
57,436 KB |
testcase_27 | AC | 164 ms
57,424 KB |
testcase_28 | AC | 169 ms
57,472 KB |
testcase_29 | AC | 165 ms
57,764 KB |
testcase_30 | AC | 167 ms
57,560 KB |
testcase_31 | AC | 168 ms
57,628 KB |
testcase_32 | AC | 165 ms
57,572 KB |
testcase_33 | AC | 165 ms
57,572 KB |
testcase_34 | AC | 170 ms
57,592 KB |
testcase_35 | AC | 163 ms
57,424 KB |
testcase_36 | AC | 163 ms
57,344 KB |
testcase_37 | AC | 136 ms
54,200 KB |
testcase_38 | AC | 139 ms
54,456 KB |
testcase_39 | AC | 139 ms
54,200 KB |
testcase_40 | AC | 141 ms
54,524 KB |
testcase_41 | AC | 142 ms
54,328 KB |
testcase_42 | AC | 141 ms
54,200 KB |
testcase_43 | AC | 140 ms
54,196 KB |
testcase_44 | AC | 143 ms
54,204 KB |
testcase_45 | AC | 141 ms
54,324 KB |
testcase_46 | AC | 142 ms
54,324 KB |
testcase_47 | AC | 142 ms
54,144 KB |
testcase_48 | AC | 141 ms
54,324 KB |
testcase_49 | AC | 142 ms
54,136 KB |
testcase_50 | AC | 142 ms
54,324 KB |
ソースコード
//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); }