#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 1e5 + 2;
int n, m;
bool check[MAXN] = {false};
int val[MAXN] = {0};
vector <pair <int, pair <int, int> > > vt[MAXN];
unordered_map <int, int> ump[MAXN];
map <int, int> mp[MAXN];
void Dijkstra() {
priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;
pq.push(make_pair(0, 0));
while(pq.empty() == false) {
pair <int, int> u = pq.top();
pq.pop();
if(check[u.second] == true) {
continue;
} else {
check[u.second] = true;
}
val[u.second] = u.first;
for(int i = 0; i < (int)(vt[u.second].size()); i++) {
pair <int, pair <int, int> > x = vt[u.second][i];
if(mp[x.first].find(x.second.first) == mp[x.first].end()) {
mp[x.first][x.second.first] = u.first;
}
int temp = u.first;
map <int, int> :: iterator it = mp[u.second].find(x.second.first);
if(it != mp[u.second].end()) {
temp = it->second;
}
pq.push(make_pair(min(temp + ump[u.second][x.second.first] - x.second.second, u.first + x.second.second), x.first));
}
}
return;
}
void programme() {
// input:
cin >> n >> m;
for(int i = 0; i < m; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
ump[a][c] += d;
ump[b][c] += d;
vt[a].push_back({b,{c,d}});
vt[b].push_back({a,{c,d}});
}
// solve:
Dijkstra();
// output:
if(check[n - 1] == false) {
printf("-1\n");
} else {
cout << val[n-1] << "\n";
}
return;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
// freopen("_mint.inp", "r", stdin);
// freopen("_mint.out", "w", stdout);
programme();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 2 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 3 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 4 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 5 |
Correct |
7 ms |
12884 KB |
Output is correct |
| 6 |
Correct |
6 ms |
12756 KB |
Output is correct |
| 7 |
Correct |
7 ms |
12988 KB |
Output is correct |
| 8 |
Correct |
9 ms |
12884 KB |
Output is correct |
| 9 |
Correct |
8 ms |
13376 KB |
Output is correct |
| 10 |
Correct |
9 ms |
13248 KB |
Output is correct |
| 11 |
Correct |
8 ms |
13268 KB |
Output is correct |
| 12 |
Correct |
8 ms |
13196 KB |
Output is correct |
| 13 |
Correct |
8 ms |
13248 KB |
Output is correct |
| 14 |
Correct |
8 ms |
13140 KB |
Output is correct |
| 15 |
Correct |
7 ms |
13140 KB |
Output is correct |
| 16 |
Correct |
8 ms |
13244 KB |
Output is correct |
| 17 |
Correct |
7 ms |
13140 KB |
Output is correct |
| 18 |
Correct |
7 ms |
12988 KB |
Output is correct |
| 19 |
Correct |
7 ms |
13120 KB |
Output is correct |
| 20 |
Correct |
8 ms |
13196 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
105 ms |
30496 KB |
Output is correct |
| 2 |
Correct |
44 ms |
21408 KB |
Output is correct |
| 3 |
Correct |
158 ms |
33964 KB |
Output is correct |
| 4 |
Correct |
86 ms |
24996 KB |
Output is correct |
| 5 |
Correct |
505 ms |
68168 KB |
Output is correct |
| 6 |
Correct |
382 ms |
63456 KB |
Output is correct |
| 7 |
Correct |
255 ms |
53304 KB |
Output is correct |
| 8 |
Correct |
334 ms |
52164 KB |
Output is correct |
| 9 |
Correct |
337 ms |
52108 KB |
Output is correct |
| 10 |
Correct |
199 ms |
40604 KB |
Output is correct |
| 11 |
Correct |
90 ms |
32368 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 2 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 3 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 4 |
Correct |
7 ms |
12756 KB |
Output is correct |
| 5 |
Correct |
7 ms |
12884 KB |
Output is correct |
| 6 |
Correct |
6 ms |
12756 KB |
Output is correct |
| 7 |
Correct |
7 ms |
12988 KB |
Output is correct |
| 8 |
Correct |
9 ms |
12884 KB |
Output is correct |
| 9 |
Correct |
8 ms |
13376 KB |
Output is correct |
| 10 |
Correct |
9 ms |
13248 KB |
Output is correct |
| 11 |
Correct |
8 ms |
13268 KB |
Output is correct |
| 12 |
Correct |
8 ms |
13196 KB |
Output is correct |
| 13 |
Correct |
8 ms |
13248 KB |
Output is correct |
| 14 |
Correct |
8 ms |
13140 KB |
Output is correct |
| 15 |
Correct |
7 ms |
13140 KB |
Output is correct |
| 16 |
Correct |
8 ms |
13244 KB |
Output is correct |
| 17 |
Correct |
7 ms |
13140 KB |
Output is correct |
| 18 |
Correct |
7 ms |
12988 KB |
Output is correct |
| 19 |
Correct |
7 ms |
13120 KB |
Output is correct |
| 20 |
Correct |
8 ms |
13196 KB |
Output is correct |
| 21 |
Correct |
105 ms |
30496 KB |
Output is correct |
| 22 |
Correct |
44 ms |
21408 KB |
Output is correct |
| 23 |
Correct |
158 ms |
33964 KB |
Output is correct |
| 24 |
Correct |
86 ms |
24996 KB |
Output is correct |
| 25 |
Correct |
505 ms |
68168 KB |
Output is correct |
| 26 |
Correct |
382 ms |
63456 KB |
Output is correct |
| 27 |
Correct |
255 ms |
53304 KB |
Output is correct |
| 28 |
Correct |
334 ms |
52164 KB |
Output is correct |
| 29 |
Correct |
337 ms |
52108 KB |
Output is correct |
| 30 |
Correct |
199 ms |
40604 KB |
Output is correct |
| 31 |
Correct |
90 ms |
32368 KB |
Output is correct |
| 32 |
Correct |
127 ms |
36072 KB |
Output is correct |
| 33 |
Correct |
127 ms |
32352 KB |
Output is correct |
| 34 |
Correct |
241 ms |
44836 KB |
Output is correct |
| 35 |
Correct |
192 ms |
37956 KB |
Output is correct |
| 36 |
Correct |
209 ms |
46272 KB |
Output is correct |
| 37 |
Correct |
273 ms |
49564 KB |
Output is correct |
| 38 |
Correct |
279 ms |
53856 KB |
Output is correct |
| 39 |
Correct |
128 ms |
34900 KB |
Output is correct |
| 40 |
Correct |
323 ms |
53360 KB |
Output is correct |
| 41 |
Correct |
313 ms |
53552 KB |
Output is correct |
| 42 |
Correct |
342 ms |
54500 KB |
Output is correct |
| 43 |
Correct |
117 ms |
32072 KB |
Output is correct |
| 44 |
Correct |
215 ms |
43044 KB |
Output is correct |
| 45 |
Correct |
245 ms |
48024 KB |
Output is correct |
| 46 |
Correct |
208 ms |
47768 KB |
Output is correct |
| 47 |
Correct |
228 ms |
51072 KB |
Output is correct |
| 48 |
Correct |
567 ms |
72300 KB |
Output is correct |
