[BOJ2606] ๋ฐ”์ด๋Ÿฌ์Šค - C++ ํ’€์ด

2022. 5. 24. 01:29ยท๐Ÿ–ฅ๏ธ Study Note/Coding Test

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

// 2606 ๋ฐ”์ด๋Ÿฌ์Šค
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int iComputerCount, iPairCount = 0;
	int counter = 0;

	cin >> iComputerCount >> iPairCount;

	vector<vector<int>> vecNetworks(iPairCount, vector<int>(2, 0));// row-PairCount, col-2 
	vector<int> vecVirus(iComputerCount, 0);

	for (int i = 0; i < iPairCount; ++i)
	{
		int a, b;
		cin >> a >> b;

		vecNetworks[i][0] = a;
		vecNetworks[i][1] = b;
	}
	
	// 1๋ฒˆ ์ปดํ“จํ„ฐ ๋ฐ”์ด๋Ÿฌ์Šค
	queue<int> q;
	q.push(1);
	vecVirus[0] = 1;
	
    	// ๋ฐ”์ด๋Ÿฌ์Šค ํ™•์žฅ
	while (!q.empty())
	{
		int iCurCom = q.front();
		q.pop();

		// ์—ฐ๊ฒฐ๋˜์–ด ์žˆ๊ณ  ์•„์ง ๊ฐ์—ผ๋˜์ง€ ์•Š์€ ์ปดํ“จํ„ฐ๋“ค์„ q์— ๋„ฃ๋Š”๋‹ค.
		for (int i = 0; i < iPairCount; ++i)
		{
			if (vecNetworks[i][0] == iCurCom && vecVirus[vecNetworks[i][1] - 1] != 1)
			{
				q.push(vecNetworks[i][1]);
				vecVirus[vecNetworks[i][1] - 1] = 1;
				counter++;
			}
			else if(vecNetworks[i][1] == iCurCom && vecVirus[vecNetworks[i][0] - 1] != 1) 
			{
				q.push(vecNetworks[i][0]);
				vecVirus[vecNetworks[i][0] - 1] = 1;
				counter++;
			}
		}

	}

	cout << counter;


	return 0;
}

์ด์ฐจ์› vector๋ฅผ ๋‹ค๋ฃจ๋Š”๊ฒŒ ์ต์ˆ™ํ•˜์ง€ ์•Š์•„์„œ ์ด์ฐจ์› vector๋กœ ํ’€์–ด๋ณด์•˜์Šต๋‹ˆ๋‹ค.

 

์ฐธ๊ณ 

https://velog.io/@yoonjong/C-2%EC%B0%A8%EC%9B%90-vector-%EC%B4%88%EA%B8%B0%ED%99%94

 

[C++] 2์ฐจ์› vector ์ดˆ๊ธฐํ™”

2์ฐจ์› ๋ฒกํ„ฐ์˜ ํ™œ์šฉ ๊ด€๋ จํ•ด ๊ฐ„๋‹จํ•˜๊ฒŒ ์ •๋ฆฌํ•ด๋ณด์•˜๋‹ค.

velog.io

https://wh00300.tistory.com/116

 

C++ ์ด์ฐจ์› ๋ฒกํ„ฐ ์‚ฌ์šฉ

vector ์ด์ฐจ์› ๋ฐฐ์—ด์˜ column, ์ฆ‰ ์—ด์นธ์„ ์ž์œ ๋กญ๊ฒŒ ์‚ฌ์šฉํ•˜๊ณ  ์‹ถ์–ด ์•Œ์•„๋ณด๋‹ค๊ฐ€ ์ด์ค‘๋ฒกํ„ฐ๋ฅผ ์•Œ๊ฒŒ ๋˜์—ˆ์Šต๋‹ˆ๋‹ค. ๋งŒ์•ฝ ์ฒ˜์Œ์—๋Š” 2*2์˜ ์ด์ฐจ์› ๋ฐฐ์—ด์„ ์‚ฌ์šฉํ•˜๋‹ค๊ฐ€ ์ด ์ƒํƒœ๋ฅผ ์œ ์ง€ํ•˜๋ฉด์„œ 3*2์˜ ๋ฐฐ์—ด์ด ํ•„์š”

wh00300.tistory.com

 

์ €์ž‘์žํ‘œ์‹œ ๋น„์˜๋ฆฌ ๋ณ€๊ฒฝ๊ธˆ์ง€ (์ƒˆ์ฐฝ์—ด๋ฆผ)

'๐Ÿ–ฅ๏ธ Study Note > Coding Test' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€

programmers / level.2 / ์ด์ง„ ๋ณ€ํ™˜ ๋ฐ˜๋ณตํ•˜๊ธฐ(C++)  (0) 2023.01.11
programmers / level.2 / ์˜ฌ๋ฐ”๋ฅธ ๊ด„ํ˜ธ(C++)  (0) 2023.01.11
programmers / level.2 / ์ตœ์†Ÿ๊ฐ’ ๋งŒ๋“ค๊ธฐ(C++)  (0) 2023.01.11
programmers / level.2 / ์—ฐ์Šต๋ฌธ์ œ : JadenCase ๋ฌธ์ž์—ด ๋งŒ๋“ค๊ธฐ(C++)  (0) 2023.01.08
programmers / level.2 / ์—ฐ์Šต๋ฌธ์ œ : ์ตœ๋Œ“๊ฐ’๊ณผ ์ตœ์†Ÿ๊ฐ’ (c++)  (0) 2023.01.06
'๐Ÿ–ฅ๏ธ Study Note/Coding Test' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€
  • programmers / level.2 / ์˜ฌ๋ฐ”๋ฅธ ๊ด„ํ˜ธ(C++)
  • programmers / level.2 / ์ตœ์†Ÿ๊ฐ’ ๋งŒ๋“ค๊ธฐ(C++)
  • programmers / level.2 / ์—ฐ์Šต๋ฌธ์ œ : JadenCase ๋ฌธ์ž์—ด ๋งŒ๋“ค๊ธฐ(C++)
  • programmers / level.2 / ์—ฐ์Šต๋ฌธ์ œ : ์ตœ๋Œ“๊ฐ’๊ณผ ์ตœ์†Ÿ๊ฐ’ (c++)
Beankong_
Beankong_
์ฃผ๋‹ˆ์–ด ํด๋ผ์ด์–ธํŠธ ํ”„๋กœ๊ทธ๋ž˜๋จธ ๊ณต๋ถ€ ๊ธฐ๋ก
  • Beankong_
    Beankong's Devlog
    Beankong_
  • ์ „์ฒด
    ์˜ค๋Š˜
    ์–ด์ œ
    • ์ „์ฒด ๊ธ€ (146)
      • โ›… Daily (0)
      • ๐Ÿ–ฅ๏ธ Study Note (2)
        • C++ (1)
        • Unreal Engine (5)
        • Coding Test (123)
        • Design Patteren (5)
        • VCS (Git..) (1)
        • Server (1)
      • ๐Ÿงญ Devlog (8)
        • ์˜ค๋‹ต๋…ธํŠธ (4)
        • UE5 GameLift Server Test Project (1)
        • TIL (3)
  • ๋ธ”๋กœ๊ทธ ๋ฉ”๋‰ด

    • ๋งํฌ

    • ๊ณต์ง€์‚ฌํ•ญ

    • ์ธ๊ธฐ ๊ธ€

    • ํƒœ๊ทธ

      ํ—ฌํ…Œ์ด์ปค
      unrealengine build system
      UnrealEngine5
      ์ฝ”๋”ฉํ…Œ์ŠคํŠธ
      UnrealEngine
      ๊ทธ๋ฆฌ๋””(greedy)
      ๊ฒŒ์ž„ ํ”„๋กœ๊ทธ๋ž˜๋ฐ
      ๊ฒŒ์ž„ํ”„๋กœ๊ทธ๋ž˜๋ฐ
      ํ”„๋ฃŒ๊ทธ๋ž˜๋จธ์Šค
      propertyaccess
      ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค
      OnlineSubsystem
      unrealengine module
      ์•Œ๊ณ ๋ฆฌ์ฆ˜
      ์ตœ๋‹จ ๊ฑฐ๋ฆฌ ์•Œ๊ณ ๋ฆฌ์ฆ˜
      ๊ทธ๋ž˜ํ”„ ์ˆœํšŒ
      ๊ฒŒ์ž„ ๊ฐœ๋ฐœ
      ๊ฒŒ์ž„ ๋ชจ์ž‘
      cpp
      programmers
    • ์ตœ๊ทผ ๋Œ“๊ธ€

    • ์ตœ๊ทผ ๊ธ€

    • hELLOยท Designed By์ •์ƒ์šฐ.v4.10.3
    Beankong_
    [BOJ2606] ๋ฐ”์ด๋Ÿฌ์Šค - C++ ํ’€์ด
    ์ƒ๋‹จ์œผ๋กœ

    ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”