제출 #535750

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
535750		sam571128	Robot (JOI21_ho_t4)	C++17	34 / 100	56 ms	45604 KiB

Main

#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e3 + 5, M = 2e3 + 5;
struct edge {
    int v, c, p;
};

int dp[N][M], from[N][M];
vector<edge> adj[N];
int sum[M];

signed main() {
    fastio
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int u, v, c, p;
        cin >> u >> v >> c >> p;
        adj[u].push_back({v, c, p});
        adj[v].push_back({u, c, p});
    }

    fill(&dp[0][0], &dp[N - 1][M - 1], 1e18);

    priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<>> pq;
    dp[1][0] = 0;
    pq.push({0, {1, 0}});
    //dis, vertex, lst

    while (!pq.empty()) {
        auto [ww, pp] = pq.top();
        pq.pop();
        auto [u, lst] = pp;

        if (ww > dp[u][lst])
            continue;

        for (auto [v, c, p] : adj[u]){
            if(v == lst) p = 0;
            sum[c] += p;
        }

        for (auto [v, c, p] : adj[u]) {
            if(v == lst) p = 0;
            //Dont change this edge, change all others
            if (dp[v][0] > dp[u][lst] + min(p,sum[c] - p)) {
                dp[v][0] = dp[u][lst] + min(p,sum[c] - p);
                pq.push({dp[v][0], {v, 0}});
            }

            //Change this edge, using p
            if (dp[v][u] > dp[u][lst] + p) {
                dp[v][u] = dp[u][lst] + p;
                pq.push({dp[v][u], {v, u}});
            }
        }

        for (auto [v, c, p] : adj[u]){
            if(v == lst) p = 0;
            sum[c] -= p;
        }
    }

    int ans = 1e18;

    for (int i = 0; i <= m; i++) {
        ans = min(ans, dp[n][i]);
    }

    cout << (ans == 1e18 ? -1 : ans) << "\n";
}

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