#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class Edge {
public:
int node;
ll weight;
int color;
int cost;
Edge(int n, int c, int co) {
node = n;
weight = 0;
color = c;
cost = co;
}
};
bool operator<(const Edge &a, const Edge &b) {
return a.color < b.color;
}
typedef pair<ll, int> pii;
const int MAXN = 1e5;
const int MAXM = 2e5;
int n, m;
vector<Edge> edges[MAXN];
ll dist[MAXN];
ll min(ll a, ll b) {
if (a < b) return a;
return b;
}
ll get(unordered_map<int, ll> &red, int k) {
if (red.find(k) == red.end()) return 0;
return red[k];
}
void adj_edges(int i, unordered_map<int, ll> &red) {
sort(edges[i].begin(), edges[i].end());
for (int j = 0; j < edges[i].size(); ) {
int orig = j;
ll osum = 0;
while (j < edges[i].size() && edges[i][orig].color == edges[i][j].color) {
osum += edges[i][j].cost;
j++;
}
if (j == orig+1) continue;
else for (int k = orig; k < j; k++) edges[i][k].weight = min(edges[i][k].cost, osum-edges[i][k].cost-get(red, edges[i][k].color));
}
}
void dijkstra() {
dist[0] = 0;
set<pii> pq;
pq.insert(pii(0, 0));
while (!pq.empty()) {
pii cur = *(pq.begin());
pq.erase(cur);
unordered_map<int, ll> red;
for (int i = 0; i < edges[cur.second].size(); i++) {
if (dist[edges[cur.second][i].node] >= 0 && dist[edges[cur.second][i].node] < cur.first) {
int curc = edges[cur.second][i].color;
int curred = cur.first-dist[edges[cur.second][i].node];
if (red.find(curc) == red.end() || curred > red[curc]) red[curc] = curred;
}
}
adj_edges(cur.second, red);
for (Edge e: edges[cur.second]) {
int next = e.node;
if (dist[next] == -1 || dist[cur.second]+e.weight < dist[next]) {
pq.erase(pii(dist[next], next));
dist[next] = dist[cur.second]+e.weight;
pq.insert(pii(dist[next], next));
}
}
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y, c, co;
cin >> x >> y >> c >> co;
x--; y--; c--;
edges[x].push_back(Edge(y, c, co));
edges[y].push_back(Edge(x, c, co));
}
//for (int i = 0; i < n; i++) adj_edges(i);
fill(dist, dist+n, -1);
dijkstra();
cout << dist[n-1] << "\n";
}
Compilation message
Main.cpp: In function 'void adj_edges(int, std::unordered_map<int, long long int>&)':
Main.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for (int j = 0; j < edges[i].size(); ) {
| ~~^~~~~~~~~~~~~~~~~
Main.cpp:48:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
48 | while (j < edges[i].size() && edges[i][orig].color == edges[i][j].color) {
| ~~^~~~~~~~~~~~~~~~~
Main.cpp: In function 'void dijkstra()':
Main.cpp:65:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | for (int i = 0; i < edges[cur.second].size(); i++) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
1 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
3 ms |
2644 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2644 KB |
Output is correct |
9 |
Correct |
3 ms |
2772 KB |
Output is correct |
10 |
Correct |
3 ms |
2772 KB |
Output is correct |
11 |
Correct |
3 ms |
2772 KB |
Output is correct |
12 |
Correct |
3 ms |
2808 KB |
Output is correct |
13 |
Correct |
3 ms |
2900 KB |
Output is correct |
14 |
Correct |
3 ms |
2900 KB |
Output is correct |
15 |
Correct |
3 ms |
2720 KB |
Output is correct |
16 |
Correct |
4 ms |
2772 KB |
Output is correct |
17 |
Correct |
3 ms |
2772 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
3 ms |
2900 KB |
Output is correct |
20 |
Correct |
3 ms |
2772 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
9196 KB |
Output is correct |
2 |
Correct |
30 ms |
5480 KB |
Output is correct |
3 |
Correct |
99 ms |
13408 KB |
Output is correct |
4 |
Correct |
43 ms |
7064 KB |
Output is correct |
5 |
Correct |
178 ms |
19724 KB |
Output is correct |
6 |
Correct |
179 ms |
17916 KB |
Output is correct |
7 |
Correct |
187 ms |
20896 KB |
Output is correct |
8 |
Correct |
221 ms |
18088 KB |
Output is correct |
9 |
Correct |
219 ms |
22092 KB |
Output is correct |
10 |
Correct |
108 ms |
14772 KB |
Output is correct |
11 |
Correct |
57 ms |
11680 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
1 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
3 ms |
2644 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2644 KB |
Output is correct |
9 |
Correct |
3 ms |
2772 KB |
Output is correct |
10 |
Correct |
3 ms |
2772 KB |
Output is correct |
11 |
Correct |
3 ms |
2772 KB |
Output is correct |
12 |
Correct |
3 ms |
2808 KB |
Output is correct |
13 |
Correct |
3 ms |
2900 KB |
Output is correct |
14 |
Correct |
3 ms |
2900 KB |
Output is correct |
15 |
Correct |
3 ms |
2720 KB |
Output is correct |
16 |
Correct |
4 ms |
2772 KB |
Output is correct |
17 |
Correct |
3 ms |
2772 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
3 ms |
2900 KB |
Output is correct |
20 |
Correct |
3 ms |
2772 KB |
Output is correct |
21 |
Correct |
81 ms |
9196 KB |
Output is correct |
22 |
Correct |
30 ms |
5480 KB |
Output is correct |
23 |
Correct |
99 ms |
13408 KB |
Output is correct |
24 |
Correct |
43 ms |
7064 KB |
Output is correct |
25 |
Correct |
178 ms |
19724 KB |
Output is correct |
26 |
Correct |
179 ms |
17916 KB |
Output is correct |
27 |
Correct |
187 ms |
20896 KB |
Output is correct |
28 |
Correct |
221 ms |
18088 KB |
Output is correct |
29 |
Correct |
219 ms |
22092 KB |
Output is correct |
30 |
Correct |
108 ms |
14772 KB |
Output is correct |
31 |
Correct |
57 ms |
11680 KB |
Output is correct |
32 |
Correct |
104 ms |
16588 KB |
Output is correct |
33 |
Correct |
93 ms |
14352 KB |
Output is correct |
34 |
Correct |
163 ms |
17808 KB |
Output is correct |
35 |
Correct |
127 ms |
15188 KB |
Output is correct |
36 |
Correct |
144 ms |
15452 KB |
Output is correct |
37 |
Correct |
168 ms |
18420 KB |
Output is correct |
38 |
Correct |
193 ms |
24616 KB |
Output is correct |
39 |
Correct |
160 ms |
21404 KB |
Output is correct |
40 |
Correct |
248 ms |
23332 KB |
Output is correct |
41 |
Correct |
241 ms |
23620 KB |
Output is correct |
42 |
Correct |
248 ms |
21880 KB |
Output is correct |
43 |
Correct |
93 ms |
12616 KB |
Output is correct |
44 |
Correct |
159 ms |
23420 KB |
Output is correct |
45 |
Correct |
190 ms |
18064 KB |
Output is correct |
46 |
Correct |
186 ms |
17536 KB |
Output is correct |
47 |
Correct |
153 ms |
18864 KB |
Output is correct |
48 |
Correct |
230 ms |
24948 KB |
Output is correct |