# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166029 | llogm | Commuter Pass (JOI18_commuter_pass) | C++20 | 318 ms | 60008 KiB |
#include <bits/stdc++.h> //Logm
using namespace std;
#define int long long
#define II pair<int,int>
#define fi first
#define se second
template<class X, class Y> bool mini(X& x, const Y y) {
if (x > y) return x = y, 1;
return 0;
}
const int N = 1e5+5;
int n, m;
int S, T, U, V;
vector<II> adj[N];
vector<II> trace[N];
map<II, bool> dag;
int f[N];
void dijkstra1(int node) {
memset(f, 0x3f, sizeof f);
priority_queue<II, vector<II>, greater<II> > q;
q.push({0, node});
f[node] = 0;
while (!q.empty()) {
II u = q.top(); q.pop();
if (u.fi != f[u.se])
continue;
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... |