Submission #1104432

#	Time	Username	Problem	Language	Result	Execution time	Memory
1104432		Pekiban	Robot (JOI21_ho_t4)	C++17	100 / 100	111 ms	21484 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define pb push_back

const int N = 1e5+5, M = 2e5+5;
vector<array<int, 3>> g[N];
ll di[N], S[M], mn[M];
bool vis[N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v, w, c;
        cin >> u >> v >> c >> w;
        g[u].pb({v, w, c});
        g[v].pb({u, w, c});
    }
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> pq;
    fill(di, di+n+1, 1e18);
    di[1] = 0;
    pq.push({0, 1});
    while (!pq.empty()) {
        auto [D, s] = pq.top(); pq.pop();
        if (vis[s]) continue;
        vis[s] = 1;
        for (auto [u, w, c] : g[s]) mn[c] = 1e18, S[c] = 0;
        for (auto [u, w, c] : g[s]) S[c] += w;
        for (auto [u, w, c] : g[s]) mn[c] = min(mn[c], di[u] + S[c]);
        for (auto [u, w, c] : g[s]) {
            if (di[u] > min({di[s] + w, di[s] + S[c] - w, mn[c] - w})) {
                di[u] = min({di[s] + w, di[s] + S[c] - w, mn[c] - w});
                pq.push({di[u], u});
            }
        }
    }
    cout << (di[n] > 1e15 ? -1 : di[n]) << '\n';
}

• Subtask 1: 34 / 34
• Subtask 2: 24 / 24
• Subtask 3: 42 / 42