<div id="readability-page-1" class="page"><article id="mainContent">
                                <div>
                                    <p><a href="/m/category/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98"><span>알고리즘</span></a></p><h3>[백준 / javascript] 2606번 바이러스</h3>
                                </div>
                                <p><cite>Suhyeon Lee</cite>
                                    <span> 2023. 4. 16. 20:42</span>
                                </p>
                                
                            <div>
                                <p data-ke-size="size16"><a href="https://www.acmicpc.net/problem/2606">https://www.acmicpc.net/problem/2606</a></p>
<pre><code>// 2606 : 바이러스

const readFile = process.platform === 'linux' ? '/dev/stdin' : 'test.txt';

const input = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');

const node = Number(input[0]);
const edge = Number(input[1]);
const graph = [...Array(node + 1)].map(() =&gt; []);
const visited = [...Array(node + 1)].fill(false);
let answer = 0;

// 그래프 생성
for (let i = 0; i &lt; edge; i++) {
  let start = Number(input[i + 2].split(' ')[0]);
  let end = Number(input[i + 2].split(' ')[1]);
  graph[start].push(end);
  graph[end].push(start);
}

// 1번 노드 방문 처리 후 시작
visited[1] = true;
const dfs = (start) =&gt; {
  for (let end of graph[start]) {
    if (!visited[end]) {
      visited[end] = true;
      answer++;
      dfs(end);
    }
  }
};
dfs(1);
console.log(answer);
</code></pre>
            
            
                </div>
            


<ins data-ad-client="ca-pub-9527582522912841" data-ad-slot="3250933968" data-ad-format="auto" data-full-width-responsive="true" data-ad-type="inventory"></ins>


                                            
            
                            </article></div>

공부 기록하는 블로그

Suhyeon Lee

https://www.acmicpc.net/problem/2606
// 2606 : 바이러스
const readFile = process.platform === 'linux' ? '/dev/stdin' : 'test.txt';
const input = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');
const node = Number(input[0]);
const edge = Number(input[1]);
const graph = [...Array(node + 1)].map(() => []);
const visited = [...Array(node + 1)].fill(false);
let answer = 0;
// 그래프 생성
for (let i = 0; i < edge; i++) {
  let start = Number(input[i + 2].split(' ')[0]);
  let end = Number(input[i + 2].split(' ')[1]);
  graph[start].push(end);
  graph[end].push(start);
}
// 1번 노드 방문 처리 후 시작
visited[1] = true;
const dfs = (start) => {
  for (let end of graph[start]) {
    if (!visited[end]) {
      visited[end] = true;
      answer++;
      dfs(end);
    }
  }
};
dfs(1);
console.log(answer);

[백준 / javascript] 2606번 바이러스

댓글