oj.uz

Submission #939691

# Submission time Handle Problem Language Result Execution time Memory
939691 2024-03-06T16:40:07 Z Pacybwoah Robot (JOI21_ho_t4) C++17
100 / 100
 751 ms 91412 KB 
#include<iostream>
#include<algorithm>
#include<queue>
#include<utility>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
struct edge{
    int a,b,c;
    ll p;
    edge(int _a,int _b,int _c,ll _p){
        a=_a,b=_b,c=_c,p=_p;
    }
};
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    cin>>n>>m;
    int a,b,c;
    ll p;
    vector<edge> edges;
    vector<map<int,ll> > sum(n+1),rep(n+1);
    for(int i=0;i<m;i++){
        cin>>a>>b>>c>>p;
        edges.emplace_back(a,b,c,p);
        sum[a][c]+=p;
        sum[b][c]+=p;
    }
    int cnt=1;
    for(int i=1;i<=n;i++) for(auto x:sum[i]) rep[i][x.first]=cnt++;
    vector<vector<pair<int,ll> > > graph(cnt+n+1);
    for(auto &[d,e,f,q]:edges){
        graph[cnt+d].push_back(make_pair(cnt+e,min(q,sum[d][f]-q)));
        graph[cnt+e].push_back(make_pair(cnt+d,min(q,sum[e][f]-q)));
        graph[cnt+d].push_back(make_pair(rep[e][f],0));
        graph[cnt+e].push_back(make_pair(rep[d][f],0));
        graph[rep[d][f]].push_back(make_pair(cnt+e,sum[d][f]-q));
        graph[rep[e][f]].push_back(make_pair(cnt+d,sum[e][f]-q));
    }
    vector<ll> dist(cnt+n+1,1e18);
    priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> > > pq;
    dist[cnt+1]=0;
    pq.push(make_pair(0,cnt+1));
    while(!pq.empty()){
        auto [d,node]=pq.top();
        pq.pop();
        if(dist[node]!=d) continue;
        for(auto &[x,l]:graph[node]){
            if(d+l<dist[x]){
                dist[x]=d+l;
                pq.push(make_pair(d+l,x));
            }
        }
    }
    if(dist[cnt+n]==1e18) cout<<"-1\n";
    else cout<<dist[cnt+n]<<"\n";
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 1 ms 984 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 29448 KB Output is correct
2 Correct 42 ms 14608 KB Output is correct
3 Correct 124 ms 37364 KB Output is correct
4 Correct 84 ms 20788 KB Output is correct
5 Correct 751 ms 90756 KB Output is correct
6 Correct 563 ms 84984 KB Output is correct
7 Correct 277 ms 69220 KB Output is correct
8 Correct 352 ms 67072 KB Output is correct
9 Correct 373 ms 66408 KB Output is correct
10 Correct 233 ms 50056 KB Output is correct
11 Correct 129 ms 40192 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 1 ms 984 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 115 ms 29448 KB Output is correct
22 Correct 42 ms 14608 KB Output is correct
23 Correct 124 ms 37364 KB Output is correct
24 Correct 84 ms 20788 KB Output is correct
25 Correct 751 ms 90756 KB Output is correct
26 Correct 563 ms 84984 KB Output is correct
27 Correct 277 ms 69220 KB Output is correct
28 Correct 352 ms 67072 KB Output is correct
29 Correct 373 ms 66408 KB Output is correct
30 Correct 233 ms 50056 KB Output is correct
31 Correct 129 ms 40192 KB Output is correct
32 Correct 94 ms 32504 KB Output is correct
33 Correct 110 ms 31756 KB Output is correct
34 Correct 262 ms 53492 KB Output is correct
35 Correct 205 ms 43264 KB Output is correct
36 Correct 225 ms 52476 KB Output is correct
37 Correct 250 ms 65204 KB Output is correct
38 Correct 315 ms 76856 KB Output is correct
39 Correct 107 ms 42484 KB Output is correct
40 Correct 363 ms 67912 KB Output is correct
41 Correct 386 ms 68124 KB Output is correct
42 Correct 395 ms 75104 KB Output is correct
43 Correct 136 ms 35328 KB Output is correct
44 Correct 230 ms 54140 KB Output is correct
45 Correct 289 ms 57332 KB Output is correct
46 Correct 247 ms 56828 KB Output is correct
47 Correct 250 ms 59472 KB Output is correct
48 Correct 744 ms 91412 KB Output is correct