oj.uz

Submission #493802

# Submission time Handle Problem Language Result Execution time Memory
493802 2021-12-13T03:04:17 Z i_am_noob Robot (JOI21_ho_t4) C++17
100 / 100
 487 ms 51468 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define int ll
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<(b); ++i)
#define rep3(i,a,b) for(int i=a; i>=(b); --i)
#define pii pair<int,int>
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define inf 1000'000'000'000'000'000
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ": " << #__VA_ARGS__ << "- ",_do(__VA_ARGS__)
template<typename T> void _do(T x){cerr << x << endl;}
template<typename T, typename ... S> void _do(T x, S ...y){cerr << x << ", ";_do(y...);}
#else
#define bug(...) 49
#endif

const int maxn=100005;

int n,m,dis[maxn];
vector<array<int,3>> adj[maxn];
vector<pii> adj2[maxn];
bool vis[maxn];

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m;
    rep(m){
        int u,v,a,b;
        cin >> u >> v >> a >> b;
        u--,v--;
        adj[u].pb({v,a,b}),adj[v].pb({u,a,b});
    }
    rep(n){
        map<int,vector<pii>> mm;
        map<int,int> mm2;
        for(auto& arr: adj[i]) mm[arr[1]].pb({arr[2],arr[0]}),mm2[arr[1]]+=arr[2];
        for(auto& [c,vec]: mm){
            sort(all(vec));
            reverse(all(vec));
            if(sz(vec)==1){
                adj2[i].pb({vec[0].second,0});
                continue;
            }
            for(auto p: vec) adj2[i].pb({p.second,min(p.first,mm2[c]-p.first)});
            pii p1=vec[0];
            for(auto p: vec) if(p!=p1) adj2[p.second].pb({p1.second,mm2[c]-p1.first});
            pii p2=vec[1];
            for(auto p: vec) if(p!=p2) adj2[p.second].pb({p2.second,mm2[c]-p2.first});
        }
    }
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    rep2(i,1,n) dis[i]=inf;
    pq.push({0,0});
    while(!pq.empty()){
        auto [d,u]=pq.top();
        pq.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(auto [v,w]: adj2[u]){
            if(d+w<dis[v]){
                dis[v]=d+w;
                pq.push({dis[v],v});
            }
        }
    }
    cout << (dis[n-1]==inf?-1:dis[n-1]) << endl;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4992 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 5 ms 5324 KB Output is correct
10 Correct 4 ms 5452 KB Output is correct
11 Correct 4 ms 5324 KB Output is correct
12 Correct 4 ms 5360 KB Output is correct
13 Correct 4 ms 5324 KB Output is correct
14 Correct 4 ms 5416 KB Output is correct
15 Correct 4 ms 5196 KB Output is correct
16 Correct 4 ms 5452 KB Output is correct
17 Correct 4 ms 5324 KB Output is correct
18 Correct 4 ms 5028 KB Output is correct
19 Correct 5 ms 5452 KB Output is correct
20 Correct 4 ms 5196 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 19856 KB Output is correct
2 Correct 38 ms 11240 KB Output is correct
3 Correct 115 ms 33940 KB Output is correct
4 Correct 57 ms 15020 KB Output is correct
5 Correct 371 ms 43692 KB Output is correct
6 Correct 303 ms 38252 KB Output is correct
7 Correct 179 ms 41240 KB Output is correct
8 Correct 275 ms 44500 KB Output is correct
9 Correct 299 ms 44608 KB Output is correct
10 Correct 136 ms 25816 KB Output is correct
11 Correct 113 ms 22452 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4992 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 5 ms 5324 KB Output is correct
10 Correct 4 ms 5452 KB Output is correct
11 Correct 4 ms 5324 KB Output is correct
12 Correct 4 ms 5360 KB Output is correct
13 Correct 4 ms 5324 KB Output is correct
14 Correct 4 ms 5416 KB Output is correct
15 Correct 4 ms 5196 KB Output is correct
16 Correct 4 ms 5452 KB Output is correct
17 Correct 4 ms 5324 KB Output is correct
18 Correct 4 ms 5028 KB Output is correct
19 Correct 5 ms 5452 KB Output is correct
20 Correct 4 ms 5196 KB Output is correct
21 Correct 85 ms 19856 KB Output is correct
22 Correct 38 ms 11240 KB Output is correct
23 Correct 115 ms 33940 KB Output is correct
24 Correct 57 ms 15020 KB Output is correct
25 Correct 371 ms 43692 KB Output is correct
26 Correct 303 ms 38252 KB Output is correct
27 Correct 179 ms 41240 KB Output is correct
28 Correct 275 ms 44500 KB Output is correct
29 Correct 299 ms 44608 KB Output is correct
30 Correct 136 ms 25816 KB Output is correct
31 Correct 113 ms 22452 KB Output is correct
32 Correct 104 ms 40388 KB Output is correct
33 Correct 113 ms 33732 KB Output is correct
34 Correct 186 ms 36220 KB Output is correct
35 Correct 162 ms 30760 KB Output is correct
36 Correct 230 ms 31728 KB Output is correct
37 Correct 216 ms 42148 KB Output is correct
38 Correct 200 ms 44788 KB Output is correct
39 Correct 152 ms 49084 KB Output is correct
40 Correct 317 ms 50632 KB Output is correct
41 Correct 342 ms 50696 KB Output is correct
42 Correct 307 ms 43348 KB Output is correct
43 Correct 112 ms 25444 KB Output is correct
44 Correct 198 ms 51468 KB Output is correct
45 Correct 246 ms 37380 KB Output is correct
46 Correct 236 ms 33956 KB Output is correct
47 Correct 234 ms 39812 KB Output is correct
48 Correct 487 ms 49832 KB Output is correct