oj.uz

Submission #526654

# Submission time Handle Problem Language Result Execution time Memory
526654 2022-02-15T20:57:54 Z Lobo Robot (JOI21_ho_t4) C++17
100 / 100
 852 ms 120092 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 220000

int n, m;
vector<pair<int,pair<int,int>>> g[maxn];
map<int,vector<pair<int,int>>> gc[maxn];
map<int,int> d[maxn], sm[maxn];

void shp() {
    for(int i = 1; i <= n; i++) {
        d[i][0] = inf;
        for(auto V : g[i]) {
            d[i][V.sc.fr] = inf;
        }
    }

    d[1][0] = 0;
    priority_queue<pair<int,pair<int,int>>> pq;
    pq.push(mp(0,mp(1,0)));

    while(pq.size()) {
        int u = pq.top().sc.fr;
        int dist = -pq.top().fr;
        int cl = pq.top().sc.sc;
        pq.pop();

        if(dist != d[u][cl]) continue;

        if(cl == 0) {
            for(auto V : g[u]) {
                int v = V.fr;
                int c = V.sc.fr;
                int w = V.sc.sc;

                //usando o c e so podendo usar ele no proximo
                if(d[v][c] > d[u][0]) {
                    d[v][c] = d[u][0];
                    pq.push(mp(-d[v][c],mp(v,c)));
                }

                //passando pro proximo e fodase e os caralho
                if(d[v][0] > d[u][0] + min(sm[u][c]-w,w)) {
                    d[v][0] = d[u][0] + min(sm[u][c]-w,w);
                    pq.push(mp(-d[v][0],mp(v,0)));
                }
            }
        }
        else {
            for(auto V : gc[u][cl]) {
                int v = V.fr;
                int w = V.sc;
                int c = cl;

                // nunca continua em c fodase vtnc
                // if(d[v][c] > d[u][c] + sm[u][c] - w) {
                //     d[v][c] = d[u][c] + sm[u][c] - w;
                //     pq.push(mp(-d[v][c],mp(v,c)));
                // }

                //muda pra 0
                if(d[v][0] > d[u][c] + sm[u][c] - w) {
                    d[v][0] = d[u][c] + sm[u][c] - w;
                    pq.push(mp(-d[v][0],mp(v,0)));
                }
            }
        }
    }
}

void solve() {
    cin >> n >> m;

    for(int i = 1; i <= m; i++) {
        int u, v, c, w;
        cin >> u >> v >> c >> w;

        g[u].pb(mp(v,mp(c,w)));
        g[v].pb(mp(u,mp(c,w)));
    }

    for(int i = 1; i <= n; i++) {
        for(auto V : g[i]) {
            int v = V.fr;
            int c = V.sc.fr;
            int w = V.sc.sc;

            gc[i][c].pb(mp(v,w));
            sm[i][c]+= w;
        }
    }

    shp();

    int ans = d[n][0];

    // for(int i = 1; i <= n; i++) {
    //     for(int j = 0; j < g[i].size(); j++) {
    //         cout << i << " " << j << " " << d[i][j] << endl;
    //     }
    // }

    if(ans == inf) cout << -1 << endl;
    else cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
    
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 36428 KB Output is correct
2 Correct 19 ms 36396 KB Output is correct
3 Correct 20 ms 36484 KB Output is correct
4 Correct 21 ms 36472 KB Output is correct
5 Correct 18 ms 36488 KB Output is correct
6 Correct 17 ms 36452 KB Output is correct
7 Correct 18 ms 36604 KB Output is correct
8 Correct 17 ms 36452 KB Output is correct
9 Correct 21 ms 37260 KB Output is correct
10 Correct 21 ms 37112 KB Output is correct
11 Correct 18 ms 36964 KB Output is correct
12 Correct 18 ms 36936 KB Output is correct
13 Correct 19 ms 37080 KB Output is correct
14 Correct 19 ms 37068 KB Output is correct
15 Correct 18 ms 36820 KB Output is correct
16 Correct 19 ms 36940 KB Output is correct
17 Correct 18 ms 36940 KB Output is correct
18 Correct 18 ms 36684 KB Output is correct
19 Correct 24 ms 36840 KB Output is correct
20 Correct 18 ms 36896 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 62580 KB Output is correct
2 Correct 82 ms 49784 KB Output is correct
3 Correct 151 ms 61552 KB Output is correct
4 Correct 129 ms 53904 KB Output is correct
5 Correct 793 ms 120092 KB Output is correct
6 Correct 597 ms 108884 KB Output is correct
7 Correct 274 ms 88348 KB Output is correct
8 Correct 316 ms 86156 KB Output is correct
9 Correct 323 ms 86212 KB Output is correct
10 Correct 264 ms 81020 KB Output is correct
11 Correct 101 ms 68004 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 36428 KB Output is correct
2 Correct 19 ms 36396 KB Output is correct
3 Correct 20 ms 36484 KB Output is correct
4 Correct 21 ms 36472 KB Output is correct
5 Correct 18 ms 36488 KB Output is correct
6 Correct 17 ms 36452 KB Output is correct
7 Correct 18 ms 36604 KB Output is correct
8 Correct 17 ms 36452 KB Output is correct
9 Correct 21 ms 37260 KB Output is correct
10 Correct 21 ms 37112 KB Output is correct
11 Correct 18 ms 36964 KB Output is correct
12 Correct 18 ms 36936 KB Output is correct
13 Correct 19 ms 37080 KB Output is correct
14 Correct 19 ms 37068 KB Output is correct
15 Correct 18 ms 36820 KB Output is correct
16 Correct 19 ms 36940 KB Output is correct
17 Correct 18 ms 36940 KB Output is correct
18 Correct 18 ms 36684 KB Output is correct
19 Correct 24 ms 36840 KB Output is correct
20 Correct 18 ms 36896 KB Output is correct
21 Correct 165 ms 62580 KB Output is correct
22 Correct 82 ms 49784 KB Output is correct
23 Correct 151 ms 61552 KB Output is correct
24 Correct 129 ms 53904 KB Output is correct
25 Correct 793 ms 120092 KB Output is correct
26 Correct 597 ms 108884 KB Output is correct
27 Correct 274 ms 88348 KB Output is correct
28 Correct 316 ms 86156 KB Output is correct
29 Correct 323 ms 86212 KB Output is correct
30 Correct 264 ms 81020 KB Output is correct
31 Correct 101 ms 68004 KB Output is correct
32 Correct 123 ms 55056 KB Output is correct
33 Correct 140 ms 58020 KB Output is correct
34 Correct 350 ms 81336 KB Output is correct
35 Correct 257 ms 71740 KB Output is correct
36 Correct 259 ms 78004 KB Output is correct
37 Correct 282 ms 84212 KB Output is correct
38 Correct 296 ms 94628 KB Output is correct
39 Correct 136 ms 61508 KB Output is correct
40 Correct 323 ms 86180 KB Output is correct
41 Correct 353 ms 86392 KB Output is correct
42 Correct 422 ms 98296 KB Output is correct
43 Correct 174 ms 66204 KB Output is correct
44 Correct 283 ms 74588 KB Output is correct
45 Correct 272 ms 80420 KB Output is correct
46 Correct 226 ms 79412 KB Output is correct
47 Correct 268 ms 81420 KB Output is correct
48 Correct 852 ms 119300 KB Output is correct