oj.uz

Submission #623303

# Submission time Handle Problem Language Result Execution time Memory
623303 2022-08-05T12:28:29 Z BhavayGoyal Robot (JOI21_ho_t4) C++14
100 / 100
 1047 ms 84676 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll INF = 1e18;

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

map<int, vector<Edge>> graph[100001];
ll dp[100001];
map<int, ll> psum[100001];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int u, v, c;
        ll p;
        cin >> u >> v >> c >> p;
        graph[u][c].push_back({v, c, p});
        graph[v][c].push_back({u, c, p});
        psum[u][c] += p;
        psum[v][c] += p;
    }

    memset(dp, 0x3f, sizeof dp);
    dp[1] = 0;
    priority_queue<tuple<ll, int, int>> pq;
    pq.push({0, 1, 0});
    map<int, int> vis[n+1];
    while (pq.size()) {
        ll cost;
        int node, c;
        tie(cost, node, c) = pq.top();
        pq.pop();
        if (vis[node][c]) continue;
        vis[node][c] = true;

        if (c) {
            for (Edge i : graph[node][c]) {
                // We can't flip i in this case
                ll case1 = psum[node][c] - i.p;
                if (case1 - cost < dp[i.to]) {
                    dp[i.to] = case1 - cost;
                    pq.push({-dp[i.to], i.to, 0});
                }
            }
        } else {
            for (auto& i : graph[node]) {
                for (Edge j : i.second) {

                    // Case 1: We don't flip j
                    ll case1 = psum[node][j.c] - j.p - cost;

                    // Case 2: We flip j but not another edge of the same colour
                    ll case2 = j.p - cost;

                    // taking min of both cases
                    ll mnCase = min(case1, case2);
                    dp[j.to] = min(mnCase, dp[j.to]);
                    pq.push({-dp[j.to], j.to, 0});
                    
                    // Case 3: We flip j and another edge of the same colour
                    ll case3 = -cost;
                    pq.push({-case3, j.to, j.c});
                    pq.push({-case3, j.to, j.c});
                }
            }
        }
    }
    cout << (dp[n] > INF ? -1 : dp[n]);
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 7 ms 10496 KB Output is correct
3 Correct 7 ms 10452 KB Output is correct
4 Correct 5 ms 10452 KB Output is correct
5 Correct 6 ms 10452 KB Output is correct
6 Correct 6 ms 10452 KB Output is correct
7 Correct 7 ms 10580 KB Output is correct
8 Correct 6 ms 10444 KB Output is correct
9 Correct 10 ms 11220 KB Output is correct
10 Correct 10 ms 11124 KB Output is correct
11 Correct 8 ms 10936 KB Output is correct
12 Correct 8 ms 10836 KB Output is correct
13 Correct 8 ms 10960 KB Output is correct
14 Correct 9 ms 10956 KB Output is correct
15 Correct 7 ms 10708 KB Output is correct
16 Correct 8 ms 10788 KB Output is correct
17 Correct 8 ms 10836 KB Output is correct
18 Correct 6 ms 10708 KB Output is correct
19 Correct 8 ms 10708 KB Output is correct
20 Correct 7 ms 10836 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 31200 KB Output is correct
2 Correct 108 ms 21100 KB Output is correct
3 Correct 314 ms 28236 KB Output is correct
4 Correct 170 ms 24640 KB Output is correct
5 Correct 1036 ms 84676 KB Output is correct
6 Correct 740 ms 73596 KB Output is correct
7 Correct 431 ms 54296 KB Output is correct
8 Correct 493 ms 49452 KB Output is correct
9 Correct 540 ms 49356 KB Output is correct
10 Correct 371 ms 44740 KB Output is correct
11 Correct 119 ms 30092 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 7 ms 10496 KB Output is correct
3 Correct 7 ms 10452 KB Output is correct
4 Correct 5 ms 10452 KB Output is correct
5 Correct 6 ms 10452 KB Output is correct
6 Correct 6 ms 10452 KB Output is correct
7 Correct 7 ms 10580 KB Output is correct
8 Correct 6 ms 10444 KB Output is correct
9 Correct 10 ms 11220 KB Output is correct
10 Correct 10 ms 11124 KB Output is correct
11 Correct 8 ms 10936 KB Output is correct
12 Correct 8 ms 10836 KB Output is correct
13 Correct 8 ms 10960 KB Output is correct
14 Correct 9 ms 10956 KB Output is correct
15 Correct 7 ms 10708 KB Output is correct
16 Correct 8 ms 10788 KB Output is correct
17 Correct 8 ms 10836 KB Output is correct
18 Correct 6 ms 10708 KB Output is correct
19 Correct 8 ms 10708 KB Output is correct
20 Correct 7 ms 10836 KB Output is correct
21 Correct 268 ms 31200 KB Output is correct
22 Correct 108 ms 21100 KB Output is correct
23 Correct 314 ms 28236 KB Output is correct
24 Correct 170 ms 24640 KB Output is correct
25 Correct 1036 ms 84676 KB Output is correct
26 Correct 740 ms 73596 KB Output is correct
27 Correct 431 ms 54296 KB Output is correct
28 Correct 493 ms 49452 KB Output is correct
29 Correct 540 ms 49356 KB Output is correct
30 Correct 371 ms 44740 KB Output is correct
31 Correct 119 ms 30092 KB Output is correct
32 Correct 243 ms 22452 KB Output is correct
33 Correct 232 ms 23692 KB Output is correct
34 Correct 504 ms 44856 KB Output is correct
35 Correct 394 ms 36944 KB Output is correct
36 Correct 381 ms 47644 KB Output is correct
37 Correct 459 ms 52144 KB Output is correct
38 Correct 481 ms 62108 KB Output is correct
39 Correct 262 ms 23564 KB Output is correct
40 Correct 499 ms 49324 KB Output is correct
41 Correct 606 ms 49304 KB Output is correct
42 Correct 572 ms 57344 KB Output is correct
43 Correct 232 ms 31524 KB Output is correct
44 Correct 564 ms 34808 KB Output is correct
45 Correct 375 ms 46600 KB Output is correct
46 Correct 309 ms 46768 KB Output is correct
47 Correct 392 ms 49956 KB Output is correct
48 Correct 1047 ms 84268 KB Output is correct