結果

問題 No.1368 サイクルの中に眠る門松列
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-29 22:11:22
言語 JavaScript
(node v21.7.1)
結果
WA  
実行時間 -
コード長 3,113 bytes
コンパイル時間 281 ms
コンパイル使用メモリ 5,288 KB
実行使用メモリ 125,428 KB
最終ジャッジ日時 2023-09-09 15:36:31
合計ジャッジ時間 5,902 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 85 ms
42,556 KB
testcase_01 AC 86 ms
42,476 KB
testcase_02 WA -
testcase_03 AC 144 ms
52,856 KB
testcase_04 WA -
testcase_05 AC 389 ms
92,584 KB
testcase_06 AC 386 ms
92,616 KB
testcase_07 AC 233 ms
70,240 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
権限があれば一括ダウンロードができます

ソースコード

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 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 t = nextInt();
	for(var i = 0; i < t; i++){
		var N = nextInt();
		var list = nextIntArray(N);
		var queue = [];
		for(var j = 0; j < N; j++){
			if((list[j] < list[(j + 1) % N] && list[(j + 1) % N] > list[(j + 2) % N]) || (list[j] > list[(j + 1) % N] && list[(j + 1) % N] < list[(j + 2) % N])){
				if(list[j] != list[(j + 2) % N]){
					queue.push({
						v : list[j],
						used : [j, (j + 1) % N, (j + 2) % N]
					});
				}
			}
		}
		queue.sort(function(a,b){
			return b.v - a.v;
		});
		var output = 0;
		for(var j = 0; j < queue.length; j++){
			var node = queue[j];

			if(list[node.used[0]] != -1 && list[node.used[1]] != -1 && list[node.used[2]] != -1){
				output += node.v;
				list[node.used[0]] = -1;
				list[node.used[1]] = -1;
				list[node.used[2]] = -1;
			}
		}
		myout(output);
	}
}
0