blob: 6a9c21759aa9a54a54a1e1fa829d4c0ee7ed8615 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> ii;
int S[100001];
vector<ii> G[100001];
int main() {
ifstream cin("timeline.in");
ofstream cout("timeline.out");
int N, M, C;
cin >> N >> M >> C;
for (int i = 0; i < N; ++i) cin >> S[i];
for (int i = 0; i < C; ++i) {
int a, b, x;
cin >> a >> b >> x;
G[--a].emplace_back(--b, -x);
}
for (int i = 0; i < N; ++i) S[i] = -S[i];
priority_queue<ii, vector<ii>, greater<ii>> pq;
for (int i = 0; i < N; ++i) pq.emplace(S[i], i);
while (!pq.empty()) {
int d = pq.top().f, u = pq.top().s;
pq.pop();
if (d > S[u]) continue;
for (auto& v : G[u]) {
if (S[u] + v.s < S[v.f]) {
S[v.f] = S[u] + v.s;
pq.emplace(S[v.f], v.f);
}
}
}
for (int i = 0; i < N; ++i) cout << -S[i] << '\n';
}
|
