oj.uz

Submission #951287

# Submission time Handle Problem Language Result Execution time Memory
951287 2024-03-21T14:41:45 Z Warinchai Evacuation plan (IZhO18_plan) C++14
100 / 100
 629 ms 50776 KB 
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>>edges;
vector<pair<int,int>>adj[100005];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
int vis[100005];
int dis[100005];
vector<pair<int,pair<int,int>>>op;
vector<int>ord;
int st[100005];
int en[100005];
vector<int>calc[100005];
vector<pair<int,int>>qr;
map<int,int>mp;
int p[100005];
int fp(int a){return p[a]==a?a:p[a]=fp(p[a]);}
void un(int a,int b){p[fp(b)]=fp(a);}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
        edges.push_back({a,b});
    }
    int k;cin>>k;
    for(int i=1;i<=n;i++)dis[i]=INT_MAX;
    for(int i=0;i<k;i++){
        int g;cin>>g;
        pq.push({0,g});
    }
    while(!pq.empty()){
        int u=pq.top().second;
        int cost=pq.top().first;
        pq.pop();
        if(vis[u])continue;
        dis[u]=cost;
        vis[u]=1;
        for(auto x:adj[u]){
            pq.push({cost+x.second,x.first});
        }
    }
    //for(int i=1;i<=n;i++)cerr<<dis[i]<<" ";
    //cerr<<"\n";
    for(int i=1;i<=n;i++){
        if(!mp[dis[i]])ord.push_back(dis[i]),mp[dis[i]]++;
    }
    sort(ord.begin(),ord.end());
    for(auto x:edges){
        int a=x.first;
        int b=x.second;
        int cst=min(dis[a],dis[b]);
        int id=lower_bound(ord.begin(),ord.end(),cst)-ord.begin();
        op.push_back({id,{a,b}});
    }
    sort(op.begin(),op.end(),greater<pair<int,pair<int,int>>>());
    /*for(auto x:op){
        cerr<<x.first<<" "<<x.second.first<<" "<<x.second.second<<"\n"; 
    }*/
    int q;cin>>q;
    for(int i=1;i<=q;i++){
        int a,b;cin>>a>>b;
        qr.push_back({a,b});
    }
    for(int i=0;i<q;i++){
        st[i]=0,en[i]=ord.size()-1;
    }
    for(int i=0;i<q;i++){
        int m=(st[i]+en[i]+1)/2;
        calc[m].push_back(i);
    }
    //cerr<<"work\n";
    while(1){
        for(int i=1;i<=n;i++)p[i]=i;
        int cur=0;
        for(int i=ord.size()-1;i>0;i--){
            while(cur<op.size()-1&&op[cur].first==i)/*cerr<<"un:"<<op[cur].second.first<<" "<<op[cur].second.second<<"\n",*/un(op[cur].second.first,op[cur].second.second),cur++;
            for(auto x:calc[i]){
                //cerr<<qr[x].first<<" "<<qr[x].second<<" ";
                if(fp(qr[x].first)==fp(qr[x].second))st[x]=i/*,cerr<<"yes\n"*/;
                else en[x]=i-1/*,cerr<<"no\n"*/;
            }
            calc[i].clear();
        }
        int check=0;
        for(int i=0;i<q;i++){
            //cerr<<i<<":"<<st[i]<<" "<<en[i]<<"\n";
            if(st[i]==en[i])continue;
            check=1;
            int m=(st[i]+en[i]+1)/2;
            calc[m].push_back(i);
        }
        if(!check)break;
    }
    for(int i=0;i<q;i++)cout<<ord[st[i]]<<"\n";
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:79:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |             while(cur<op.size()-1&&op[cur].first==i)/*cerr<<"un:"<<op[cur].second.first<<" "<<op[cur].second.second<<"\n",*/un(op[cur].second.first,op[cur].second.second),cur++;
      |                   ~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 2 ms 7004 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7004 KB Output is correct
10 Correct 2 ms 7004 KB Output is correct
11 Correct 3 ms 7004 KB Output is correct
12 Correct 2 ms 6912 KB Output is correct
13 Correct 3 ms 7004 KB Output is correct
14 Correct 3 ms 7004 KB Output is correct
15 Correct 3 ms 7104 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 2 ms 7004 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7004 KB Output is correct
10 Correct 2 ms 7004 KB Output is correct
11 Correct 3 ms 7004 KB Output is correct
12 Correct 2 ms 6912 KB Output is correct
13 Correct 3 ms 7004 KB Output is correct
14 Correct 3 ms 7004 KB Output is correct
15 Correct 3 ms 7104 KB Output is correct
16 Correct 165 ms 22276 KB Output is correct
17 Correct 604 ms 48680 KB Output is correct
18 Correct 49 ms 10704 KB Output is correct
19 Correct 97 ms 21192 KB Output is correct
20 Correct 594 ms 50180 KB Output is correct
21 Correct 205 ms 27536 KB Output is correct
22 Correct 162 ms 30824 KB Output is correct
23 Correct 624 ms 49416 KB Output is correct
24 Correct 617 ms 49956 KB Output is correct
25 Correct 569 ms 48956 KB Output is correct
26 Correct 96 ms 21168 KB Output is correct
27 Correct 96 ms 21164 KB Output is correct
28 Correct 98 ms 21168 KB Output is correct
29 Correct 95 ms 21168 KB Output is correct
30 Correct 97 ms 21164 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 7072 KB Output is correct
7 Correct 2 ms 7000 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 22576 KB Output is correct
2 Correct 555 ms 48196 KB Output is correct
3 Correct 548 ms 46820 KB Output is correct
4 Correct 104 ms 19648 KB Output is correct
5 Correct 562 ms 46636 KB Output is correct
6 Correct 544 ms 46640 KB Output is correct
7 Correct 580 ms 47244 KB Output is correct
8 Correct 580 ms 47676 KB Output is correct
9 Correct 561 ms 46632 KB Output is correct
10 Correct 573 ms 46816 KB Output is correct
11 Correct 594 ms 48428 KB Output is correct
12 Correct 572 ms 47048 KB Output is correct
13 Correct 549 ms 48172 KB Output is correct
14 Correct 554 ms 47564 KB Output is correct
15 Correct 542 ms 48672 KB Output is correct
16 Correct 570 ms 48624 KB Output is correct
17 Correct 577 ms 47668 KB Output is correct
18 Correct 571 ms 48428 KB Output is correct
19 Correct 97 ms 19140 KB Output is correct
20 Correct 580 ms 47444 KB Output is correct
21 Correct 408 ms 48684 KB Output is correct
22 Correct 76 ms 15800 KB Output is correct
23 Correct 110 ms 17856 KB Output is correct
24 Correct 77 ms 15636 KB Output is correct
25 Correct 71 ms 15792 KB Output is correct
26 Correct 97 ms 16064 KB Output is correct
27 Correct 111 ms 19476 KB Output is correct
28 Correct 71 ms 15792 KB Output is correct
29 Correct 108 ms 19652 KB Output is correct
30 Correct 86 ms 15780 KB Output is correct
31 Correct 109 ms 19544 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 2 ms 7004 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7004 KB Output is correct
10 Correct 2 ms 7004 KB Output is correct
11 Correct 3 ms 7004 KB Output is correct
12 Correct 2 ms 6912 KB Output is correct
13 Correct 3 ms 7004 KB Output is correct
14 Correct 3 ms 7004 KB Output is correct
15 Correct 3 ms 7104 KB Output is correct
16 Correct 165 ms 22276 KB Output is correct
17 Correct 604 ms 48680 KB Output is correct
18 Correct 49 ms 10704 KB Output is correct
19 Correct 97 ms 21192 KB Output is correct
20 Correct 594 ms 50180 KB Output is correct
21 Correct 205 ms 27536 KB Output is correct
22 Correct 162 ms 30824 KB Output is correct
23 Correct 624 ms 49416 KB Output is correct
24 Correct 617 ms 49956 KB Output is correct
25 Correct 569 ms 48956 KB Output is correct
26 Correct 96 ms 21168 KB Output is correct
27 Correct 96 ms 21164 KB Output is correct
28 Correct 98 ms 21168 KB Output is correct
29 Correct 95 ms 21168 KB Output is correct
30 Correct 97 ms 21164 KB Output is correct
31 Correct 1 ms 6744 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 2 ms 7072 KB Output is correct
37 Correct 2 ms 7000 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 2 ms 6748 KB Output is correct
41 Correct 248 ms 22576 KB Output is correct
42 Correct 555 ms 48196 KB Output is correct
43 Correct 548 ms 46820 KB Output is correct
44 Correct 104 ms 19648 KB Output is correct
45 Correct 562 ms 46636 KB Output is correct
46 Correct 544 ms 46640 KB Output is correct
47 Correct 580 ms 47244 KB Output is correct
48 Correct 580 ms 47676 KB Output is correct
49 Correct 561 ms 46632 KB Output is correct
50 Correct 573 ms 46816 KB Output is correct
51 Correct 594 ms 48428 KB Output is correct
52 Correct 572 ms 47048 KB Output is correct
53 Correct 549 ms 48172 KB Output is correct
54 Correct 554 ms 47564 KB Output is correct
55 Correct 542 ms 48672 KB Output is correct
56 Correct 570 ms 48624 KB Output is correct
57 Correct 577 ms 47668 KB Output is correct
58 Correct 571 ms 48428 KB Output is correct
59 Correct 97 ms 19140 KB Output is correct
60 Correct 580 ms 47444 KB Output is correct
61 Correct 408 ms 48684 KB Output is correct
62 Correct 76 ms 15800 KB Output is correct
63 Correct 110 ms 17856 KB Output is correct
64 Correct 77 ms 15636 KB Output is correct
65 Correct 71 ms 15792 KB Output is correct
66 Correct 97 ms 16064 KB Output is correct
67 Correct 111 ms 19476 KB Output is correct
68 Correct 71 ms 15792 KB Output is correct
69 Correct 108 ms 19652 KB Output is correct
70 Correct 86 ms 15780 KB Output is correct
71 Correct 109 ms 19544 KB Output is correct
72 Correct 293 ms 28404 KB Output is correct
73 Correct 624 ms 49352 KB Output is correct
74 Correct 618 ms 49516 KB Output is correct
75 Correct 615 ms 49760 KB Output is correct
76 Correct 607 ms 50220 KB Output is correct
77 Correct 612 ms 49892 KB Output is correct
78 Correct 625 ms 49536 KB Output is correct
79 Correct 601 ms 48940 KB Output is correct
80 Correct 605 ms 50596 KB Output is correct
81 Correct 616 ms 49956 KB Output is correct
82 Correct 605 ms 50480 KB Output is correct
83 Correct 614 ms 49132 KB Output is correct
84 Correct 609 ms 49628 KB Output is correct
85 Correct 556 ms 49456 KB Output is correct
86 Correct 611 ms 48728 KB Output is correct
87 Correct 607 ms 50000 KB Output is correct
88 Correct 623 ms 50776 KB Output is correct
89 Correct 166 ms 30908 KB Output is correct
90 Correct 629 ms 49344 KB Output is correct
91 Correct 447 ms 49328 KB Output is correct
92 Correct 95 ms 21260 KB Output is correct
93 Correct 179 ms 27212 KB Output is correct
94 Correct 105 ms 21180 KB Output is correct
95 Correct 97 ms 21264 KB Output is correct
96 Correct 143 ms 23524 KB Output is correct
97 Correct 185 ms 29804 KB Output is correct
98 Correct 108 ms 21228 KB Output is correct
99 Correct 174 ms 29632 KB Output is correct
100 Correct 96 ms 21248 KB Output is correct