Submission #649747

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
6497472022-10-11 10:12:58RealSnakeCommuter Pass (JOI18_commuter_pass)C++17
0 / 100
2079 ms9072 KiB
#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);
}
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...