oj.uz

Submission #951285

# Submission time Handle Problem Language Result Execution time Memory
951285 2024-03-21T14:39:11 Z Warinchai Evacuation plan (IZhO18_plan) C++14
100 / 100
 560 ms 48144 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});
        dis[g]=0;
    }
    while(!pq.empty()){
        int u=pq.top().second;
        int cost=pq.top().first;
        pq.pop();
        if(vis[u])continue;
        vis[u]=1;
        for(auto x:adj[u]){
            if(cost+x.second<dis[x.first])pq.push({cost+x.second,x.first}),dis[x.first]=cost+x.second;
        }
    }
    //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 5 ms 7004 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 7256 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 6960 KB Output is correct
10 Correct 2 ms 7004 KB Output is correct
11 Correct 3 ms 7004 KB Output is correct
12 Correct 3 ms 7004 KB Output is correct
13 Correct 3 ms 7000 KB Output is correct
14 Correct 3 ms 6964 KB Output is correct
15 Correct 3 ms 7096 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 5 ms 7004 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 7256 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 6960 KB Output is correct
10 Correct 2 ms 7004 KB Output is correct
11 Correct 3 ms 7004 KB Output is correct
12 Correct 3 ms 7004 KB Output is correct
13 Correct 3 ms 7000 KB Output is correct
14 Correct 3 ms 6964 KB Output is correct
15 Correct 3 ms 7096 KB Output is correct
16 Correct 159 ms 23720 KB Output is correct
17 Correct 482 ms 48112 KB Output is correct
18 Correct 41 ms 10564 KB Output is correct
19 Correct 83 ms 22284 KB Output is correct
20 Correct 491 ms 48044 KB Output is correct
21 Correct 161 ms 28812 KB Output is correct
22 Correct 172 ms 31776 KB Output is correct
23 Correct 478 ms 48144 KB Output is correct
24 Correct 496 ms 48072 KB Output is correct
25 Correct 423 ms 47292 KB Output is correct
26 Correct 84 ms 22228 KB Output is correct
27 Correct 86 ms 22440 KB Output is correct
28 Correct 82 ms 22192 KB Output is correct
29 Correct 83 ms 22320 KB Output is correct
30 Correct 82 ms 22444 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6948 KB Output is correct
5 Correct 2 ms 6952 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 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 200 ms 24368 KB Output is correct
2 Correct 418 ms 44464 KB Output is correct
3 Correct 425 ms 44304 KB Output is correct
4 Correct 104 ms 20156 KB Output is correct
5 Correct 440 ms 44300 KB Output is correct
6 Correct 466 ms 44560 KB Output is correct
7 Correct 491 ms 43192 KB Output is correct
8 Correct 426 ms 43704 KB Output is correct
9 Correct 446 ms 43960 KB Output is correct
10 Correct 446 ms 44172 KB Output is correct
11 Correct 446 ms 43576 KB Output is correct
12 Correct 439 ms 45240 KB Output is correct
13 Correct 459 ms 44304 KB Output is correct
14 Correct 424 ms 43704 KB Output is correct
15 Correct 396 ms 43960 KB Output is correct
16 Correct 463 ms 44528 KB Output is correct
17 Correct 484 ms 44724 KB Output is correct
18 Correct 436 ms 45084 KB Output is correct
19 Correct 95 ms 19904 KB Output is correct
20 Correct 440 ms 44348 KB Output is correct
21 Correct 255 ms 44024 KB Output is correct
22 Correct 58 ms 16312 KB Output is correct
23 Correct 97 ms 18372 KB Output is correct
24 Correct 58 ms 16312 KB Output is correct
25 Correct 58 ms 16320 KB Output is correct
26 Correct 92 ms 16576 KB Output is correct
27 Correct 116 ms 20176 KB Output is correct
28 Correct 57 ms 16312 KB Output is correct
29 Correct 105 ms 20268 KB Output is correct
30 Correct 58 ms 16252 KB Output is correct
31 Correct 113 ms 20572 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 5 ms 7004 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 7256 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 6960 KB Output is correct
10 Correct 2 ms 7004 KB Output is correct
11 Correct 3 ms 7004 KB Output is correct
12 Correct 3 ms 7004 KB Output is correct
13 Correct 3 ms 7000 KB Output is correct
14 Correct 3 ms 6964 KB Output is correct
15 Correct 3 ms 7096 KB Output is correct
16 Correct 159 ms 23720 KB Output is correct
17 Correct 482 ms 48112 KB Output is correct
18 Correct 41 ms 10564 KB Output is correct
19 Correct 83 ms 22284 KB Output is correct
20 Correct 491 ms 48044 KB Output is correct
21 Correct 161 ms 28812 KB Output is correct
22 Correct 172 ms 31776 KB Output is correct
23 Correct 478 ms 48144 KB Output is correct
24 Correct 496 ms 48072 KB Output is correct
25 Correct 423 ms 47292 KB Output is correct
26 Correct 84 ms 22228 KB Output is correct
27 Correct 86 ms 22440 KB Output is correct
28 Correct 82 ms 22192 KB Output is correct
29 Correct 83 ms 22320 KB Output is correct
30 Correct 82 ms 22444 KB Output is correct
31 Correct 2 ms 6744 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 2 ms 6948 KB Output is correct
35 Correct 2 ms 6952 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 2 ms 6748 KB Output is correct
40 Correct 2 ms 6748 KB Output is correct
41 Correct 200 ms 24368 KB Output is correct
42 Correct 418 ms 44464 KB Output is correct
43 Correct 425 ms 44304 KB Output is correct
44 Correct 104 ms 20156 KB Output is correct
45 Correct 440 ms 44300 KB Output is correct
46 Correct 466 ms 44560 KB Output is correct
47 Correct 491 ms 43192 KB Output is correct
48 Correct 426 ms 43704 KB Output is correct
49 Correct 446 ms 43960 KB Output is correct
50 Correct 446 ms 44172 KB Output is correct
51 Correct 446 ms 43576 KB Output is correct
52 Correct 439 ms 45240 KB Output is correct
53 Correct 459 ms 44304 KB Output is correct
54 Correct 424 ms 43704 KB Output is correct
55 Correct 396 ms 43960 KB Output is correct
56 Correct 463 ms 44528 KB Output is correct
57 Correct 484 ms 44724 KB Output is correct
58 Correct 436 ms 45084 KB Output is correct
59 Correct 95 ms 19904 KB Output is correct
60 Correct 440 ms 44348 KB Output is correct
61 Correct 255 ms 44024 KB Output is correct
62 Correct 58 ms 16312 KB Output is correct
63 Correct 97 ms 18372 KB Output is correct
64 Correct 58 ms 16312 KB Output is correct
65 Correct 58 ms 16320 KB Output is correct
66 Correct 92 ms 16576 KB Output is correct
67 Correct 116 ms 20176 KB Output is correct
68 Correct 57 ms 16312 KB Output is correct
69 Correct 105 ms 20268 KB Output is correct
70 Correct 58 ms 16252 KB Output is correct
71 Correct 113 ms 20572 KB Output is correct
72 Correct 277 ms 29720 KB Output is correct
73 Correct 545 ms 47416 KB Output is correct
74 Correct 482 ms 47536 KB Output is correct
75 Correct 510 ms 47500 KB Output is correct
76 Correct 498 ms 47600 KB Output is correct
77 Correct 494 ms 47596 KB Output is correct
78 Correct 498 ms 47424 KB Output is correct
79 Correct 544 ms 47528 KB Output is correct
80 Correct 489 ms 47572 KB Output is correct
81 Correct 521 ms 47744 KB Output is correct
82 Correct 514 ms 47904 KB Output is correct
83 Correct 501 ms 47244 KB Output is correct
84 Correct 502 ms 47452 KB Output is correct
85 Correct 448 ms 47260 KB Output is correct
86 Correct 472 ms 47248 KB Output is correct
87 Correct 560 ms 47528 KB Output is correct
88 Correct 508 ms 47716 KB Output is correct
89 Correct 168 ms 32192 KB Output is correct
90 Correct 482 ms 47656 KB Output is correct
91 Correct 291 ms 46504 KB Output is correct
92 Correct 95 ms 22188 KB Output is correct
93 Correct 171 ms 28348 KB Output is correct
94 Correct 82 ms 22068 KB Output is correct
95 Correct 90 ms 22280 KB Output is correct
96 Correct 144 ms 24712 KB Output is correct
97 Correct 181 ms 30904 KB Output is correct
98 Correct 83 ms 22272 KB Output is correct
99 Correct 179 ms 30912 KB Output is correct
100 Correct 83 ms 22200 KB Output is correct