# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169416 | Ariadna | Commuter Pass (JOI18_commuter_pass) | C++20 | 167 ms | 26552 KiB |
#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
const int MAX_N = 1e5;
vector<pair<int, int>> adj[MAX_N];
vector<int> dijkstra(int n, int s) {
vector<int> dist(n, 1e18);
priority_queue<pair<int, int>> pq;
pq.push({0, s});
dist[s] = 0;
while (!pq.empty()) {
int d = -pq.top().first;
int u = pq.top().second;
pq.pop();
if (dist[u] != d) continue;
for (pair<int, int> v: adj[u]) {
if (dist[v.first] > dist[u]+v.second) {
dist[v.first] = dist[u]+v.second;
pq.push({-dist[v.first], v.first});
}
}
}
return dist;
}
vector<pair<int, vector<int>>> dijkstra2(int n, int s) {
# | 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... |