이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"
const int MOD = 1e9+7;
const int inf = 1e9;
const int linf = 1e15;
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// -------------------------------------------------- Main Code --------------------------------------------------
const int N = 205, M = 50005;
int n, m;
set<pii> g[N];
vii edges;
pair<vi, vi> dijkstra(int source) {
priority_queue<pii, vector<pii>, greater<>> q;
vi vis(n+1, 0), dis(n+1, linf), par(n+1);
q.push({0, source});
dis[source] = 0;
while (!q.empty()) {
pii f = q.top(); q.pop();
int src = f.s;
if (vis[src]) continue;
vis[src] = true;
for (auto child : g[src]) {
int ch = child.f, wt = child.s;
if (dis[ch] > dis[src] + wt) {
par[ch] = src;
dis[ch] = dis[src] + wt;
q.push({dis[ch], ch});
}
}
}
return {dis, par};
}
void sol() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b, c, d; cin >> a >> b >> c >> d;
g[a].insert({b, c});
edges.pb({a, b, c, d});
}
pair<vi, vi> x = dijkstra(1);
pair<vi, vi> y = dijkstra(n);
int ans = x.f[n] + y.f[1];
for (auto i : edges) {
int a = i[0], b = i[1], c = i[2], d = i[3];
g[a].erase({b, c});
g[b].insert({a, c});
pair<vi, vi> x = dijkstra(1);
pair<vi, vi> y = dijkstra(n);
ans = min(ans, x.f[n] + y.f[1] + d);
g[b].erase({a, c});
g[a].insert({b, c});
}
cout << (ans>=1e10?-1:ans) << endl;
}
signed main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
sol();
}
return 0;
}
# | 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... |