# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768355 | hgmhc | 날다람쥐 (JOI14_ho_t4) | C++17 | 129 ms | 13888 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define Mup(x,y) x = max(x,y)
#define mup(x,y) x = min(x,y)
#define all(x) begin(x),end(x)
#define per(i,a,b) for (auto i = (b); i >= (a); --i)
using namespace std;
using ll = long long;
using ii = pair<int,int>;
#define dbg(...) fprintf(stderr,__VA_ARGS__)
const ll INF = 1e18;
const int N = 1e5+3;
int n, m, x, h[N];
vector<ii> adj[N];
ll dist[N];
int main() {
scanf("%d%d%d", &n, &m, &x);
rep(i,1,n) scanf("%d", &h[i]);
rep(i,1,m) {
int u, v, t;
scanf("%d%d%d", &u, &v, &t);
adj[u].push_back({v,t});
adj[v].push_back({u,t});
}
fill(dist,dist+N,INF);
priority_queue<pair<ll,int>> pq;
dist[1] = 0, pq.push({0,1});
while (not empty(pq)) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |