Submission #379870

# Submission time Handle Problem Language Result Execution time Memory
379870 2021-03-19T15:09:13 Z doowey Robot (JOI21_ho_t4) C++14
100 / 100
2132 ms 174824 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)2e5 + 100;

map<int, vector<pii>> E[N];
map<int, ll> cum[N];

map<int, ll> dp[N][2];
map<int, bool> proc[N][2];
int cnt[N];
bool any[N];

struct state{
    int node;
    ll distance;
    int mode;
    int color;
    bool operator< (const state &aq) const {
        return distance > aq.distance;
    }
};

int main(){
    fastIO;
    int n, m;
    cin >> n >> m;
    int ui, vi, ci, pi;
    for(int i = 1; i <= m; i ++ ){
        cin >> ui >> vi >> ci >> pi;
        E[ui][ci].push_back(mp(vi, pi));
        E[vi][ci].push_back(mp(ui, pi));
        cum[ui][ci] += pi;
        cum[vi][ci] += pi;
    }
    priority_queue<state> pq;
    pq.push({1, 0ll, 0ll, 0ll});
    dp[1][0][0] = 0;
    int node;
    ll dis;
    int mode;
    int colr;
    ll gg;
    while(!pq.empty()){
        node = pq.top().node;
        dis = pq.top().distance;
        mode = pq.top().mode;
        colr = pq.top().color;
        pq.pop();
        if(proc[node][mode][colr]) continue;
        proc[node][mode][colr] = true;
        if(mode == false){
            if(node == n){
                cout << dis << "\n";
                return 0;
            }
            if(cnt[node] == 2) continue;
            cnt[node] ++ ;
            for(auto x : E[node]){
                for(auto y : x.se){
                    gg = dis + y.se;
                    if(!dp[y.fi][0].count(x.fi) || dp[y.fi][0][x.fi] > gg){
                        dp[y.fi][0][x.fi] = gg;
                        pq.push({y.fi, gg, 0, 0});
                    }
                    gg = dis;
                    if(!dp[y.fi][1].count(x.fi) || dp[y.fi][1][x.fi] > gg){
                        dp[y.fi][1][x.fi] = gg;
                        pq.push({y.fi, gg, 1, x.fi});
                    }
                    if(x.fi != colr){
                        gg = dis + cum[node][x.fi] - y.se;
                        if(!dp[y.fi][0].count(x.fi) || dp[y.fi][0][x.fi] > gg){
                            dp[y.fi][0][x.fi] = gg;
                            pq.push({y.fi, gg, 0, x.fi});
                        }
                    }
                }
            }
        }
        else{
            gg = dis + cum[node][colr];
            for(auto x : E[node][colr]){
                if(!dp[x.fi][0].count(colr) || dp[x.fi][0][colr] > gg - x.se){
                    dp[x.fi][0][colr] = gg - x.se;
                    pq.push({x.fi, gg - x.se, 0, colr});
                }
            }
        }
    }
    cout << "-1\n";
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:8:12: warning: narrowing conversion of 'y.std::pair<long long int, long long int>::first' from 'long long int' to 'int' [-Wnarrowing]
    8 | #define fi first
      |            ^
Main.cpp:73:36: note: in expansion of macro 'fi'
   73 |                         pq.push({y.fi, gg, 0, 0});
      |                                    ^~
Main.cpp:8:12: warning: narrowing conversion of 'y.std::pair<long long int, long long int>::first' from 'long long int' to 'int' [-Wnarrowing]
    8 | #define fi first
      |            ^
Main.cpp:78:36: note: in expansion of macro 'fi'
   78 |                         pq.push({y.fi, gg, 1, x.fi});
      |                                    ^~
Main.cpp:8:12: warning: narrowing conversion of 'y.std::pair<long long int, long long int>::first' from 'long long int' to 'int' [-Wnarrowing]
    8 | #define fi first
      |            ^
Main.cpp:84:40: note: in expansion of macro 'fi'
   84 |                             pq.push({y.fi, gg, 0, x.fi});
      |                                        ^~
Main.cpp:8:12: warning: narrowing conversion of 'x.std::pair<long long int, long long int>::first' from 'long long int' to 'int' [-Wnarrowing]
    8 | #define fi first
      |            ^
Main.cpp:95:32: note: in expansion of macro 'fi'
   95 |                     pq.push({x.fi, gg - x.se, 0, colr});
      |                                ^~
# Verdict Execution time Memory Grader output
1 Correct 39 ms 56684 KB Output is correct
2 Correct 38 ms 56812 KB Output is correct
3 Correct 38 ms 56684 KB Output is correct
4 Correct 38 ms 56684 KB Output is correct
5 Correct 43 ms 56812 KB Output is correct
6 Correct 38 ms 56684 KB Output is correct
7 Correct 43 ms 57068 KB Output is correct
8 Correct 39 ms 56812 KB Output is correct
9 Correct 46 ms 57964 KB Output is correct
10 Correct 43 ms 57580 KB Output is correct
11 Correct 41 ms 57324 KB Output is correct
12 Correct 40 ms 57196 KB Output is correct
13 Correct 41 ms 57452 KB Output is correct
14 Correct 41 ms 57324 KB Output is correct
15 Correct 41 ms 57196 KB Output is correct
16 Correct 41 ms 57324 KB Output is correct
17 Correct 42 ms 57324 KB Output is correct
18 Correct 40 ms 56940 KB Output is correct
19 Correct 42 ms 57068 KB Output is correct
20 Correct 40 ms 57196 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 416 ms 87204 KB Output is correct
2 Correct 204 ms 72992 KB Output is correct
3 Correct 271 ms 76000 KB Output is correct
4 Correct 222 ms 75424 KB Output is correct
5 Correct 1679 ms 166356 KB Output is correct
6 Correct 1333 ms 147780 KB Output is correct
7 Correct 530 ms 111260 KB Output is correct
8 Correct 687 ms 111616 KB Output is correct
9 Correct 713 ms 111596 KB Output is correct
10 Correct 636 ms 106624 KB Output is correct
11 Correct 197 ms 74900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 39 ms 56684 KB Output is correct
2 Correct 38 ms 56812 KB Output is correct
3 Correct 38 ms 56684 KB Output is correct
4 Correct 38 ms 56684 KB Output is correct
5 Correct 43 ms 56812 KB Output is correct
6 Correct 38 ms 56684 KB Output is correct
7 Correct 43 ms 57068 KB Output is correct
8 Correct 39 ms 56812 KB Output is correct
9 Correct 46 ms 57964 KB Output is correct
10 Correct 43 ms 57580 KB Output is correct
11 Correct 41 ms 57324 KB Output is correct
12 Correct 40 ms 57196 KB Output is correct
13 Correct 41 ms 57452 KB Output is correct
14 Correct 41 ms 57324 KB Output is correct
15 Correct 41 ms 57196 KB Output is correct
16 Correct 41 ms 57324 KB Output is correct
17 Correct 42 ms 57324 KB Output is correct
18 Correct 40 ms 56940 KB Output is correct
19 Correct 42 ms 57068 KB Output is correct
20 Correct 40 ms 57196 KB Output is correct
21 Correct 416 ms 87204 KB Output is correct
22 Correct 204 ms 72992 KB Output is correct
23 Correct 271 ms 76000 KB Output is correct
24 Correct 222 ms 75424 KB Output is correct
25 Correct 1679 ms 166356 KB Output is correct
26 Correct 1333 ms 147780 KB Output is correct
27 Correct 530 ms 111260 KB Output is correct
28 Correct 687 ms 111616 KB Output is correct
29 Correct 713 ms 111596 KB Output is correct
30 Correct 636 ms 106624 KB Output is correct
31 Correct 197 ms 74900 KB Output is correct
32 Correct 232 ms 71992 KB Output is correct
33 Correct 290 ms 74852 KB Output is correct
34 Correct 581 ms 106396 KB Output is correct
35 Correct 441 ms 93072 KB Output is correct
36 Correct 484 ms 104904 KB Output is correct
37 Correct 596 ms 108120 KB Output is correct
38 Correct 559 ms 113164 KB Output is correct
39 Correct 230 ms 75240 KB Output is correct
40 Correct 730 ms 113492 KB Output is correct
41 Correct 791 ms 113644 KB Output is correct
42 Correct 993 ms 126268 KB Output is correct
43 Correct 440 ms 88604 KB Output is correct
44 Correct 553 ms 90632 KB Output is correct
45 Correct 532 ms 108012 KB Output is correct
46 Correct 431 ms 106604 KB Output is correct
47 Correct 553 ms 107576 KB Output is correct
48 Correct 2132 ms 174824 KB Output is correct