結果

問題 No.1134 Deviation Score Ⅱ
ユーザー watarimaycry2watarimaycry2
提出日時 2020-08-18 14:55:57
言語 JavaScript
(node v21.7.1)
結果
WA  
実行時間 -
コード長 2,369 bytes
コンパイル時間 179 ms
コンパイル使用メモリ 7,072 KB
実行使用メモリ 54,196 KB
最終ジャッジ日時 2024-10-12 02:43:57
合計ジャッジ時間 4,708 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 84 ms
42,616 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 102 ms
47,880 KB
testcase_05 WA -
testcase_06 AC 96 ms
47,828 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 92 ms
48,196 KB
testcase_10 AC 79 ms
40,832 KB
testcase_11 AC 110 ms
49,736 KB
testcase_12 WA -
testcase_13 AC 123 ms
51,272 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 89 ms
45,696 KB
testcase_17 AC 103 ms
47,616 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 79 ms
40,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//Don't have to see. start------------------------------------------
var read = require('readline').createInterface({
  input: process.stdin, output: process.stdout
});
var obj; var inLine = [];
read.on('line', function(input){inLine.push(input);});
read.on('close', function(){
  obj = init(inLine);
  console.error('\n');
  var start = Date.now();
  Main();
  var end = Date.now() - start;
  myerr('time : ' + end + 'ms');
  myerr('memory : ' + Math.round(process.memoryUsage().heapTotal / 1024) + 'KB');
});
function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}
function nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}
function nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();}
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';}}
  };
}
function myout(s){console.log(s);}
function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}
//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();
  var M = nextInt() - 1;
  var sum = 0;
  for(var i = 0; i < N; i++){
    sum += list[i];
  }
  var avg = sum / N;
  var root = new Array(N);
  var sum2 = 0;
  for(var i = 0; i < N; i++){
    root[i] = Math.pow(avg - list[i], 2);
    sum2 += root[i];
  }
  var rootavg = Math.sqrt(sum2 / N);
  var check = (Math.abs(avg - list[M]) * 10 / rootavg) + 50;
  myout(Math.floor(check));
}
0