Submission #379077

# Submission time Handle Problem Language Result Execution time Memory
379077 2021-03-17T09:14:29 Z Atill83 Robot (JOI21_ho_t4) C++14
100 / 100
971 ms 110680 KB
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m;
typedef pair<ll, pii> tp;
unordered_map<int, ll> mp[MAXN];
unordered_map<int, ll> dp2[MAXN];
ll dp[MAXN];
unordered_map<int, vector<pll>> adj[MAXN];
int c[MAXN], p[MAXN];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>m;
    for(int i = 1; i <= m; i++){
        int a, b, C, P;
        cin>>a>>b>>C>>P;
        
        mp[a][C] += P;
        mp[b][C] += P;

        adj[a][C].push_back({b, P});
        adj[b][C].push_back({a, P});
    }

    memset(dp, 0x7f, sizeof(dp));
    priority_queue<tp, vector<tp>, greater<tp>> pq;

    pq.push({0, {1, 0}});
    dp[1] = 0;

    while(!pq.empty()){
        tp cur = pq.top();
        pq.pop();
        int col = cur.ss.ss, node = cur.ss.ff;
        ll dist = cur.ff;
        if(cur.ss.ss != 0){
            if(dp2[node][col] < dist)
                continue;
            dp2[node][col] = dist;
            for(pii u: adj[node][col]){
                ll sum = dist + mp[node][col] - u.ss;
                if(dp[u.ff] > sum){
                    dp[u.ff] = sum;
                    pq.push({sum, {u.ff, 0}});
                }
            }
        }else{
            if(dp[node] < dist)
                continue;
            for(auto &y: adj[node]){
                for(auto edg: y.ss){
                    ll d1 = dist + mp[node][y.ff] - edg.ss;
                    if(d1 < dp[edg.ff]){
                        dp[edg.ff] = d1;
                        pq.push({d1, {edg.ff, 0}});
                    }

                    ll d2 = dist + edg.ss;
                    if(d2 < dp[edg.ff]){
                        dp[edg.ff] = d2;
                        pq.push({d2, {edg.ff, 0}});
                    }

                    ll d3 = dist;

                    if(!dp2[edg.ff].count(y.ff) || dist < dp2[edg.ff][y.ff]){
                        dp2[edg.ff][y.ff] = dist;
                        pq.push({d3, {edg.ff, y.ff}});
                    }
                }
            }
        }
    }

    cout<<(dp[n] > INF ? -1 : dp[n])<<endl;


    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}
# Verdict Execution time Memory Grader output
1 Correct 36 ms 51948 KB Output is correct
2 Correct 36 ms 51948 KB Output is correct
3 Correct 36 ms 51948 KB Output is correct
4 Correct 38 ms 52076 KB Output is correct
5 Correct 36 ms 52076 KB Output is correct
6 Correct 36 ms 51948 KB Output is correct
7 Correct 37 ms 52076 KB Output is correct
8 Correct 36 ms 52076 KB Output is correct
9 Correct 40 ms 52588 KB Output is correct
10 Correct 39 ms 52472 KB Output is correct
11 Correct 38 ms 52332 KB Output is correct
12 Correct 40 ms 52332 KB Output is correct
13 Correct 38 ms 52332 KB Output is correct
14 Correct 39 ms 52332 KB Output is correct
15 Correct 37 ms 52204 KB Output is correct
16 Correct 40 ms 52352 KB Output is correct
17 Correct 38 ms 52332 KB Output is correct
18 Correct 37 ms 52204 KB Output is correct
19 Correct 38 ms 52204 KB Output is correct
20 Correct 37 ms 52332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 292 ms 67296 KB Output is correct
2 Correct 132 ms 59876 KB Output is correct
3 Correct 320 ms 64488 KB Output is correct
4 Correct 183 ms 62272 KB Output is correct
5 Correct 890 ms 105000 KB Output is correct
6 Correct 797 ms 98920 KB Output is correct
7 Correct 512 ms 87624 KB Output is correct
8 Correct 564 ms 82108 KB Output is correct
9 Correct 584 ms 82156 KB Output is correct
10 Correct 434 ms 77412 KB Output is correct
11 Correct 204 ms 67436 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 51948 KB Output is correct
2 Correct 36 ms 51948 KB Output is correct
3 Correct 36 ms 51948 KB Output is correct
4 Correct 38 ms 52076 KB Output is correct
5 Correct 36 ms 52076 KB Output is correct
6 Correct 36 ms 51948 KB Output is correct
7 Correct 37 ms 52076 KB Output is correct
8 Correct 36 ms 52076 KB Output is correct
9 Correct 40 ms 52588 KB Output is correct
10 Correct 39 ms 52472 KB Output is correct
11 Correct 38 ms 52332 KB Output is correct
12 Correct 40 ms 52332 KB Output is correct
13 Correct 38 ms 52332 KB Output is correct
14 Correct 39 ms 52332 KB Output is correct
15 Correct 37 ms 52204 KB Output is correct
16 Correct 40 ms 52352 KB Output is correct
17 Correct 38 ms 52332 KB Output is correct
18 Correct 37 ms 52204 KB Output is correct
19 Correct 38 ms 52204 KB Output is correct
20 Correct 37 ms 52332 KB Output is correct
21 Correct 292 ms 67296 KB Output is correct
22 Correct 132 ms 59876 KB Output is correct
23 Correct 320 ms 64488 KB Output is correct
24 Correct 183 ms 62272 KB Output is correct
25 Correct 890 ms 105000 KB Output is correct
26 Correct 797 ms 98920 KB Output is correct
27 Correct 512 ms 87624 KB Output is correct
28 Correct 564 ms 82108 KB Output is correct
29 Correct 584 ms 82156 KB Output is correct
30 Correct 434 ms 77412 KB Output is correct
31 Correct 204 ms 67436 KB Output is correct
32 Correct 205 ms 61672 KB Output is correct
33 Correct 264 ms 63336 KB Output is correct
34 Correct 553 ms 78220 KB Output is correct
35 Correct 456 ms 71536 KB Output is correct
36 Correct 450 ms 79568 KB Output is correct
37 Correct 502 ms 81408 KB Output is correct
38 Correct 502 ms 87328 KB Output is correct
39 Correct 244 ms 64492 KB Output is correct
40 Correct 571 ms 82028 KB Output is correct
41 Correct 613 ms 82032 KB Output is correct
42 Correct 635 ms 86688 KB Output is correct
43 Correct 313 ms 67980 KB Output is correct
44 Correct 558 ms 71776 KB Output is correct
45 Correct 458 ms 79852 KB Output is correct
46 Correct 390 ms 79468 KB Output is correct
47 Correct 463 ms 81036 KB Output is correct
48 Correct 971 ms 110680 KB Output is correct