oj.uz

Submission #334349

# Submission time Handle Problem Language Result Execution time Memory
334349 2020-12-09T03:56:42 Z juggernaut Evacuation plan (IZhO18_plan) C++14
100 / 100
 641 ms 56976 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,dis[100005],par[100005],sz[100005],up[100005][20],mn[100005][20],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<20;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=19;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:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
plan.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   49 |         scanf("%d%d%d",&e.x,&e.y,&e.z);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
plan.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |         scanf("%d",&x);
      |         ~~~~~^~~~~~~~~
plan.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   99 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
plan.cpp:102:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  102 |         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 3 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 4 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 3 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 4 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 212 ms 24608 KB Output is correct
17 Correct 613 ms 53904 KB Output is correct
18 Correct 39 ms 7428 KB Output is correct
19 Correct 198 ms 28008 KB Output is correct
20 Correct 629 ms 54188 KB Output is correct
21 Correct 341 ms 35612 KB Output is correct
22 Correct 241 ms 31396 KB Output is correct
23 Correct 624 ms 53952 KB Output is correct
24 Correct 612 ms 53968 KB Output is correct
25 Correct 609 ms 53928 KB Output is correct
26 Correct 197 ms 27796 KB Output is correct
27 Correct 198 ms 27796 KB Output is correct
28 Correct 193 ms 27668 KB Output is correct
29 Correct 196 ms 27796 KB Output is correct
30 Correct 213 ms 27924 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 2 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 244 ms 35100 KB Output is correct
2 Correct 524 ms 53520 KB Output is correct
3 Correct 541 ms 53520 KB Output is correct
4 Correct 172 ms 28836 KB Output is correct
5 Correct 536 ms 53436 KB Output is correct
6 Correct 534 ms 53540 KB Output is correct
7 Correct 568 ms 53488 KB Output is correct
8 Correct 548 ms 53520 KB Output is correct
9 Correct 547 ms 53460 KB Output is correct
10 Correct 548 ms 53464 KB Output is correct
11 Correct 566 ms 53520 KB Output is correct
12 Correct 556 ms 53520 KB Output is correct
13 Correct 535 ms 53648 KB Output is correct
14 Correct 542 ms 53520 KB Output is correct
15 Correct 554 ms 53776 KB Output is correct
16 Correct 578 ms 53520 KB Output is correct
17 Correct 587 ms 53428 KB Output is correct
18 Correct 529 ms 53696 KB Output is correct
19 Correct 173 ms 30516 KB Output is correct
20 Correct 527 ms 53516 KB Output is correct
21 Correct 499 ms 53208 KB Output is correct
22 Correct 135 ms 27540 KB Output is correct
23 Correct 138 ms 26920 KB Output is correct
24 Correct 132 ms 27412 KB Output is correct
25 Correct 133 ms 27412 KB Output is correct
26 Correct 155 ms 27260 KB Output is correct
27 Correct 181 ms 30116 KB Output is correct
28 Correct 133 ms 27412 KB Output is correct
29 Correct 171 ms 29476 KB Output is correct
30 Correct 130 ms 27560 KB Output is correct
31 Correct 172 ms 29476 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 3 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 4 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 212 ms 24608 KB Output is correct
17 Correct 613 ms 53904 KB Output is correct
18 Correct 39 ms 7428 KB Output is correct
19 Correct 198 ms 28008 KB Output is correct
20 Correct 629 ms 54188 KB Output is correct
21 Correct 341 ms 35612 KB Output is correct
22 Correct 241 ms 31396 KB Output is correct
23 Correct 624 ms 53952 KB Output is correct
24 Correct 612 ms 53968 KB Output is correct
25 Correct 609 ms 53928 KB Output is correct
26 Correct 197 ms 27796 KB Output is correct
27 Correct 198 ms 27796 KB Output is correct
28 Correct 193 ms 27668 KB Output is correct
29 Correct 196 ms 27796 KB Output is correct
30 Correct 213 ms 27924 KB Output is correct
31 Correct 2 ms 2668 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 2 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 244 ms 35100 KB Output is correct
42 Correct 524 ms 53520 KB Output is correct
43 Correct 541 ms 53520 KB Output is correct
44 Correct 172 ms 28836 KB Output is correct
45 Correct 536 ms 53436 KB Output is correct
46 Correct 534 ms 53540 KB Output is correct
47 Correct 568 ms 53488 KB Output is correct
48 Correct 548 ms 53520 KB Output is correct
49 Correct 547 ms 53460 KB Output is correct
50 Correct 548 ms 53464 KB Output is correct
51 Correct 566 ms 53520 KB Output is correct
52 Correct 556 ms 53520 KB Output is correct
53 Correct 535 ms 53648 KB Output is correct
54 Correct 542 ms 53520 KB Output is correct
55 Correct 554 ms 53776 KB Output is correct
56 Correct 578 ms 53520 KB Output is correct
57 Correct 587 ms 53428 KB Output is correct
58 Correct 529 ms 53696 KB Output is correct
59 Correct 173 ms 30516 KB Output is correct
60 Correct 527 ms 53516 KB Output is correct
61 Correct 499 ms 53208 KB Output is correct
62 Correct 135 ms 27540 KB Output is correct
63 Correct 138 ms 26920 KB Output is correct
64 Correct 132 ms 27412 KB Output is correct
65 Correct 133 ms 27412 KB Output is correct
66 Correct 155 ms 27260 KB Output is correct
67 Correct 181 ms 30116 KB Output is correct
68 Correct 133 ms 27412 KB Output is correct
69 Correct 171 ms 29476 KB Output is correct
70 Correct 130 ms 27560 KB Output is correct
71 Correct 172 ms 29476 KB Output is correct
72 Correct 354 ms 35612 KB Output is correct
73 Correct 626 ms 53904 KB Output is correct
74 Correct 612 ms 54032 KB Output is correct
75 Correct 620 ms 53996 KB Output is correct
76 Correct 610 ms 53904 KB Output is correct
77 Correct 621 ms 53880 KB Output is correct
78 Correct 612 ms 54032 KB Output is correct
79 Correct 618 ms 54296 KB Output is correct
80 Correct 619 ms 54040 KB Output is correct
81 Correct 615 ms 53904 KB Output is correct
82 Correct 615 ms 53904 KB Output is correct
83 Correct 620 ms 53904 KB Output is correct
84 Correct 631 ms 54168 KB Output is correct
85 Correct 613 ms 54160 KB Output is correct
86 Correct 618 ms 53904 KB Output is correct
87 Correct 613 ms 53904 KB Output is correct
88 Correct 619 ms 53904 KB Output is correct
89 Correct 337 ms 31652 KB Output is correct
90 Correct 641 ms 56976 KB Output is correct
91 Correct 613 ms 56464 KB Output is correct
92 Correct 211 ms 30740 KB Output is correct
93 Correct 264 ms 30376 KB Output is correct
94 Correct 214 ms 30612 KB Output is correct
95 Correct 219 ms 30612 KB Output is correct
96 Correct 271 ms 30588 KB Output is correct
97 Correct 338 ms 32548 KB Output is correct
98 Correct 209 ms 30612 KB Output is correct
99 Correct 345 ms 33572 KB Output is correct
100 Correct 208 ms 30612 KB Output is correct