oj.uz

Submission #446302

# Submission time Handle Problem Language Result Execution time Memory
446302 2021-07-21T14:10:01 Z 233 Robot (JOI21_ho_t4) C++11
100 / 100
 1060 ms 84400 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> dp2[100001], 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});
    while (pq.size()) {
        ll cost;
        int node, c;
        tie(cost, node, c) = pq.top();
        pq.pop();
        
        if (c) {
            if (dp2[node][c] != -cost) continue;
            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 {
            if (dp[node] != -cost) continue;
            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;
                    if (case1 < dp[j.to]) {
                        dp[j.to] = case1;
                        pq.push({-dp[j.to], j.to, 0});
                    }
                    // Case 2: We flip j but not another edge of the same colour
                    ll case2 = j.p - cost;
                    if (case2 < dp[j.to]) {
                        dp[j.to] = case2;
                        pq.push({-dp[j.to], j.to, 0});
                    }
                    // Case 3: We flip j and another edge of the same colour
                    ll case3 = -cost;
                    if (!dp2[j.to].count(j.c) || case3 < dp2[j.to][j.c]) {
                        dp2[j.to][j.c] = case3;
                        pq.push({-dp2[j.to][j.c], 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 8 ms 15140 KB Output is correct
2 Correct 8 ms 15180 KB Output is correct
3 Correct 10 ms 15116 KB Output is correct
4 Correct 10 ms 15180 KB Output is correct
5 Correct 8 ms 15180 KB Output is correct
6 Correct 8 ms 15180 KB Output is correct
7 Correct 9 ms 15316 KB Output is correct
8 Correct 9 ms 15188 KB Output is correct
9 Correct 12 ms 15820 KB Output is correct
10 Correct 11 ms 15692 KB Output is correct
11 Correct 11 ms 15524 KB Output is correct
12 Correct 10 ms 15444 KB Output is correct
13 Correct 10 ms 15448 KB Output is correct
14 Correct 10 ms 15564 KB Output is correct
15 Correct 10 ms 15372 KB Output is correct
16 Correct 11 ms 15436 KB Output is correct
17 Correct 13 ms 15564 KB Output is correct
18 Correct 11 ms 15308 KB Output is correct
19 Correct 10 ms 15464 KB Output is correct
20 Correct 10 ms 15564 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 35024 KB Output is correct
2 Correct 84 ms 25196 KB Output is correct
3 Correct 245 ms 32120 KB Output is correct
4 Correct 125 ms 28344 KB Output is correct
5 Correct 978 ms 82584 KB Output is correct
6 Correct 720 ms 71848 KB Output is correct
7 Correct 374 ms 56300 KB Output is correct
8 Correct 442 ms 50860 KB Output is correct
9 Correct 456 ms 50908 KB Output is correct
10 Correct 347 ms 48328 KB Output is correct
11 Correct 137 ms 32736 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15140 KB Output is correct
2 Correct 8 ms 15180 KB Output is correct
3 Correct 10 ms 15116 KB Output is correct
4 Correct 10 ms 15180 KB Output is correct
5 Correct 8 ms 15180 KB Output is correct
6 Correct 8 ms 15180 KB Output is correct
7 Correct 9 ms 15316 KB Output is correct
8 Correct 9 ms 15188 KB Output is correct
9 Correct 12 ms 15820 KB Output is correct
10 Correct 11 ms 15692 KB Output is correct
11 Correct 11 ms 15524 KB Output is correct
12 Correct 10 ms 15444 KB Output is correct
13 Correct 10 ms 15448 KB Output is correct
14 Correct 10 ms 15564 KB Output is correct
15 Correct 10 ms 15372 KB Output is correct
16 Correct 11 ms 15436 KB Output is correct
17 Correct 13 ms 15564 KB Output is correct
18 Correct 11 ms 15308 KB Output is correct
19 Correct 10 ms 15464 KB Output is correct
20 Correct 10 ms 15564 KB Output is correct
21 Correct 203 ms 35024 KB Output is correct
22 Correct 84 ms 25196 KB Output is correct
23 Correct 245 ms 32120 KB Output is correct
24 Correct 125 ms 28344 KB Output is correct
25 Correct 978 ms 82584 KB Output is correct
26 Correct 720 ms 71848 KB Output is correct
27 Correct 374 ms 56300 KB Output is correct
28 Correct 442 ms 50860 KB Output is correct
29 Correct 456 ms 50908 KB Output is correct
30 Correct 347 ms 48328 KB Output is correct
31 Correct 137 ms 32736 KB Output is correct
32 Correct 170 ms 29132 KB Output is correct
33 Correct 182 ms 29840 KB Output is correct
34 Correct 422 ms 50544 KB Output is correct
35 Correct 340 ms 41848 KB Output is correct
36 Correct 325 ms 46844 KB Output is correct
37 Correct 404 ms 49120 KB Output is correct
38 Correct 385 ms 55572 KB Output is correct
39 Correct 174 ms 32444 KB Output is correct
40 Correct 458 ms 52296 KB Output is correct
41 Correct 490 ms 52444 KB Output is correct
42 Correct 525 ms 60804 KB Output is correct
43 Correct 234 ms 37516 KB Output is correct
44 Correct 476 ms 43388 KB Output is correct
45 Correct 337 ms 47552 KB Output is correct
46 Correct 299 ms 47872 KB Output is correct
47 Correct 342 ms 49100 KB Output is correct
48 Correct 1060 ms 84400 KB Output is correct