結果

問題 No.116 門松列(1)
ユーザー watarimaycry2watarimaycry2
提出日時 2020-06-26 20:26:01
言語 JavaScript
(node v23.5.0)
結果
AC  
実行時間 82 ms / 5,000 ms
コード長 2,444 bytes
コンパイル時間 172 ms
コンパイル使用メモリ 6,816 KB
実行使用メモリ 40,448 KB
最終ジャッジ日時 2024-07-04 16:59:47
合計ジャッジ時間 4,570 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

//↓--------------------------------------------------
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);
myerr("-----start-----");
var start = new Date();
Main();
var end = new Date() - start;
myerr("----- end -----");
myerr("time : " + (end) + "ms");
myerr("memory : " + Math.round(process.memoryUsage().heapTotal / 1024) + "KB");
});
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){
var returnObj = {
list : input, index : 0, max : input.length,
hasNext : function(){return (this.index < this.max);},
next : function(){if(!this.hasNext()){throw "ArrayIndexOutOfBoundsException ";}else{var returnInput = this.list[this.index];this
        .index++;return returnInput;}}
};
return returnObj;
}
function myout(s){console.log(s);}
function myerr(s){console.error("debug:" + require("util").inspect(s,false,null));}
//[no]
//: 1:
//2:SP 4:SP
//6:1 7:1
//8:SP 9: 0:
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;}}
//↑--------------------------------------------------
function Main(){
var N = nextInt();
var list = nextIntArray();
var output = 0;
for(var i = 0; i < N - 2; i++){
var check = [list[i], list[i + 1], list[i + 2]];
var check2 = JSON.parse(JSON.stringify(check));
if(new Set(check).size != 3){
continue;
}
check.sort(function(a,b){
return a - b;
});
if(check2.indexOf(check[1]) == 2 || check2.indexOf(check[1]) == 0){
output++;
}
}
myout(output);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0