# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55270 | shoemakerjo | Commuter Pass (JOI18_commuter_pass) | C++14 | 580 ms | 147048 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;
#define maxn 100010
#define ll long long
#define pil pair<ll, ll>
#define pli pair<ll, ll>
int N, M;
int s, t, u, v;
const ll inf = 1LL << 61; //feels big enough
ll dists[maxn], distu[maxn], distv[maxn], distt[maxn], dists2[maxn];
bool onpath[maxn]; //starts out as false
bool vis[maxn];
ll smallu[maxn], smallv[maxn]; //store the minimum crossing
//run a triple dijkstra
vector<vector<pil>> adj(maxn);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M >> s >> t >> u >> v;
int a, b;
ll c;
for (int i = 0; i < M; i++) {
cin >> a >> b >> c;
# | 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... |