oj.uz

Submission #334351

# Submission time Handle Problem Language Result Execution time Memory
334351 2020-12-09T03:58:00 Z juggernaut Evacuation plan (IZhO18_plan) C++14
100 / 100
 647 ms 51856 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,dis[100005],par[100005],sz[100005],up[100005][17],mn[100005][17],tin[100005],tout[100005],timer;
struct data{
    int x,y,z;
};
int fin(int v){
    return v==par[v]?v:par[v]=fin(par[v]);
}
vector<pair<int,int>>g[100005];
void dfs(int v,int p,int val){
    tin[v]=++timer;
    up[v][0]=p;
    mn[v][0]=val;
    for(int i=1;i<17;i++){
        up[v][i]=up[up[v][i-1]][i-1];
        mn[v][i]=min(mn[v][i-1],mn[up[v][i-1]][i-1]);
    }
    for(auto to:g[v])if(to.first!=p)dfs(to.first,v,to.second);
    tout[v]=++timer;
}
bool upper(int a,int b){
	return tin[a]<=tin[b]&&tout[a]>=tout[b];
}
vector<data>edge,vec;
bool cmp(data l,data r){
    return l.z>r.z;
}
int go(int v,int l){
    int res=2e9;
    if(upper(v,l))return res;
    for(int i=16;i>=0;i--){
        if(!upper(up[v][i],l)){
            res=min(res,mn[v][i]);
            v=up[v][i];
        }
    }
    res=min(res,mn[v][0]);
    return res;
}
int main(){
    scanf("%d%d",&n,&m);
    while(m--){
        data e;
        scanf("%d%d%d",&e.x,&e.y,&e.z);
        edge.push_back(e);
        g[e.x].push_back({e.y,e.z});
        g[e.y].push_back({e.x,e.z});
    }
    for(int i=1;i<=n;i++)dis[i]=2e9;
    scanf("%d",&m);
    priority_queue<pair<int,int>>q;
    while(m--){
        int x;
        scanf("%d",&x);
        dis[x]=0;
        q.push({0,x});
    }
    while(!q.empty()){
        int v=q.top().second;
        int val=-q.top().first;
        q.pop();
        if(val>dis[v])continue;
        for(auto to:g[v]){
            if(dis[to.first]>val+to.second){
                dis[to.first]=val+to.second;
                q.push({-dis[to.first],to.first});
            }
        }
    }
    for(int i=1;i<=n;i++){
        sz[i]=1,par[i]=i;
        g[i].clear();
    }
    for(auto to:edge){
        data e;
        e=to;
        e.z=min(dis[to.x],dis[to.y]);
        vec.push_back(e);
    }
    sort(vec.begin(),vec.end(),cmp);
    for(auto to:vec){
        int x=fin(to.x);
        int y=fin(to.y);
        if(x!=y){
            if(sz[x]<sz[y])swap(x,y);
            sz[x]+=sz[y];
            par[y]=x;
            g[to.x].push_back({to.y,to.z});
            g[to.y].push_back({to.x,to.z});
            //cout<<to.x<<" "<<to.y<<" "<<to.z<<endl;
        }
    }
    dfs(1,1,2e9);
    scanf("%d",&m);
    while(m--){
        int x,y;
        scanf("%d%d",&x,&y);
        printf("%d\n",min(go(x,y),go(y,x)));
    }
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   43 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
plan.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |         scanf("%d%d%d",&e.x,&e.y,&e.z);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   52 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
plan.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |         scanf("%d",&x);
      |         ~~~~~^~~~~~~~~
plan.cpp:96:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   96 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
plan.cpp:99:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   99 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2924 KB Output is correct
3 Correct 3 ms 2924 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 2 ms 2796 KB Output is correct
8 Correct 2 ms 2796 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 3 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2924 KB Output is correct
3 Correct 3 ms 2924 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 2 ms 2796 KB Output is correct
8 Correct 2 ms 2796 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 3 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct
16 Correct 207 ms 22920 KB Output is correct
17 Correct 613 ms 51640 KB Output is correct
18 Correct 38 ms 7172 KB Output is correct
19 Correct 188 ms 25620 KB Output is correct
20 Correct 605 ms 51728 KB Output is correct
21 Correct 328 ms 33460 KB Output is correct
22 Correct 218 ms 29092 KB Output is correct
23 Correct 606 ms 51600 KB Output is correct
24 Correct 608 ms 51600 KB Output is correct
25 Correct 629 ms 51472 KB Output is correct
26 Correct 186 ms 25236 KB Output is correct
27 Correct 190 ms 25668 KB Output is correct
28 Correct 186 ms 25364 KB Output is correct
29 Correct 186 ms 25364 KB Output is correct
30 Correct 187 ms 25492 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 32924 KB Output is correct
2 Correct 531 ms 51092 KB Output is correct
3 Correct 551 ms 51156 KB Output is correct
4 Correct 149 ms 26404 KB Output is correct
5 Correct 526 ms 51472 KB Output is correct
6 Correct 530 ms 51088 KB Output is correct
7 Correct 541 ms 51280 KB Output is correct
8 Correct 526 ms 51216 KB Output is correct
9 Correct 544 ms 51092 KB Output is correct
10 Correct 528 ms 51236 KB Output is correct
11 Correct 532 ms 51216 KB Output is correct
12 Correct 543 ms 51232 KB Output is correct
13 Correct 530 ms 51108 KB Output is correct
14 Correct 521 ms 51348 KB Output is correct
15 Correct 522 ms 51472 KB Output is correct
16 Correct 519 ms 51088 KB Output is correct
17 Correct 529 ms 51392 KB Output is correct
18 Correct 538 ms 51088 KB Output is correct
19 Correct 147 ms 28068 KB Output is correct
20 Correct 524 ms 51088 KB Output is correct
21 Correct 499 ms 50816 KB Output is correct
22 Correct 126 ms 25108 KB Output is correct
23 Correct 138 ms 24488 KB Output is correct
24 Correct 128 ms 25108 KB Output is correct
25 Correct 124 ms 25108 KB Output is correct
26 Correct 146 ms 24828 KB Output is correct
27 Correct 150 ms 27896 KB Output is correct
28 Correct 129 ms 25108 KB Output is correct
29 Correct 149 ms 27044 KB Output is correct
30 Correct 126 ms 25236 KB Output is correct
31 Correct 160 ms 27172 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2924 KB Output is correct
3 Correct 3 ms 2924 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2924 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 2 ms 2796 KB Output is correct
8 Correct 2 ms 2796 KB Output is correct
9 Correct 3 ms 2924 KB Output is correct
10 Correct 3 ms 2924 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 3 ms 2924 KB Output is correct
13 Correct 3 ms 2924 KB Output is correct
14 Correct 3 ms 2924 KB Output is correct
15 Correct 3 ms 2924 KB Output is correct
16 Correct 207 ms 22920 KB Output is correct
17 Correct 613 ms 51640 KB Output is correct
18 Correct 38 ms 7172 KB Output is correct
19 Correct 188 ms 25620 KB Output is correct
20 Correct 605 ms 51728 KB Output is correct
21 Correct 328 ms 33460 KB Output is correct
22 Correct 218 ms 29092 KB Output is correct
23 Correct 606 ms 51600 KB Output is correct
24 Correct 608 ms 51600 KB Output is correct
25 Correct 629 ms 51472 KB Output is correct
26 Correct 186 ms 25236 KB Output is correct
27 Correct 190 ms 25668 KB Output is correct
28 Correct 186 ms 25364 KB Output is correct
29 Correct 186 ms 25364 KB Output is correct
30 Correct 187 ms 25492 KB Output is correct
31 Correct 2 ms 2668 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 3 ms 2668 KB Output is correct
34 Correct 2 ms 2668 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct
36 Correct 2 ms 2668 KB Output is correct
37 Correct 2 ms 2668 KB Output is correct
38 Correct 2 ms 2668 KB Output is correct
39 Correct 2 ms 2668 KB Output is correct
40 Correct 2 ms 2668 KB Output is correct
41 Correct 256 ms 32924 KB Output is correct
42 Correct 531 ms 51092 KB Output is correct
43 Correct 551 ms 51156 KB Output is correct
44 Correct 149 ms 26404 KB Output is correct
45 Correct 526 ms 51472 KB Output is correct
46 Correct 530 ms 51088 KB Output is correct
47 Correct 541 ms 51280 KB Output is correct
48 Correct 526 ms 51216 KB Output is correct
49 Correct 544 ms 51092 KB Output is correct
50 Correct 528 ms 51236 KB Output is correct
51 Correct 532 ms 51216 KB Output is correct
52 Correct 543 ms 51232 KB Output is correct
53 Correct 530 ms 51108 KB Output is correct
54 Correct 521 ms 51348 KB Output is correct
55 Correct 522 ms 51472 KB Output is correct
56 Correct 519 ms 51088 KB Output is correct
57 Correct 529 ms 51392 KB Output is correct
58 Correct 538 ms 51088 KB Output is correct
59 Correct 147 ms 28068 KB Output is correct
60 Correct 524 ms 51088 KB Output is correct
61 Correct 499 ms 50816 KB Output is correct
62 Correct 126 ms 25108 KB Output is correct
63 Correct 138 ms 24488 KB Output is correct
64 Correct 128 ms 25108 KB Output is correct
65 Correct 124 ms 25108 KB Output is correct
66 Correct 146 ms 24828 KB Output is correct
67 Correct 150 ms 27896 KB Output is correct
68 Correct 129 ms 25108 KB Output is correct
69 Correct 149 ms 27044 KB Output is correct
70 Correct 126 ms 25236 KB Output is correct
71 Correct 160 ms 27172 KB Output is correct
72 Correct 386 ms 33308 KB Output is correct
73 Correct 614 ms 51600 KB Output is correct
74 Correct 604 ms 51696 KB Output is correct
75 Correct 647 ms 51600 KB Output is correct
76 Correct 609 ms 51756 KB Output is correct
77 Correct 620 ms 51608 KB Output is correct
78 Correct 629 ms 51628 KB Output is correct
79 Correct 645 ms 51728 KB Output is correct
80 Correct 605 ms 51600 KB Output is correct
81 Correct 626 ms 51688 KB Output is correct
82 Correct 621 ms 51704 KB Output is correct
83 Correct 610 ms 51728 KB Output is correct
84 Correct 616 ms 51600 KB Output is correct
85 Correct 618 ms 51856 KB Output is correct
86 Correct 613 ms 51472 KB Output is correct
87 Correct 624 ms 51600 KB Output is correct
88 Correct 613 ms 51600 KB Output is correct
89 Correct 300 ms 28196 KB Output is correct
90 Correct 607 ms 51600 KB Output is correct
91 Correct 579 ms 51088 KB Output is correct
92 Correct 201 ms 25364 KB Output is correct
93 Correct 253 ms 25384 KB Output is correct
94 Correct 197 ms 25236 KB Output is correct
95 Correct 198 ms 25492 KB Output is correct
96 Correct 254 ms 25340 KB Output is correct
97 Correct 306 ms 27044 KB Output is correct
98 Correct 200 ms 25364 KB Output is correct
99 Correct 313 ms 28324 KB Output is correct
100 Correct 204 ms 25428 KB Output is correct