-
[Programmers] Lv3. ๋ฐฐ๋ฌSW Test/Programmers 2020. 9. 10. 02:43๋ฐ์ํ
- ์ด ๊ธ์ c++๋ก ํ์ด๋ฅผ ์์ฑํ์์ต๋๋ค.
๋ฌธ์
์์
ํ์ด
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters#include <iostream> #include <vector> #include <queue> #include <utility> #include <iostream> using namespace std; int INF = 50000001; int dist[51]; int check[51]; // ๋ค์ต์คํธ๋ผ๋ก ์๊ณ ๋ฆฌ์ฆ ํด๊ฒฐ // ์ฐ์ ์์ ํ ์ ๋ ฌ, ์ต์๋น์ฉ ์์ผ๋ก ์ ๋ ฌ struct cmp{ bool operator()(pair<int,int> a,pair<int,int> b){ return a.second>b.second; } }; void dijstra(int vec[51][51], int start,int N){ priority_queue<pair<int,int>,vector<pair<int,int>>,cmp> pq; // ์์์ ๋ถํฐ ๊ฐ ๋ ธ๋๊น์ง ๊ฑฐ๋ฆฌ ์ด๊ธฐํ for(int i=1;i<=N;i++){ dist[i]=vec[start][i]; pq.push(make_pair(i,dist[i])); } // ์ฐ์ ์์ ํ์ ๋ชจ๋ ๋น์ด์์ ๊ฒฝ์ฐ, ์ฆ ๋ชจ๋ ๋ ธ๋๋ฅผ ๋ค ํ์ํ์ ๊ฒฝ์ฐ while(!pq.empty()){ int node = pq.top().first; pq.pop(); check[node] = true; // ํ์ํ๋์ง ํ์ธ, ์ต์ ์์ผ๋ก ํ์ํ๊ธฐ ๋๋ฌธ์ ํ์๋์๋ค๋ ๋ป์ด ์ต์ ๋น์ฉ ๊ณ์ฐ ์๋ฃ for(int i=1;i<=N;i++){ if(!check[i]){ if(dist[node] + vec[node][i] < dist[i]){ // ๊ธฐ์กด ๊ฑฐ๋ฆฌ๋ณด๋ค node ์ ์ ์ ๊ฑฐ์ณ์ ๊ฐ๋ ๊ฑฐ๋ฆฌ๊ฐ ์์ ๊ฒฝ์ฐ dist[i] = dist[node] + vec[node][i]; pq.push(make_pair(i,dist[i])); } } } } } int solution(int N, vector<vector<int> > road, int K) { int answer = 0; int vec[51][51]={0}; for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ vec[i][j]= i==j?0:INF; } } for(int i=0;i<road.size();i++){ int s = road[i][0]; int e = road[i][1]; int cost = road[i][2]; if(cost<vec[s][e]){ vec[s][e] = cost; vec[e][s] = cost; } } dijstra(vec,1,N); for(int i=1;i<=N;i++){ cout<<dist[i]<<' '; if(dist[i]<=K){ answer++; } } return answer; } - ์ถ๊ฐ๋ก ๊ถ๊ธํ ์ ์ด๋ ์์ ํ ๋ถ๋ถ ์์ผ๋ฉด ๋๊ธ๋ก ๋จ๊ฒจ์ฃผ์ธ์.
๋ฐ์ํ'SW Test > Programmers' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[Programmers] Lv3. ์ซ์ ๊ฒ์ (0) 2020.09.20 [Programmers] Lv3. ๊ธฐ์ง๊ตญ ์ค์น (0) 2020.09.19 [Programmers] Lv3. ์ ๊ตญ์ฌ์ฌ (0) 2020.09.10 [Programmers] Lv3. ์ต๊ณ ์ ์งํฉ (0) 2020.09.08 [Programmers] Lv3. ์ผ๊ทผ์ง์ (0) 2020.09.08