結果

問題 No.1707 Simple Range Reverse Problem
ユーザー watarimaycry2watarimaycry2
提出日時 2021-10-15 21:58:06
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 85 ms / 2,000 ms
コード長 3,897 bytes
コンパイル時間 51 ms
コンパイル使用メモリ 6,820 KB
実行使用メモリ 43,608 KB
最終ジャッジ日時 2024-09-17 17:28:33
合計ジャッジ時間 2,656 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
40,320 KB
testcase_01 AC 83 ms
41,216 KB
testcase_02 AC 82 ms
40,960 KB
testcase_03 AC 82 ms
40,832 KB
testcase_04 AC 85 ms
41,088 KB
testcase_05 AC 81 ms
41,088 KB
testcase_06 AC 83 ms
43,348 KB
testcase_07 AC 84 ms
43,348 KB
testcase_08 AC 83 ms
43,212 KB
testcase_09 AC 84 ms
42,956 KB
testcase_10 AC 84 ms
43,608 KB
testcase_11 AC 83 ms
41,344 KB
testcase_12 AC 85 ms
43,508 KB
testcase_13 AC 85 ms
41,600 KB
testcase_14 AC 84 ms
41,088 KB
testcase_15 AC 84 ms
43,600 KB
testcase_16 AC 84 ms
41,600 KB
testcase_17 AC 83 ms
41,216 KB
testcase_18 AC 84 ms
41,728 KB
権限があれば一括ダウンロードができます

ソースコード

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 if(code == 'long'){
			ret[i] = BigInt(next());
		}else{
			ret[i] = next();
		}
	}
	return ret;
}
function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');} function nextLongArray(size){return nextArray(size, 'long');}
function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);} function nextLong(){return BigInt(next());}
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 t = nextInt();
	while(hasNext()){
		var N = nextInt();
		var list = nextIntArray(N * 2);
		var isOK = true;
		var map = {};
		for(var i = 0; i < N * 2; i++){
			if(list[i] != (i % N) + 1){
				isOK = false;
			}
			if(map[list[i]] == null){
				map[list[i]] = [];
			}
			map[list[i]].push(i);
		}
		if(isOK){
			myout("Yes");
			continue;
		}
		for(var i = 1; i <= N; i++){
			if(map[i] == null){
				isOK = false;
				break;
			}
			var L = map[i][0];
			var R = map[i][1];
			var ok = [1,1];
			var indexL = L;
			var indexR = L;
			var check = new Set();
			while(indexL >= 0 && indexR < N * 2){
				if(list[indexL] != list[indexR]){
					ok[0] = -1;
					break;
				}
				check.add(indexL);
				check.add(indexR);
				indexL--;
				indexR++;
			}
			var indexL = R;
			var indexR = R;
			while(indexL >= 0 && indexR < N * 2){
				if(list[indexL] != list[indexR]){
					ok[1] = -1;
					break;
				}
				check.add(indexL);
				check.add(indexR);
				indexL--;
				indexR++;
			}
			if(ok[0] >= 0 && ok[1] >= 0 && check.size == N * 2){
				var isOK2 = true;
				for(var j = L + 1; j < R; j++){
					if(list[L + R - j] != (j % N) + 1){
						isOK2 = false;
					}
				}
				if(isOK2){
					isOK = true;
				}
			}
		}
		myout((isOK) ? "Yes" : "No");
	}
}
0