Submission

[PPPPPPPPPPPPPPPPPPPP]

Score: 100

User: Nagornz

Problemset: รถยนต์ รถไฟ เรือเมล์ ลิเก ตำรวจ

Language: cpp

Time: 0.017 second

Submitted On: 2025-03-13 21:43:31

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int dijkstra(vector <vector <pii>> &adj) {
    int n = adj.size() - 1;
    greater_priority_queue <pii> q;
    q.emplace(0, 1);
    vector <int> dis(n + 1, inf);
    dis[1] = 0;
    while (!q.empty()) {
        auto [w, u] = q.top(); q.pop();
        // cout << u << "\n";
        if (w > dis[u]) continue;
        for (auto [ww, v] : adj[u]) {
            int www = w + ww;
            if (www < dis[v]) {
                dis[v] = www;
                q.emplace(dis[v], v);
            }
        }
    }
    // for (auto e : dis) cout << e << " ";
    // cout << "\n";
    return dis[n];
}

int32_t main(){
    iShowSpeed;
    int n, m; cin >> n >> m;
    vector <vector <bool>> adjmat(n + 1, vector <bool> (n + 1));
    while (m--) {
        int u, v; cin >> u >> v;
        adjmat[u][v] = adjmat[v][u] = true;
    }
    vector <vector <pii>> tadj(n + 1);
    vector <vector <pii>> cadj(n + 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            int dist = 10 * abs(i - j);
            if (adjmat[i][j]) tadj[i].emb(dist, j);
            else cadj[i].emb(dist, j);
        }
    }
    // for (int i = 1; i <= n; i++) {
    //     cout << i << ": ";
    //     for (auto [w, e] : tadj[i]) cout << e << " ";
    //     cout << "\n";
    // }
    // cout << "---------------------\n";
    // for (int i = 1; i <= n; i++) {
    //     cout << i << ": ";
    //     for (auto [w, e] : cadj[i]) cout << e << " ";
    //     cout << "\n";
    // }
    // cout << "---------------------\n";
    int tt = dijkstra(tadj);
    int cc = dijkstra(cadj);
    cout << (cc == inf || tt == inf ? -1 : max(cc, tt));
}