oj.uz

Submission #758070

# Submission time Handle Problem Language Result Execution time Memory
758070 2023-06-14T06:26:41 Z sysia Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 4588 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;
typedef tuple<int, int, int> F;
const int oo2 = 2e9+7, mx = 202;
int n;
T pre[mx];
int dist[mx];
priority_queue<T>pq;
set<int>cycle;

long long dijkstra(vector<vector<F>>&g, int from, int to = -1){
    for (int i = 1; i<=n; i++) {
        pre[i] = {0, -1};
        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, i]: g[v]){
            if (dist[x] > dist[v] + c){
                pre[x] = {v, i};
                dist[x] = dist[v] + c;
                pq.push({dist[x], x});
            }
        }
    }
    if (to >= 1){
        int now = to;
        while (now){
            cycle.insert(pre[now].second);
            now = pre[now].first;
        }
        return oo2;
    }
    return from == 1 ? dist[n] : dist[1];
}

void solve(){
    int m; cin >> n >> m;
    vector<vector<F>>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, i);
        gt[b].emplace_back(a, c, i);
        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 k = 1; k<=n; k++){
        for (int i = 1; i<=n; i++){
            for (int j = 1; j<=n; j++){
                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];
    debug(ans);
    int k = 0;
    debug(cycle);
    for (auto &[a, b, c, dd]: edges){
        if (cycle.find(k) != 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] == tie(B, C, k)){
                    swap(g[A][i], g[A].back());
                    break;
                }
            }
            g[A].pop_back();
            g[B].emplace_back(A, C, k);
            long long tmp = (long long)dd + dijkstra(g, 1, 0) + dijkstra(g, n, 0);
            g[B].pop_back();
            g[A].emplace_back(B, C, k);
            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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 22 ms 468 KB Output is correct
4 Correct 35 ms 468 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 420 ms 468 KB Output is correct
11 Correct 671 ms 592 KB Output is correct
12 Correct 643 ms 696 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 11 ms 468 KB Output is correct
15 Correct 11 ms 460 KB Output is correct
16 Correct 14 ms 468 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 4180 KB Output is correct
2 Correct 128 ms 4172 KB Output is correct
3 Correct 127 ms 4424 KB Output is correct
4 Correct 20 ms 596 KB Output is correct
5 Correct 11 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 29 ms 4344 KB Output is correct
10 Correct 28 ms 4352 KB Output is correct
11 Correct 94 ms 4316 KB Output is correct
12 Correct 67 ms 4340 KB Output is correct
13 Correct 65 ms 4408 KB Output is correct
14 Correct 101 ms 4588 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 468 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 28 ms 3660 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 31 ms 4084 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 25 ms 4036 KB Output is correct
9 Correct 24 ms 4040 KB Output is correct
10 Correct 23 ms 4164 KB Output is correct
11 Correct 27 ms 4168 KB Output is correct
12 Correct 25 ms 4264 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 26 ms 4368 KB Output is correct
20 Correct 23 ms 4056 KB Output is correct
21 Correct 25 ms 4128 KB Output is correct
22 Correct 28 ms 4080 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 22 ms 468 KB Output is correct
4 Correct 35 ms 468 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 420 ms 468 KB Output is correct
11 Correct 671 ms 592 KB Output is correct
12 Correct 643 ms 696 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 11 ms 468 KB Output is correct
15 Correct 11 ms 460 KB Output is correct
16 Correct 14 ms 468 KB Output is correct
17 Correct 122 ms 4180 KB Output is correct
18 Correct 128 ms 4172 KB Output is correct
19 Correct 127 ms 4424 KB Output is correct
20 Correct 20 ms 596 KB Output is correct
21 Correct 11 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 29 ms 4344 KB Output is correct
26 Correct 28 ms 4352 KB Output is correct
27 Correct 94 ms 4316 KB Output is correct
28 Correct 67 ms 4340 KB Output is correct
29 Correct 65 ms 4408 KB Output is correct
30 Correct 101 ms 4588 KB Output is correct
31 Correct 8 ms 468 KB Output is correct
32 Correct 1 ms 456 KB Output is correct
33 Correct 28 ms 3660 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 31 ms 4084 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 25 ms 4036 KB Output is correct
39 Correct 24 ms 4040 KB Output is correct
40 Correct 23 ms 4164 KB Output is correct
41 Correct 27 ms 4168 KB Output is correct
42 Correct 25 ms 4264 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 324 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 320 KB Output is correct
49 Correct 26 ms 4368 KB Output is correct
50 Correct 23 ms 4056 KB Output is correct
51 Correct 25 ms 4128 KB Output is correct
52 Correct 28 ms 4080 KB Output is correct
53 Correct 120 ms 4160 KB Output is correct
54 Correct 181 ms 4160 KB Output is correct
55 Correct 162 ms 4168 KB Output is correct
56 Correct 23 ms 548 KB Output is correct
57 Correct 17 ms 460 KB Output is correct
58 Correct 306 ms 3704 KB Output is correct
59 Correct 623 ms 3716 KB Output is correct
60 Execution timed out 1066 ms 3660 KB Time limit exceeded
61 Halted 0 ms 0 KB -