oj.uz

Submission #416054

# Submission time Handle Problem Language Result Execution time Memory
416054 2021-06-01T21:13:47 Z meatrow Robot (JOI21_ho_t4) C++17
100 / 100
 1397 ms 86380 KB 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
 
const int MOD = 1e9 + 7;
 
ll binpow(ll a, ll p, int mod = MOD) {
    ll res = 1;
    while (p) {
        if (p & 1) {
            (res *= a) %= mod;
        }
        p >>= 1;
        (a *= a) %= mod;
    }
    return res;
}
 
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}
 
struct Edge {
    int a, b, color, price;
};
 
void solve() {
    int n, m;
    cin >> n >> m;
    vector<Edge> edges(m);
    vector<vector<int>> g(n + 1), col(n + 1);
    vector<map<int, int>> rev(n + 1), start(n + 1), end(n + 1);

    for (int i = 0; i < m; i++) {
        cin >> edges[i].a >> edges[i].b >> edges[i].color >> edges[i].price;
        g[edges[i].a].push_back(i);
        g[edges[i].b].push_back(i);
    }

    for (int i = 1; i <= n; i++) {
        sort(g[i].begin(), g[i].end(), [&](int a, int b) {
            return edges[a].color < edges[b].color;
        });
        for (int j = 0; j < g[i].size(); j++) {
            int c = edges[g[i][j]].color;
            if (!start[i].count(c)) {
                start[i][c] = j;
            }
            end[i][c] = j;
            if (col[i].empty() || c != col[i].back()) {
                rev[i][c] = col[i].size();
                col[i].push_back(c);
            }
        }
    }
    
    vector<vector<ll>> dist(n + 1);
    for (int i = 1; i <= n; i++) {
        dist[i].assign(col[i].size() + 1, 1e18);
    }
    dist[1][col[1].size()] = 0;
    set<pair<ll, pair<int, int>>> setik;
    setik.insert({0, {1, col[1].size()}});
    ll ans = 1e18;
    while (!setik.empty()) {
        int v, from;
        tie(v, from) = setik.begin()->second;
        if (v == n && from == col[n].size()) {
            ans = min(ans, dist[v][from]);
        }
        setik.erase(setik.begin());

        if (from == col[v].size()) {
            map<int, ll> sum;
            for (int i = 0; i < g[v].size(); i++) {
                auto& edge = edges[g[v][i]];
                sum[edge.color] += edge.price;
            }
            for (int i = 0; i < g[v].size(); i++) {
                auto& edge = edges[g[v][i]];
                int to = edge.a ^ edge.b ^ v;
                ll w = 0;
                int id = rev[to][edge.color];
                if (dist[v][from] + w < dist[to][id]) {
                    setik.erase({dist[to][id], {to, id}});
                    dist[to][id] = dist[v][from] + w;
                    setik.insert({dist[to][id], {to, id}});
                }
                w = min<ll>(edge.price, sum[edge.color] - edge.price);
                id = col[to].size();
                if (dist[v][from] + w < dist[to][id]) {
                    setik.erase({dist[to][id], {to, id}});
                    dist[to][id] = dist[v][from] + w;
                    setik.insert({dist[to][id], {to, id}});
                }
            }
            continue;
        }

        // color has changed
        int color = col[v][from];
        ll sum = 0;
        for (int i = start[v][color]; i <= end[v][color]; i++) {
            sum += edges[g[v][i]].price;
        }
        for (int i = start[v][color]; i <= end[v][color]; i++) {
            auto& edge = edges[g[v][i]];
            int to = edge.a ^ edge.b ^ v;
            ll w = sum - edge.price;
            int id = col[to].size();
            if (dist[v][from] + w < dist[to][id]) {
                setik.erase({dist[to][id], {to, id}});
                dist[to][id] = dist[v][from] + w;
                setik.insert({dist[to][id], {to, id}});
            }
        }
    }
 
    if (ans == 1e18) ans = -1;
    cout << ans << '\n';
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin >> T;
    for (int tc = 1; tc <= T; tc++) {
        // cout << "Case #" << tc << ": ";
        solve();
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int j = 0; j < g[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~
Main.cpp:73:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         if (v == n && from == col[n].size()) {
      |                       ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:78:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         if (from == col[v].size()) {
      |             ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:80:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             for (int i = 0; i < g[v].size(); i++) {
      |                             ~~^~~~~~~~~~~~~
Main.cpp:84:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             for (int i = 0; i < g[v].size(); i++) {
      |                             ~~^~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 6 ms 1100 KB Output is correct
10 Correct 5 ms 972 KB Output is correct
11 Correct 4 ms 984 KB Output is correct
12 Correct 3 ms 836 KB Output is correct
13 Correct 4 ms 844 KB Output is correct
14 Correct 4 ms 844 KB Output is correct
15 Correct 3 ms 704 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 3 ms 708 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 22580 KB Output is correct
2 Correct 92 ms 12488 KB Output is correct
3 Correct 200 ms 17404 KB Output is correct
4 Correct 134 ms 17256 KB Output is correct
5 Correct 1324 ms 84928 KB Output is correct
6 Correct 897 ms 74476 KB Output is correct
7 Correct 537 ms 65348 KB Output is correct
8 Correct 460 ms 52740 KB Output is correct
9 Correct 454 ms 52680 KB Output is correct
10 Correct 341 ms 41688 KB Output is correct
11 Correct 124 ms 39448 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 6 ms 1100 KB Output is correct
10 Correct 5 ms 972 KB Output is correct
11 Correct 4 ms 984 KB Output is correct
12 Correct 3 ms 836 KB Output is correct
13 Correct 4 ms 844 KB Output is correct
14 Correct 4 ms 844 KB Output is correct
15 Correct 3 ms 704 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 3 ms 708 KB Output is correct
21 Correct 254 ms 22580 KB Output is correct
22 Correct 92 ms 12488 KB Output is correct
23 Correct 200 ms 17404 KB Output is correct
24 Correct 134 ms 17256 KB Output is correct
25 Correct 1324 ms 84928 KB Output is correct
26 Correct 897 ms 74476 KB Output is correct
27 Correct 537 ms 65348 KB Output is correct
28 Correct 460 ms 52740 KB Output is correct
29 Correct 454 ms 52680 KB Output is correct
30 Correct 341 ms 41688 KB Output is correct
31 Correct 124 ms 39448 KB Output is correct
32 Correct 203 ms 10008 KB Output is correct
33 Correct 229 ms 16680 KB Output is correct
34 Correct 536 ms 38524 KB Output is correct
35 Correct 416 ms 32048 KB Output is correct
36 Correct 409 ms 53368 KB Output is correct
37 Correct 615 ms 57576 KB Output is correct
38 Correct 657 ms 65060 KB Output is correct
39 Correct 164 ms 14148 KB Output is correct
40 Correct 382 ms 54116 KB Output is correct
41 Correct 491 ms 54204 KB Output is correct
42 Correct 608 ms 61636 KB Output is correct
43 Correct 193 ms 24260 KB Output is correct
44 Correct 436 ms 23228 KB Output is correct
45 Correct 353 ms 51524 KB Output is correct
46 Correct 334 ms 50600 KB Output is correct
47 Correct 479 ms 57436 KB Output is correct
48 Correct 1397 ms 86380 KB Output is correct