oj.uz

답안 #874850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874850 2023-11-18T00:24:51 Z perohero Robot (JOI21_ho_t4) C++17
100 / 100
 753 ms 84544 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Edge {
    int to;
    int c;
    ll p;
};

const int N = 1e5 + 7;
const ll INF = 1e18;

int n, m;
map<int, vector<Edge>> g[N];
ll dp[N];
map<int, ll> dp2[N], psum[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b, c, p;
        cin >> a >> b >> c >> p;
        g[a][c].push_back({b, c, p});
        g[b][c].push_back({a, c, p});
        psum[a][c] += p;
        psum[b][c] += p;
    }
    for (int i = 1; i <= n; ++i) {
        dp[i] = INF;
    }
    priority_queue<tuple<ll, int, int>> pq;
    dp[1] = 0;
    pq.push({0, 1, 0});
    while (!pq.empty()) {
        ll cost;
        int u, c;
        tie(cost, u, c) = pq.top();
        pq.pop();
        if (c) {
            if (dp2[u][c] != -cost) {
                continue;
            }
            for (auto v : g[u][c]) {
                // we cant flip
                ll relax = psum[u][c] - v.p;
                if (relax - cost < dp[v.to]) {
                    dp[v.to] = relax - cost;
                    pq.push({-dp[v.to], v.to, 0});
                }
            }
        } else {
            if (dp[u] != -cost) {
                continue;
            }
            for (auto v : g[u]) {
                for (auto edg : v.second) {
                    // we dont flip j
                    ll relax = psum[u][edg.c] - edg.p - cost;
                    if (relax < dp[edg.to]) {
                        dp[edg.to] = relax;
                        pq.push({-dp[edg.to], edg.to, 0});
                    }
                    // we flip j but not another edge of the same colour
                    relax = edg.p - cost;
                    if (relax < dp[edg.to]) {
                        dp[edg.to] = relax;
                        pq.push({-dp[edg.to], edg.to, 0});
                    }
                    // we flip j and another edge of the same colour
                    relax = -cost;
                    if (!dp2[edg.to].count(edg.c) || relax < dp2[edg.to][edg.c]) {
                        dp2[edg.to][edg.c] = relax;
                        pq.push({-dp2[edg.to][edg.c], edg.to, edg.c});
                    }
                }
            }
        }
    }
    if (dp[n] == INF) {
        dp[n] = -1;
    }
    cout << dp[n];
    return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15292 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 4 ms 15376 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 6 ms 15964 KB Output is correct
10 Correct 5 ms 15708 KB Output is correct
11 Correct 5 ms 15596 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15708 KB Output is correct
14 Correct 4 ms 15536 KB Output is correct
15 Correct 5 ms 15604 KB Output is correct
16 Correct 4 ms 15600 KB Output is correct
17 Correct 4 ms 15540 KB Output is correct
18 Correct 3 ms 15452 KB Output is correct
19 Correct 4 ms 15548 KB Output is correct
20 Correct 4 ms 15616 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 33728 KB Output is correct
2 Correct 49 ms 25344 KB Output is correct
3 Correct 109 ms 32200 KB Output is correct
4 Correct 117 ms 28392 KB Output is correct
5 Correct 739 ms 82596 KB Output is correct
6 Correct 584 ms 72748 KB Output is correct
7 Correct 264 ms 59420 KB Output is correct
8 Correct 283 ms 50932 KB Output is correct
9 Correct 310 ms 51312 KB Output is correct
10 Correct 249 ms 48328 KB Output is correct
11 Correct 103 ms 32696 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15292 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 4 ms 15376 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 6 ms 15964 KB Output is correct
10 Correct 5 ms 15708 KB Output is correct
11 Correct 5 ms 15596 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15708 KB Output is correct
14 Correct 4 ms 15536 KB Output is correct
15 Correct 5 ms 15604 KB Output is correct
16 Correct 4 ms 15600 KB Output is correct
17 Correct 4 ms 15540 KB Output is correct
18 Correct 3 ms 15452 KB Output is correct
19 Correct 4 ms 15548 KB Output is correct
20 Correct 4 ms 15616 KB Output is correct
21 Correct 126 ms 33728 KB Output is correct
22 Correct 49 ms 25344 KB Output is correct
23 Correct 109 ms 32200 KB Output is correct
24 Correct 117 ms 28392 KB Output is correct
25 Correct 739 ms 82596 KB Output is correct
26 Correct 584 ms 72748 KB Output is correct
27 Correct 264 ms 59420 KB Output is correct
28 Correct 283 ms 50932 KB Output is correct
29 Correct 310 ms 51312 KB Output is correct
30 Correct 249 ms 48328 KB Output is correct
31 Correct 103 ms 32696 KB Output is correct
32 Correct 95 ms 29140 KB Output is correct
33 Correct 99 ms 30036 KB Output is correct
34 Correct 322 ms 50624 KB Output is correct
35 Correct 201 ms 41920 KB Output is correct
36 Correct 239 ms 47272 KB Output is correct
37 Correct 294 ms 50620 KB Output is correct
38 Correct 254 ms 57656 KB Output is correct
39 Correct 83 ms 32460 KB Output is correct
40 Correct 291 ms 52132 KB Output is correct
41 Correct 352 ms 52648 KB Output is correct
42 Correct 378 ms 60996 KB Output is correct
43 Correct 127 ms 37644 KB Output is correct
44 Correct 234 ms 43464 KB Output is correct
45 Correct 250 ms 47700 KB Output is correct
46 Correct 193 ms 48040 KB Output is correct
47 Correct 247 ms 51500 KB Output is correct
48 Correct 753 ms 84544 KB Output is correct