oj.uz

Submission #971475

# Submission time Handle Problem Language Result Execution time Memory
971475 2024-04-28T15:38:28 Z shezitt Commuter Pass (JOI18_commuter_pass) C++14
24 / 100
 45 ms 4444 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <queue>
#include <set>

using namespace std;

using ll = long long;

#define int ll
#define fore(a, b, c) for(int a=b; a<c; ++a)
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define ii pair<int,int>
#define F first
#define S second

const int MAXN = 1010;

vector<ii> adj[MAXN];

int n, m, s, t, u, v;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    cin >> s >> t;
    cin >> u >> v;

    fore(i, 0, m){
        int x, y, c;
        cin >> x >> y >> c;
        adj[x].push_back({y, c});
        adj[y].push_back({x, c});
    }

    auto dijkstra = [&](int r, vi &dis) -> void {
        dis[r] = 0;
        priority_queue<ii, vector<ii>, greater<ii>> pq;
        pq.push({0, r});
        while(sz(pq)){
            auto [cost, node] = pq.top();
            pq.pop();

            if(cost != dis[node]) continue;

            for(auto [to, c] : adj[node]){
                if(dis[node] + c < dis[to]){
                    dis[to] = dis[node] + c;
                    pq.push({dis[to], to});
                }
            }

        }
    };

    vector<vi> d(n+1, vi(n+1, 4e18));
    fore(i, 1, n+1){
        dijkstra(i, d[i]);
    }

    int ans = d[u][v];

    fore(xx, 1, n+1){
        fore(yy, 1, n+1){
            int x = xx, y = yy;

            if(d[s][y] < d[s][x]) swap(x, y);

            if(d[s][x] + d[x][y] != d[s][y]) continue;
            if(d[s][x] + d[x][y] + d[y][t] != d[s][t]) continue;

            int res = min(d[u][x] + d[v][y], d[v][x] + d[u][y]);

            if(res == 14) {
                cerr << x << ' ' << y << endl;
            }

            ans = min(ans, res);
            
        }
    }

    cout << ans;

}

Compilation message

commuter_pass.cpp: In lambda function:
commuter_pass.cpp:49:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   49 |             auto [cost, node] = pq.top();
      |                  ^
commuter_pass.cpp:54:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |             for(auto [to, c] : adj[node]){
      |                      ^

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2908 KB Output is correct
2 Correct 11 ms 1116 KB Output is correct
3 Correct 12 ms 1116 KB Output is correct
4 Correct 45 ms 4444 KB Output is correct
5 Correct 33 ms 2908 KB Output is correct
6 Correct 16 ms 1116 KB Output is correct
7 Correct 20 ms 1372 KB Output is correct
8 Correct 32 ms 1368 KB Output is correct
9 Correct 17 ms 1116 KB Output is correct
10 Correct 34 ms 2804 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 7 ms 1232 KB Output is correct
13 Correct 11 ms 1116 KB Output is correct
14 Correct 14 ms 1116 KB Output is correct
15 Correct 15 ms 1116 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -