oj.uz

Submission #972140

# Submission time Handle Problem Language Result Execution time Memory
972140 2024-04-30T07:18:54 Z boyliguanhan Robot (JOI21_ho_t4) C++17
100 / 100
 1424 ms 141160 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define djik(a,b,w) if(dis[a][b]>w)pq.push({dis[a][b]=w,a,b})
#define M 7<<14
vector<int> N[M],E[M],P[M],C[M],dis[M];
map<int,int>mp[M];
map<int,set<pair<int,int>>>mp2[M];
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        N[i].PB(0),E[i].PB(0),C[i].PB(0),P[i].PB(0),dis[i].PB(1e18);
    dis[1][0]=0;
    while(m--){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        mp[a][c]+=d;
        mp[b][c]+=d;
        dis[a].PB(1e18);
        dis[b].PB(1e18);
        E[a].PB(size(P[b]));
        E[b].PB(size(P[a]));
        P[a].PB(d),P[b].PB(d);
        N[a].PB(b),N[b].PB(a);
        mp2[b][c].insert({d,size(C[b])});
        mp2[a][c].insert({d,size(C[a])});
        C[a].PB(c),C[b].PB(c);
    }
    priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<>>pq;
    pq.push({0,1,0});
    while(pq.size()){
        auto[w,x,e]=pq.top();
        pq.pop();
        if(dis[x][e]<w)
            continue;
        djik(x,0,w);
        if(e){
            if(mp[x][C[x][e]]==P[x][e])
                continue;
            int y=(--mp2[x][C[x][e]].end())->second;
            if(y==e)
                y=prev(--mp2[x][C[x][e]].end())->second;
            djik(N[x][y],0,w+mp[x][C[x][e]]-P[x][e]-P[x][y]);
        } else {
            for(int i=1;i<P[x].size();i++) {
                djik(N[x][i],E[x][i],w+P[x][i]);
                djik(N[x][i],0,w+mp[x][C[x][i]]-P[x][i]);
            }
        }
    }
    cout<<(dis[n][0]<1e18?dis[n][0]:-1);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:48:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             for(int i=1;i<P[x].size();i++) {
      |                         ~^~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 24664 KB Output is correct
2 Correct 6 ms 24668 KB Output is correct
3 Correct 7 ms 24704 KB Output is correct
4 Correct 6 ms 24668 KB Output is correct
5 Correct 6 ms 24736 KB Output is correct
6 Correct 6 ms 24700 KB Output is correct
7 Correct 8 ms 25000 KB Output is correct
8 Correct 6 ms 24668 KB Output is correct
9 Correct 10 ms 25872 KB Output is correct
10 Correct 10 ms 25764 KB Output is correct
11 Correct 10 ms 25728 KB Output is correct
12 Correct 9 ms 25500 KB Output is correct
13 Correct 9 ms 25620 KB Output is correct
14 Correct 8 ms 25432 KB Output is correct
15 Correct 8 ms 25180 KB Output is correct
16 Correct 8 ms 25436 KB Output is correct
17 Correct 8 ms 25436 KB Output is correct
18 Correct 7 ms 24976 KB Output is correct
19 Correct 8 ms 25436 KB Output is correct
20 Correct 8 ms 25180 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 62404 KB Output is correct
2 Correct 96 ms 42956 KB Output is correct
3 Correct 419 ms 75972 KB Output is correct
4 Correct 208 ms 52248 KB Output is correct
5 Correct 1424 ms 140680 KB Output is correct
6 Correct 1214 ms 132668 KB Output is correct
7 Correct 669 ms 115796 KB Output is correct
8 Correct 678 ms 105552 KB Output is correct
9 Correct 754 ms 105456 KB Output is correct
10 Correct 504 ms 88952 KB Output is correct
11 Correct 289 ms 71508 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 24664 KB Output is correct
2 Correct 6 ms 24668 KB Output is correct
3 Correct 7 ms 24704 KB Output is correct
4 Correct 6 ms 24668 KB Output is correct
5 Correct 6 ms 24736 KB Output is correct
6 Correct 6 ms 24700 KB Output is correct
7 Correct 8 ms 25000 KB Output is correct
8 Correct 6 ms 24668 KB Output is correct
9 Correct 10 ms 25872 KB Output is correct
10 Correct 10 ms 25764 KB Output is correct
11 Correct 10 ms 25728 KB Output is correct
12 Correct 9 ms 25500 KB Output is correct
13 Correct 9 ms 25620 KB Output is correct
14 Correct 8 ms 25432 KB Output is correct
15 Correct 8 ms 25180 KB Output is correct
16 Correct 8 ms 25436 KB Output is correct
17 Correct 8 ms 25436 KB Output is correct
18 Correct 7 ms 24976 KB Output is correct
19 Correct 8 ms 25436 KB Output is correct
20 Correct 8 ms 25180 KB Output is correct
21 Correct 264 ms 62404 KB Output is correct
22 Correct 96 ms 42956 KB Output is correct
23 Correct 419 ms 75972 KB Output is correct
24 Correct 208 ms 52248 KB Output is correct
25 Correct 1424 ms 140680 KB Output is correct
26 Correct 1214 ms 132668 KB Output is correct
27 Correct 669 ms 115796 KB Output is correct
28 Correct 678 ms 105552 KB Output is correct
29 Correct 754 ms 105456 KB Output is correct
30 Correct 504 ms 88952 KB Output is correct
31 Correct 289 ms 71508 KB Output is correct
32 Correct 433 ms 76648 KB Output is correct
33 Correct 408 ms 67992 KB Output is correct
34 Correct 685 ms 92656 KB Output is correct
35 Correct 548 ms 81032 KB Output is correct
36 Correct 607 ms 92892 KB Output is correct
37 Correct 738 ms 103420 KB Output is correct
38 Correct 712 ms 117584 KB Output is correct
39 Correct 456 ms 80104 KB Output is correct
40 Correct 704 ms 106580 KB Output is correct
41 Correct 763 ms 106800 KB Output is correct
42 Correct 899 ms 114464 KB Output is correct
43 Correct 333 ms 68808 KB Output is correct
44 Correct 786 ms 95632 KB Output is correct
45 Correct 606 ms 91708 KB Output is correct
46 Correct 474 ms 85844 KB Output is correct
47 Correct 668 ms 106340 KB Output is correct
48 Correct 1412 ms 141160 KB Output is correct