# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127200 | FutymyClone | Commuter Pass (JOI18_commuter_pass) | C++14 | 406 ms | 17304 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>
using namespace std;
const int N = 1e5 + 5;
int n, m, s, t, s2, t2;
long long d[N], d2[N], d3[N];
vector <pair <int, int> > g[N];
priority_queue <pair <long long, int>, vector <pair <long long, int> >, greater <pair <long long, int> > > pq;
int main(){
scanf("%d %d", &n, &m);
scanf("%d %d", &s, &t);
scanf("%d %d", &s2, &t2);
for (int i = 1; i <= m; i++) {
int u, v, w;
scanf("%d %d %d", &u, &v, &w);
g[u].push_back({w, v});
g[v].push_back({w, u});
}
memset(d, 0x3f, sizeof(d));
d[s] = 0; pq.push({d[s], s});
while (!pq.empty()) {
pair <long long, int> val = pq.top(); pq.pop();
long long dist = val.first;
int u = val.second;
if (dist == d[u]) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |