-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #15 from AlgoLeadMe/4-InSange
4-InSange
- Loading branch information
Showing
2 changed files
with
124 additions
and
1 deletion.
There are no files selected for viewing
This file contains 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
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,122 @@ | ||
| #include <iostream> | ||
| #include <vector> | ||
| #include <queue> | ||
|
|
||
| using namespace std; | ||
|
|
||
| const int MAX_INT = 99999999; | ||
| int N, M, X, n, m, t, answer; | ||
| // vector<vector<int>> towns; | ||
| /// <summary> | ||
| /// ํ๋ก์ด๋ ์์ | ||
| /// </summary> | ||
| //void Floyd() | ||
| //{ | ||
| // | ||
| // cin >> N >> M >> X; | ||
| // | ||
| // answer = 0; | ||
| // towns.assign(N+1, vector<int>(N+1, MAX_INT)); | ||
| // | ||
| // while (M--) | ||
| // { | ||
| // cin >> n >> m >> t; | ||
| // towns[n][m] = t; | ||
| // } | ||
| // | ||
| // for (int k = 1; k <= N; k++) | ||
| // { | ||
| // towns[k][k] = 0; | ||
| // for (int i = 1; i <= N; i++) | ||
| // { | ||
| // if (towns[i][k] == MAX_INT) continue; | ||
| // for (int j = 1; j <= N; j++) | ||
| // { | ||
| // towns[i][j] = min(towns[i][j], towns[i][k] + towns[k][j]); | ||
| // } | ||
| // } | ||
| // } | ||
| // | ||
| // for (int i = 1; i <= N; i++) | ||
| // { | ||
| // answer = max(answer, towns[i][X] + towns[X][i]); | ||
| // } | ||
| // | ||
| // cout << answer << "\n"; | ||
| //} | ||
|
|
||
| vector<vector<pair<int, int>>> towns; | ||
| vector<int> dist; | ||
| int result, temp; | ||
| /// <summary> | ||
| /// ๋ค์ต์คํธ๋ผ | ||
| /// </summary> | ||
| void dijkstra(int start, int end) | ||
| { | ||
| dist.clear(); | ||
| dist.resize(N + 1, MAX_INT); | ||
| dist[start] = 0; | ||
|
|
||
| priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; | ||
| pq.push({ 0, start }); | ||
|
|
||
| while (!pq.empty()) | ||
| { | ||
| int cur = pq.top().second; | ||
| int cost = pq.top().first; | ||
| pq.pop(); | ||
|
|
||
| if (cur == end) | ||
| { | ||
| temp = dist[cur]; | ||
| break; | ||
| } | ||
| for (auto road : towns[cur]) | ||
| { | ||
| int next = road.first; | ||
| int next_cost = road.second + cost; | ||
|
|
||
| if (next_cost < dist[next]) | ||
| { | ||
| dist[next] = next_cost; | ||
| pq.push({ next_cost, next }); | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| void Solve() | ||
| { | ||
| cin >> N >> M >> X; | ||
|
|
||
| answer = 0; | ||
| towns.assign(N + 1, vector<pair<int ,int>>()); | ||
|
|
||
| while (M--) | ||
| { | ||
| cin >> n >> m >> t; | ||
| towns[n].push_back({ m, t }); | ||
| } | ||
|
|
||
| for (int i = 1; i <= N; i++) | ||
| { | ||
| result = 0; | ||
| dijkstra(i, X); | ||
| result += temp; | ||
| dijkstra(X, i); | ||
| result += temp; | ||
| answer = max(answer, result); | ||
| } | ||
|
|
||
| cout << answer; | ||
| } | ||
|
|
||
| int main() | ||
| { | ||
| cin.tie(nullptr); | ||
| ios::sync_with_stdio(false); | ||
|
|
||
| Solve(); | ||
|
|
||
| return 0; | ||
| } |