AcWing 836. 合并集合 ( JavaScript )
原题链接
简单
作者:
gaobowen
,
2019-11-21 22:08:21
,
所有人可见
,
阅读 700
let parent = new Int32Array(100010);
for (let i = 0; i <= parent.length; i++) parent[i] = i;
let find = x => {
if (parent[x] !== x) parent[x] = find(parent[x]);
return parent[x];//根节点时返回
}
// a 的根节点合并到 b的根节点
let merge = (a, b) => {
parent[find(a)] = find(b);
}
let buf = '';
process.stdin.on('readable', function () {
let chunk = process.stdin.read();
if (chunk) buf += chunk.toString();
});
let getInputNums = line => line.split(' ').filter(s => s !== '').map(x => parseInt(x));
let getInputStr = line => line.split(' ').filter(s => s !== '');
process.stdin.on('end', function () {
let m = 0;
buf.split('\n').forEach(function (line, lineIdx) {
if (lineIdx === 0) {
let a = getInputNums(line);
m = a[1];
} else if (lineIdx <= m) {
switch (line[0]) {
case 'M': {
let arr = getInputNums(line.slice(1));
if (parent[arr[0]] !== parent[arr[1]])
merge(arr[0], arr[1]);
break;
}
case 'Q': {
let arr = getInputNums(line.slice(1));
console.log(find(arr[0]) === find(arr[1]) ? 'Yes' : 'No');
break;
}
}
}
});
});