結果

問題 No.1132 凸凹
ユーザー watarimaycry2
提出日時 2020-08-18 14:34:20
言語 JavaScript
(node v23.5.0)
結果
AC  
実行時間 84 ms / 2,000 ms
コード長 2,452 bytes
コンパイル時間 78 ms
コンパイル使用メモリ 6,948 KB
実行使用メモリ 42,580 KB
最終ジャッジ日時 2024-10-12 02:42:37
合計ジャッジ時間 3,508 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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 one = nextIntArray();
  var A = one[0];
  var B = one[1];
  var C = one[2];
  var D = one[3];
  var P = one[4];
  var Q = one[5];
  function F(x){
    return A*x*x*x+B*x*x+C*x+D;
  }
  var minIndex = P;
  var maxIndex = P;
  var min = F(P);
  var max = F(P);
  for(var i = P; i <= Q; i++){
    var check = F(i);
    if(min > check){
      min = check;
      minIndex = i;
    }
    if(max < check){
      max = check;
      maxIndex = i;
    }
  }
  myout(max + " " + maxIndex + " " + min + " " + minIndex);
}
0