結果

問題 No.1424 Ultrapalindrome
ユーザー watarimaycry2watarimaycry2
提出日時 2021-03-13 00:26:09
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 1,475 ms / 2,000 ms
コード長 3,267 bytes
コンパイル時間 206 ms
コンパイル使用メモリ 5,504 KB
実行使用メモリ 130,368 KB
最終ジャッジ日時 2024-04-22 17:18:44
合計ジャッジ時間 15,837 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 154 ms
39,936 KB
testcase_01 AC 73 ms
40,064 KB
testcase_02 AC 72 ms
40,192 KB
testcase_03 AC 73 ms
40,064 KB
testcase_04 AC 73 ms
39,936 KB
testcase_05 AC 73 ms
40,192 KB
testcase_06 AC 72 ms
39,936 KB
testcase_07 AC 71 ms
40,192 KB
testcase_08 AC 72 ms
40,192 KB
testcase_09 AC 648 ms
77,700 KB
testcase_10 AC 531 ms
80,444 KB
testcase_11 AC 370 ms
70,668 KB
testcase_12 AC 521 ms
77,720 KB
testcase_13 AC 215 ms
60,268 KB
testcase_14 AC 444 ms
73,512 KB
testcase_15 AC 76 ms
40,192 KB
testcase_16 AC 330 ms
67,236 KB
testcase_17 AC 359 ms
69,932 KB
testcase_18 AC 438 ms
65,264 KB
testcase_19 AC 517 ms
72,392 KB
testcase_20 AC 176 ms
52,568 KB
testcase_21 AC 345 ms
66,984 KB
testcase_22 AC 271 ms
62,180 KB
testcase_23 AC 133 ms
50,944 KB
testcase_24 AC 160 ms
52,232 KB
testcase_25 AC 152 ms
52,140 KB
testcase_26 AC 568 ms
76,044 KB
testcase_27 AC 639 ms
86,872 KB
testcase_28 AC 499 ms
85,372 KB
testcase_29 AC 511 ms
85,512 KB
testcase_30 AC 1,449 ms
85,744 KB
testcase_31 AC 1,475 ms
130,368 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{
			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 N = nextInt();
	var list = new Array(N);
	for(var i = 0; i < N; i++){
		list[i] = {
			child : [],
			count : -1
		};
	}
	for(var i = 0; i < N - 1; i++){
		var L = nextInt() - 1;
		var R = nextInt() - 1;
		list[L].child.push(R);
		list[R].child.push(L);
	}
	var over = 0;
	var index = -1;
	for(var i = 0; i < N; i++){
		if(list[i].child.length > 2){
			over++;
			index = i;
		}
	}
	if(over == 0){
		myout("Yes");
	}else if(over == 1){
		var queue = [index];
		list[index].count = 0;
		while(queue.length > 0){
			var now = queue.shift();
			var child = list[now].child;
			for(var i = 0; i < child.length; i++){
				var c = child[i];
				if(list[c].count == -1){
					list[c].count = list[now].count + 1;
					queue.push(c);
				}
			}
		}
		var max = new Set();
		for(var i = 0; i < N; i++){
			if(list[i].child.length == 1){
				max.add(list[i].count);
			}
		}
		if(max.size == 1){
			myout("Yes");
		}else{
			myout("No");
		}
	}else{
		myout("No");
	}
}
0