#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
using bdata = vector<bool>;
using ddata = vector<double>;
using idata = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using gpii = vector<vpii>;
const double INF = 1e18;
gpii roads;
void dijkstra (ddata &distances) {
priority_queue<pair<double, int>> pq;
for (int i = 0; i < distances.size(); i ++)
if (distances[i] != INF)
pq.push({ - distances[i], i });
while (pq.size() != 0) {
const auto curr = pq.top(); pq.pop();
auto dist = - curr.first;
auto node = curr.second;
if (dist != distances[node]) continue ;
for (const auto &road : roads[node]) {
int next = road.first;
double cost = road.second + dist;
if (cost >= distances[next]) continue ;
distances[next] = cost;
pq.push({ - cost, next });
}
}
}
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
roads.clear();
roads.resize(N);
for (int i = 0; i < M; i ++) {
roads[x[i]].push_back({ y[i], c[i] });
roads[y[i]].push_back({ x[i], c[i] });
}
ddata distances(N, INF);
distances[0] = 0;
dijkstra(distances);
if (distances[H] == INF) return -1;
return distances[H];
}
Compilation message
cyberland.cpp: In function 'void dijkstra(ddata&)':
cyberland.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
19 | for (int i = 0; i < distances.size(); i ++)
| ~~^~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
22 ms |
468 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
468 KB |
Correct. |
2 |
Correct |
28 ms |
1348 KB |
Correct. |
3 |
Correct |
21 ms |
1292 KB |
Correct. |
4 |
Correct |
24 ms |
1292 KB |
Correct. |
5 |
Correct |
23 ms |
1408 KB |
Correct. |
6 |
Correct |
20 ms |
2240 KB |
Correct. |
7 |
Correct |
25 ms |
2176 KB |
Correct. |
8 |
Correct |
11 ms |
2632 KB |
Correct. |
9 |
Correct |
25 ms |
1096 KB |
Correct. |
10 |
Correct |
20 ms |
1080 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
24 ms |
420 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
23 ms |
5712 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
468 KB |
Correct. |
2 |
Correct |
27 ms |
1364 KB |
Correct. |
3 |
Correct |
21 ms |
1264 KB |
Correct. |
4 |
Correct |
20 ms |
2260 KB |
Correct. |
5 |
Correct |
18 ms |
980 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
444 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
468 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
468 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |