# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
649747 | RealSnake | Commuter Pass (JOI18_commuter_pass) | C++17 | 2079 ms | 9072 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 ll long long
using namespace std;
int n, m, s, t, u, v;
int a[100005];
ll dist[100005], distt[305][305];
vector<pair<int, ll>> node[100005];
int ind;
ll ans;
void dfs(int x) {
a[ind++] = x;
if(x == t) {
ll p1 = 1e18, p2 = 1e18;
for(int i = 0; i < ind; i++) {
p1 = min(p1, distt[u][a[i]]);
p2 = min(p2, distt[v][a[i]]);
}
ans = min(ans, p1 + p2);
ind--;
return;
}
for(auto [y, d] : node[x]) {
if(dist[x] + d <= dist[y]) {
dist[y] = dist[x] + d;
dfs(y);
}
}
# | 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... |