Submission #565568

# Submission time Handle Problem Language Result Execution time Memory
565568 2022-05-21T06:36:34 Z milisav Evacuation plan (IZhO18_plan) C++14
100 / 100
558 ms 75500 KB
#include<bits/stdc++.h>
#define maxn 600000
using namespace std;
vector<pair<int,int> > a[maxn];
int d[maxn];
priority_queue<pair<int,int> > pq;
bool vis[maxn];
int ans[maxn];
vector<pair<int,int> > queries[maxn];
int comp[maxn];
vector<int> incomp[maxn];
pair<int,int> dng[maxn];
void merge_components(int u,int v,int dg) {
    if(comp[u]==comp[v]) return;
    if(incomp[comp[u]].size()>incomp[comp[v]].size()) {
        swap(u,v);
    }
    for(auto x:incomp[comp[u]]) {
        for(auto q:queries[x]) {
            if(comp[q.first]==comp[v]) {
                ans[q.second]=dg;
            }
        }
    }
    int cc=comp[u];
    for(auto x:incomp[cc]) {
        comp[x]=comp[v];
        incomp[comp[v]].push_back(x);
    }

}
int main() {
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++) {
        int u,v,w;
        scanf("%d %d %d",&u,&v,&w);
        a[u].push_back({v,w});
        a[v].push_back({u,w});
    }
    for(int i=1;i<=n;i++) {
        d[i]=1e9;
    }
    int k;
    scanf("%d",&k);
    for(int i=0;i<k;i++) {
        int g;
        scanf("%d",&g);
        d[g]=0;
        pq.push({-d[g],g});
    }
    while(!pq.empty()) {
        int u=pq.top().second;
        pq.pop();
        if(!vis[u]) {
            vis[u]=true;
            for(auto eg:a[u]) {
                int v=eg.first;
                int w=eg.second;
                if(d[v]>d[u]+w) {
                    d[v]=d[u]+w;
                    pq.push({-d[v],v});
                }
            }
        }
    }
    /*for(int i=1;i<=n;i++) {
        printf("d[%d]=%d\n",i,d[i]);
    }*/
    int q;
    scanf("%d",&q);
    for(int i=1;i<=q;i++) {
        int s,t;
        scanf("%d %d",&s,&t);
        queries[s].push_back({t,i});
        queries[t].push_back({s,i});
    }
    for(int i=1;i<=n;i++) {
        dng[i]={d[i],i};
        comp[i]=i;
        incomp[i].push_back(i);
        vis[i]=false;
    }
    sort(dng+1,dng+n+1);
    reverse(dng+1,dng+n+1);
    for(int i=1;i<=n;i++) {
        int u=dng[i].second;
        for(auto eg:a[u]) {
            int v=eg.first;
            if(vis[v]) {
                merge_components(u,v,dng[i].first);
            }
        }
        vis[u]=true;
    }

    for(int i=1;i<=q;i++) {
        printf("%d\n",ans[i]);
    }
    return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
plan.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d %d %d",&u,&v,&w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
plan.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d",&k);
      |     ~~~~~^~~~~~~~~
plan.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         scanf("%d",&g);
      |         ~~~~~^~~~~~~~~
plan.cpp:71:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
plan.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         scanf("%d %d",&s,&t);
      |         ~~~~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 21 ms 42580 KB Output is correct
2 Correct 22 ms 42720 KB Output is correct
3 Correct 21 ms 42720 KB Output is correct
4 Correct 21 ms 42560 KB Output is correct
5 Correct 23 ms 42744 KB Output is correct
6 Correct 21 ms 42684 KB Output is correct
7 Correct 20 ms 42684 KB Output is correct
8 Correct 22 ms 42540 KB Output is correct
9 Correct 22 ms 42708 KB Output is correct
10 Correct 21 ms 42672 KB Output is correct
11 Correct 21 ms 42684 KB Output is correct
12 Correct 22 ms 42780 KB Output is correct
13 Correct 21 ms 42708 KB Output is correct
14 Correct 23 ms 42700 KB Output is correct
15 Correct 22 ms 42736 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 21 ms 42580 KB Output is correct
2 Correct 22 ms 42720 KB Output is correct
3 Correct 21 ms 42720 KB Output is correct
4 Correct 21 ms 42560 KB Output is correct
5 Correct 23 ms 42744 KB Output is correct
6 Correct 21 ms 42684 KB Output is correct
7 Correct 20 ms 42684 KB Output is correct
8 Correct 22 ms 42540 KB Output is correct
9 Correct 22 ms 42708 KB Output is correct
10 Correct 21 ms 42672 KB Output is correct
11 Correct 21 ms 42684 KB Output is correct
12 Correct 22 ms 42780 KB Output is correct
13 Correct 21 ms 42708 KB Output is correct
14 Correct 23 ms 42700 KB Output is correct
15 Correct 22 ms 42736 KB Output is correct
16 Correct 186 ms 57376 KB Output is correct
17 Correct 447 ms 75260 KB Output is correct
18 Correct 51 ms 45644 KB Output is correct
19 Correct 166 ms 60552 KB Output is correct
20 Correct 426 ms 75500 KB Output is correct
21 Correct 251 ms 63424 KB Output is correct
22 Correct 196 ms 58276 KB Output is correct
23 Correct 531 ms 75244 KB Output is correct
24 Correct 439 ms 75256 KB Output is correct
25 Correct 437 ms 75296 KB Output is correct
26 Correct 165 ms 60444 KB Output is correct
27 Correct 170 ms 60448 KB Output is correct
28 Correct 184 ms 60352 KB Output is correct
29 Correct 163 ms 60416 KB Output is correct
30 Correct 173 ms 60552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 21 ms 42500 KB Output is correct
2 Correct 21 ms 42608 KB Output is correct
3 Correct 21 ms 42500 KB Output is correct
4 Correct 20 ms 42616 KB Output is correct
5 Correct 21 ms 42624 KB Output is correct
6 Correct 20 ms 42572 KB Output is correct
7 Correct 22 ms 42568 KB Output is correct
8 Correct 20 ms 42580 KB Output is correct
9 Correct 22 ms 42580 KB Output is correct
10 Correct 20 ms 42580 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 202 ms 57604 KB Output is correct
2 Correct 367 ms 70012 KB Output is correct
3 Correct 381 ms 70016 KB Output is correct
4 Correct 98 ms 53088 KB Output is correct
5 Correct 390 ms 70020 KB Output is correct
6 Correct 368 ms 69984 KB Output is correct
7 Correct 409 ms 70076 KB Output is correct
8 Correct 389 ms 70028 KB Output is correct
9 Correct 379 ms 70040 KB Output is correct
10 Correct 377 ms 70020 KB Output is correct
11 Correct 405 ms 70060 KB Output is correct
12 Correct 412 ms 69988 KB Output is correct
13 Correct 406 ms 69936 KB Output is correct
14 Correct 402 ms 70080 KB Output is correct
15 Correct 441 ms 70060 KB Output is correct
16 Correct 413 ms 69972 KB Output is correct
17 Correct 413 ms 70060 KB Output is correct
18 Correct 393 ms 70076 KB Output is correct
19 Correct 106 ms 52792 KB Output is correct
20 Correct 388 ms 70004 KB Output is correct
21 Correct 363 ms 70268 KB Output is correct
22 Correct 118 ms 54544 KB Output is correct
23 Correct 118 ms 54496 KB Output is correct
24 Correct 128 ms 54556 KB Output is correct
25 Correct 143 ms 54552 KB Output is correct
26 Correct 132 ms 54884 KB Output is correct
27 Correct 103 ms 53092 KB Output is correct
28 Correct 110 ms 54552 KB Output is correct
29 Correct 108 ms 52904 KB Output is correct
30 Correct 124 ms 54596 KB Output is correct
31 Correct 99 ms 52892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 21 ms 42580 KB Output is correct
2 Correct 22 ms 42720 KB Output is correct
3 Correct 21 ms 42720 KB Output is correct
4 Correct 21 ms 42560 KB Output is correct
5 Correct 23 ms 42744 KB Output is correct
6 Correct 21 ms 42684 KB Output is correct
7 Correct 20 ms 42684 KB Output is correct
8 Correct 22 ms 42540 KB Output is correct
9 Correct 22 ms 42708 KB Output is correct
10 Correct 21 ms 42672 KB Output is correct
11 Correct 21 ms 42684 KB Output is correct
12 Correct 22 ms 42780 KB Output is correct
13 Correct 21 ms 42708 KB Output is correct
14 Correct 23 ms 42700 KB Output is correct
15 Correct 22 ms 42736 KB Output is correct
16 Correct 186 ms 57376 KB Output is correct
17 Correct 447 ms 75260 KB Output is correct
18 Correct 51 ms 45644 KB Output is correct
19 Correct 166 ms 60552 KB Output is correct
20 Correct 426 ms 75500 KB Output is correct
21 Correct 251 ms 63424 KB Output is correct
22 Correct 196 ms 58276 KB Output is correct
23 Correct 531 ms 75244 KB Output is correct
24 Correct 439 ms 75256 KB Output is correct
25 Correct 437 ms 75296 KB Output is correct
26 Correct 165 ms 60444 KB Output is correct
27 Correct 170 ms 60448 KB Output is correct
28 Correct 184 ms 60352 KB Output is correct
29 Correct 163 ms 60416 KB Output is correct
30 Correct 173 ms 60552 KB Output is correct
31 Correct 21 ms 42500 KB Output is correct
32 Correct 21 ms 42608 KB Output is correct
33 Correct 21 ms 42500 KB Output is correct
34 Correct 20 ms 42616 KB Output is correct
35 Correct 21 ms 42624 KB Output is correct
36 Correct 20 ms 42572 KB Output is correct
37 Correct 22 ms 42568 KB Output is correct
38 Correct 20 ms 42580 KB Output is correct
39 Correct 22 ms 42580 KB Output is correct
40 Correct 20 ms 42580 KB Output is correct
41 Correct 202 ms 57604 KB Output is correct
42 Correct 367 ms 70012 KB Output is correct
43 Correct 381 ms 70016 KB Output is correct
44 Correct 98 ms 53088 KB Output is correct
45 Correct 390 ms 70020 KB Output is correct
46 Correct 368 ms 69984 KB Output is correct
47 Correct 409 ms 70076 KB Output is correct
48 Correct 389 ms 70028 KB Output is correct
49 Correct 379 ms 70040 KB Output is correct
50 Correct 377 ms 70020 KB Output is correct
51 Correct 405 ms 70060 KB Output is correct
52 Correct 412 ms 69988 KB Output is correct
53 Correct 406 ms 69936 KB Output is correct
54 Correct 402 ms 70080 KB Output is correct
55 Correct 441 ms 70060 KB Output is correct
56 Correct 413 ms 69972 KB Output is correct
57 Correct 413 ms 70060 KB Output is correct
58 Correct 393 ms 70076 KB Output is correct
59 Correct 106 ms 52792 KB Output is correct
60 Correct 388 ms 70004 KB Output is correct
61 Correct 363 ms 70268 KB Output is correct
62 Correct 118 ms 54544 KB Output is correct
63 Correct 118 ms 54496 KB Output is correct
64 Correct 128 ms 54556 KB Output is correct
65 Correct 143 ms 54552 KB Output is correct
66 Correct 132 ms 54884 KB Output is correct
67 Correct 103 ms 53092 KB Output is correct
68 Correct 110 ms 54552 KB Output is correct
69 Correct 108 ms 52904 KB Output is correct
70 Correct 124 ms 54596 KB Output is correct
71 Correct 99 ms 52892 KB Output is correct
72 Correct 273 ms 62988 KB Output is correct
73 Correct 452 ms 75332 KB Output is correct
74 Correct 495 ms 75300 KB Output is correct
75 Correct 558 ms 75308 KB Output is correct
76 Correct 488 ms 75412 KB Output is correct
77 Correct 462 ms 75304 KB Output is correct
78 Correct 458 ms 75216 KB Output is correct
79 Correct 452 ms 75328 KB Output is correct
80 Correct 460 ms 75276 KB Output is correct
81 Correct 458 ms 75280 KB Output is correct
82 Correct 456 ms 75324 KB Output is correct
83 Correct 456 ms 75328 KB Output is correct
84 Correct 462 ms 75268 KB Output is correct
85 Correct 487 ms 75396 KB Output is correct
86 Correct 442 ms 75328 KB Output is correct
87 Correct 449 ms 75380 KB Output is correct
88 Correct 453 ms 75328 KB Output is correct
89 Correct 163 ms 58500 KB Output is correct
90 Correct 446 ms 75312 KB Output is correct
91 Correct 428 ms 75284 KB Output is correct
92 Correct 183 ms 59972 KB Output is correct
93 Correct 188 ms 60356 KB Output is correct
94 Correct 182 ms 59756 KB Output is correct
95 Correct 171 ms 59876 KB Output is correct
96 Correct 212 ms 60292 KB Output is correct
97 Correct 162 ms 58372 KB Output is correct
98 Correct 176 ms 59816 KB Output is correct
99 Correct 160 ms 58488 KB Output is correct
100 Correct 177 ms 59924 KB Output is correct