oj.uz

Submission #420012

# Submission time Handle Problem Language Result Execution time Memory
420012 2021-06-07T22:21:20 Z Runtime_error_ Evacuation plan (IZhO18_plan) C++14
100 / 100
 713 ms 39804 KB 
#include <bits/stdc++.h>
#define pi pair<int,int>
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
const int inf = 1e5+9,MX = 1e9+9;
int n,m,k,q,dis[inf],par[inf],qu[inf],qv[inf],qans[inf];
bool vis[inf];
vector<pi> adj[inf],distances;
set<pair<int,int> > s;
vector<int> queries[inf];

int root(int u){
    if(u == par[u])return u;
    return par[u] = root(par[u]);
}

void join(int u,int v,int Time){
    u = root(u), v = root(v);
    if(u == v)return ;
    if(queries[u].size() > queries[v].size())
        swap(u,v);
    par[u] = v;
    for(auto id:queries[u]){
        if(qans[id] != -1)continue;
        if(root(qu[id]) == root(qv[id]))
            qans[id] = Time;
        else
            queries[v].pb(id);
    }
}

int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        adj[u].pb(pi(v,w));
        adj[v].pb(pi(u,w));
    }
    for(int i=1;i<=n;i++)
        dis[i] = MX,par[i] = i;
    scanf("%d",&k);
    for(int i=1;i<=k;i++){
        int u;
        scanf("%d",&u);
        s.insert(pi(0,u));
        dis[u] = 0;
    }
    scanf("%d",&q);
    for(int i=1;i<=q;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        qu[i] = u,qv[i] = v;
        queries[u].pb(i);
        queries[v].pb(i);
        qans[i] = -1;
    }
    while(!s.empty()){
        int u = s.begin()->second;
        s.erase(s.begin());
        if(vis[u])continue;
        distances.pb(pi(dis[u],u));
        vis[u] = 1;
        for(auto o:adj[u]){
            int v = o.first,w = o.second;
            if(dis[v] > dis[u] + w)
                dis[v] = dis[u] + w,s.insert(pi(dis[v],v));
        }
    }
    sort(rall(distances));
    for(auto o:distances){
        int Time = o.first,u = o.second;
        for(auto v:adj[u])
            if(dis[v.first] >= dis[u])
                join(u,v.first,Time);
    }
    for(int i=1;i<=q;i++)
        printf("%d\n",qans[i]);

}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
plan.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         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",&u);
      |         ~~~~~^~~~~~~~~
plan.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
plan.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         scanf("%d%d",&u,&v);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 5060 KB Output is correct
3 Correct 4 ms 5144 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 5068 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5184 KB Output is correct
11 Correct 4 ms 5140 KB Output is correct
12 Correct 4 ms 5196 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 5 ms 5068 KB Output is correct
15 Correct 4 ms 5140 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 5060 KB Output is correct
3 Correct 4 ms 5144 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 5068 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5184 KB Output is correct
11 Correct 4 ms 5140 KB Output is correct
12 Correct 4 ms 5196 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 5 ms 5068 KB Output is correct
15 Correct 4 ms 5140 KB Output is correct
16 Correct 183 ms 18156 KB Output is correct
17 Correct 578 ms 39404 KB Output is correct
18 Correct 35 ms 8032 KB Output is correct
19 Correct 194 ms 23592 KB Output is correct
20 Correct 602 ms 39400 KB Output is correct
21 Correct 322 ms 25484 KB Output is correct
22 Correct 191 ms 18864 KB Output is correct
23 Correct 631 ms 39468 KB Output is correct
24 Correct 584 ms 39704 KB Output is correct
25 Correct 622 ms 39740 KB Output is correct
26 Correct 214 ms 23680 KB Output is correct
27 Correct 274 ms 23608 KB Output is correct
28 Correct 226 ms 23604 KB Output is correct
29 Correct 224 ms 23556 KB Output is correct
30 Correct 179 ms 23564 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 18976 KB Output is correct
2 Correct 517 ms 33868 KB Output is correct
3 Correct 542 ms 33668 KB Output is correct
4 Correct 74 ms 11696 KB Output is correct
5 Correct 582 ms 33728 KB Output is correct
6 Correct 532 ms 33664 KB Output is correct
7 Correct 554 ms 33736 KB Output is correct
8 Correct 502 ms 33664 KB Output is correct
9 Correct 513 ms 33708 KB Output is correct
10 Correct 520 ms 33664 KB Output is correct
11 Correct 527 ms 33732 KB Output is correct
12 Correct 592 ms 33796 KB Output is correct
13 Correct 497 ms 33796 KB Output is correct
14 Correct 574 ms 33880 KB Output is correct
15 Correct 511 ms 34024 KB Output is correct
16 Correct 532 ms 33728 KB Output is correct
17 Correct 535 ms 33836 KB Output is correct
18 Correct 526 ms 33764 KB Output is correct
19 Correct 72 ms 11720 KB Output is correct
20 Correct 558 ms 33840 KB Output is correct
21 Correct 477 ms 32568 KB Output is correct
22 Correct 118 ms 17592 KB Output is correct
23 Correct 83 ms 12228 KB Output is correct
24 Correct 124 ms 17676 KB Output is correct
25 Correct 128 ms 17580 KB Output is correct
26 Correct 116 ms 12596 KB Output is correct
27 Correct 68 ms 11716 KB Output is correct
28 Correct 129 ms 17552 KB Output is correct
29 Correct 73 ms 11824 KB Output is correct
30 Correct 134 ms 17640 KB Output is correct
31 Correct 65 ms 11716 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 5060 KB Output is correct
3 Correct 4 ms 5144 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 4 ms 5068 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5184 KB Output is correct
11 Correct 4 ms 5140 KB Output is correct
12 Correct 4 ms 5196 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 5 ms 5068 KB Output is correct
15 Correct 4 ms 5140 KB Output is correct
16 Correct 183 ms 18156 KB Output is correct
17 Correct 578 ms 39404 KB Output is correct
18 Correct 35 ms 8032 KB Output is correct
19 Correct 194 ms 23592 KB Output is correct
20 Correct 602 ms 39400 KB Output is correct
21 Correct 322 ms 25484 KB Output is correct
22 Correct 191 ms 18864 KB Output is correct
23 Correct 631 ms 39468 KB Output is correct
24 Correct 584 ms 39704 KB Output is correct
25 Correct 622 ms 39740 KB Output is correct
26 Correct 214 ms 23680 KB Output is correct
27 Correct 274 ms 23608 KB Output is correct
28 Correct 226 ms 23604 KB Output is correct
29 Correct 224 ms 23556 KB Output is correct
30 Correct 179 ms 23564 KB Output is correct
31 Correct 5 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 4 ms 4920 KB Output is correct
34 Correct 4 ms 4940 KB Output is correct
35 Correct 4 ms 4940 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 4 ms 4996 KB Output is correct
40 Correct 3 ms 4940 KB Output is correct
41 Correct 231 ms 18976 KB Output is correct
42 Correct 517 ms 33868 KB Output is correct
43 Correct 542 ms 33668 KB Output is correct
44 Correct 74 ms 11696 KB Output is correct
45 Correct 582 ms 33728 KB Output is correct
46 Correct 532 ms 33664 KB Output is correct
47 Correct 554 ms 33736 KB Output is correct
48 Correct 502 ms 33664 KB Output is correct
49 Correct 513 ms 33708 KB Output is correct
50 Correct 520 ms 33664 KB Output is correct
51 Correct 527 ms 33732 KB Output is correct
52 Correct 592 ms 33796 KB Output is correct
53 Correct 497 ms 33796 KB Output is correct
54 Correct 574 ms 33880 KB Output is correct
55 Correct 511 ms 34024 KB Output is correct
56 Correct 532 ms 33728 KB Output is correct
57 Correct 535 ms 33836 KB Output is correct
58 Correct 526 ms 33764 KB Output is correct
59 Correct 72 ms 11720 KB Output is correct
60 Correct 558 ms 33840 KB Output is correct
61 Correct 477 ms 32568 KB Output is correct
62 Correct 118 ms 17592 KB Output is correct
63 Correct 83 ms 12228 KB Output is correct
64 Correct 124 ms 17676 KB Output is correct
65 Correct 128 ms 17580 KB Output is correct
66 Correct 116 ms 12596 KB Output is correct
67 Correct 68 ms 11716 KB Output is correct
68 Correct 129 ms 17552 KB Output is correct
69 Correct 73 ms 11824 KB Output is correct
70 Correct 134 ms 17640 KB Output is correct
71 Correct 65 ms 11716 KB Output is correct
72 Correct 329 ms 25004 KB Output is correct
73 Correct 684 ms 39532 KB Output is correct
74 Correct 650 ms 39652 KB Output is correct
75 Correct 594 ms 39604 KB Output is correct
76 Correct 557 ms 39600 KB Output is correct
77 Correct 552 ms 39768 KB Output is correct
78 Correct 563 ms 39804 KB Output is correct
79 Correct 556 ms 39580 KB Output is correct
80 Correct 582 ms 39572 KB Output is correct
81 Correct 556 ms 39716 KB Output is correct
82 Correct 559 ms 39612 KB Output is correct
83 Correct 611 ms 39716 KB Output is correct
84 Correct 594 ms 39796 KB Output is correct
85 Correct 604 ms 39572 KB Output is correct
86 Correct 582 ms 39664 KB Output is correct
87 Correct 713 ms 39464 KB Output is correct
88 Correct 624 ms 39604 KB Output is correct
89 Correct 153 ms 18356 KB Output is correct
90 Correct 554 ms 39528 KB Output is correct
91 Correct 555 ms 38164 KB Output is correct
92 Correct 210 ms 22772 KB Output is correct
93 Correct 205 ms 21272 KB Output is correct
94 Correct 197 ms 22728 KB Output is correct
95 Correct 187 ms 22872 KB Output is correct
96 Correct 229 ms 21432 KB Output is correct
97 Correct 150 ms 18428 KB Output is correct
98 Correct 208 ms 22832 KB Output is correct
99 Correct 147 ms 18396 KB Output is correct
100 Correct 201 ms 22840 KB Output is correct