| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 757672 |
2023-06-13T14:36:12 Z |
sysia |
Olympic Bus (JOI20_ho_t4) |
C++17 |
|
372 ms |
3520 KB |
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define ll long long
typedef pair<int, int> T;
set<T>cycle;
const int oo2 = 2e9+7;
const int mx = 202;
int n;
int pre[mx], dist[mx];
priority_queue<T>pq;
long long dijkstra(vector<vector<T>>&g, int from, int to = -1){
for (int i = 1; i<=n; i++) {
pre[i] = 0;
dist[i] = oo2;
}
dist[from] = 0;
pq.push({0, from});
while ((int)pq.size()){
auto [d, v] = pq.top();
pq.pop();
if (dist[v] < d) continue;
for (auto [x, c]: g[v]){
if (dist[x] > dist[v] + c){
pre[x] = v;
dist[x] = dist[v] + c;
pq.push({dist[x], x});
}
}
}
if (to >= 1){
int now = to;
int prev = -1;
while (now){
if (prev != -1) cycle.insert({now, prev});
prev = now;
now = pre[now];
}
}
return from == 1 ? dist[n] : dist[1];
}
void solve(){
int m; cin >> n >> m;
vector<vector<T>>g(n+1), gt(n+1);
vector<tuple<int, int, int, int>>edges;
vector d(n+1, vector<int>(n+1, oo2));
for (int i = 0; i<m; i++){
int a, b, c, dd; cin >> a >> b >> c >> dd;
g[a].emplace_back(b, c);
gt[b].emplace_back(a, c);
d[a][b] = min(d[a][b], c);
edges.emplace_back(a, b, c, dd);
}
for (int i = 1; i<=n; i++) d[i][i] = 0;
for (int i = 1; i<=n; i++){
for (int j = 1; j<=n; j++){
for (int k = 1; k<=n; k++){
if (d[i][k] == oo2 || d[k][j] == oo2) continue;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
dijkstra(g, 1, n);
dijkstra(g, n, 1);
long long ans = (long long)d[1][n] + d[n][1];
int k = 0;
debug(cycle);
for (auto &[a, b, c, dd]: edges){
if (cycle.find({a, b}) != cycle.end()){
debug(a, b);
auto [A, B, C, D] = edges[k];
for (int i = 0; i<(int)g[A].size(); i++){
if (g[A][i] == make_pair(B, C)){
swap(g[A][i], g[A].back());
break;
}
}
g[A].pop_back();
g[B].emplace_back(A, C);
long long tmp = (long long)dd + dijkstra(g, 1, 0) + dijkstra(g, n, 0);
debug(tmp);
g[B].pop_back();
g[A].emplace_back(B, C);
ans = min(ans, tmp);
} else {
ans = min(ans, (ll)dd + min((ll)d[1][n], (ll)d[1][b]+c+d[a][n]) + min((ll)d[n][1], (ll)d[n][b] + c + d[a][1]));
}
k++;
}
if (ans >= oo2) cout << "-1\n";
else cout << ans << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
468 KB |
Output is correct |
| 2 |
Correct |
10 ms |
468 KB |
Output is correct |
| 3 |
Incorrect |
34 ms |
560 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
372 ms |
3320 KB |
Output is correct |
| 2 |
Incorrect |
285 ms |
3520 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
468 KB |
Output is correct |
| 2 |
Correct |
10 ms |
468 KB |
Output is correct |
| 3 |
Incorrect |
34 ms |
560 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
