oj.uz

Submission #184110

# Submission time Handle Problem Language Result Execution time Memory
184110 2020-01-10T19:08:35 Z rzbt Evacuation plan (IZhO18_plan) C++14
100 / 100
 1339 ms 66208 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 100005
typedef long long ll;

using namespace std;

int n,m;
vector<pair<int,pair<int,int> > > grane;
vector<pair<int,int> > stablo[MAXN],niz[MAXN];
int pre[MAXN][20];
int cale[MAXN],masa[MAXN],dub[MAXN];
int docal[MAXN],udalj[MAXN];

int koren(int p){
    while(p!=cale[p])p=cale[p];
    return p;
}

void spoji(int a,int b,int masa2){

    a=koren(a);
    b=koren(b);

    if(a==b)return;

    if(masa[a]<masa[b])swap(a,b);
    //printf("   %d %d     %d\n",a,b,masa2);
    pre[b][0]=a;
    docal[b]=masa2;
    stablo[a].pb(mp(b,masa2));
    masa[a]+=masa[b];
    cale[b]=a;
}

void dfsS(int t,int o,int h){
   // printf("   %d %d\n",t,h);
    dub[t]=h;
    for(auto x:stablo[t])
        dfsS(x.F,t,h+1);

}
int resi(int a,int b){
    //printf("     %d %d   ",dub[a],dub[b]);
    if(dub[b]>dub[a])swap(a,b);
    for(int j=19;j>=0;j--)
        if(pre[a][j]!=0 && dub[pre[a][j]]>dub[b])a=pre[a][j];

    if(a==b)return udalj[a];
    if(pre[a][0]==b)return docal[a];
    //printf("NISAM GOTOV   ");
    if(dub[a]!=dub[b])a=pre[a][0];
    for(int j=19;j>=0;j--)
        if(pre[a][j]!=pre[b][j])a=pre[a][j],b=pre[b][j];
    //printf("    %d %d  ", a,b);
    return min(docal[a],docal[b]);

}

set<pair<int,int> > q;
bool obidjen[MAXN];
void dijkstra(){
    while(!q.empty()){
        pair<int,int> t=*q.begin();
        q.erase(q.begin());
        if(obidjen[t.S])continue;
        obidjen[t.S]=true;
        udalj[t.S]=t.F;
        for(auto x:niz[t.S]){
            if(obidjen[x.F])continue;
            q.insert(mp(x.S+t.F,x.F));
        }

    }
}


int main()
{
    scanf("%d %d", &n, &m);
    for(int i=1;i<=n;i++){
        cale[i]=i;
        masa[i]=1;
    }
    for(int i=1;i<=m;i++){
        int t1,t2,t3;
        scanf("%d %d %d", &t1, &t2, &t3);
        niz[t1].pb(mp(t2,t3));
        niz[t2].pb(mp(t1,t3));

        grane.pb(mp(t3,mp(t1,t2)));
    }

    int k;
    scanf("%d", &k);
    while(k--){
        int t;
        scanf("%d", &t);
        q.insert(mp(0,t));
        //printf("gotov");
    }
    dijkstra();
    for(auto it=grane.begin();it!=grane.end();it++)it->F=-min(udalj[it->S.F],udalj[it->S.S]);
    sort(all(grane));
    for(auto x:grane)
        spoji(x.S.F,x.S.S,min(udalj[x.S.F],udalj[x.S.S]));
    for(int j=1;j<20;j++){
        for(int i=1;i<=n;i++)
            pre[i][j]=pre[pre[i][j-1]][j-1];
    }
    dfsS(koren(1),0,1);
    int qq;
    scanf("%d", &qq);
    while(qq--){
        int a,b;
        scanf("%d %d", &a, &b);
        printf("%d\n",resi(a,b));

    }
    return 0;
}
//

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:84:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
plan.cpp:91:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &t1, &t2, &t3);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &k);
     ~~~~~^~~~~~~~~~
plan.cpp:102:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &t);
         ~~~~~^~~~~~~~~~
plan.cpp:117:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &qq);
     ~~~~~^~~~~~~~~~~
plan.cpp:120:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 8 ms 5304 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 8 ms 5212 KB Output is correct
6 Correct 8 ms 5212 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 7 ms 5084 KB Output is correct
9 Correct 9 ms 5240 KB Output is correct
10 Correct 8 ms 5240 KB Output is correct
11 Correct 8 ms 5268 KB Output is correct
12 Correct 7 ms 5212 KB Output is correct
13 Correct 8 ms 5148 KB Output is correct
14 Correct 8 ms 5244 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 8 ms 5304 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 8 ms 5212 KB Output is correct
6 Correct 8 ms 5212 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 7 ms 5084 KB Output is correct
9 Correct 9 ms 5240 KB Output is correct
10 Correct 8 ms 5240 KB Output is correct
11 Correct 8 ms 5268 KB Output is correct
12 Correct 7 ms 5212 KB Output is correct
13 Correct 8 ms 5148 KB Output is correct
14 Correct 8 ms 5244 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct
16 Correct 252 ms 20148 KB Output is correct
17 Correct 1300 ms 52256 KB Output is correct
18 Correct 65 ms 9264 KB Output is correct
19 Correct 230 ms 22200 KB Output is correct
20 Correct 1262 ms 51768 KB Output is correct
21 Correct 534 ms 32544 KB Output is correct
22 Correct 191 ms 21940 KB Output is correct
23 Correct 1304 ms 51732 KB Output is correct
24 Correct 1262 ms 51656 KB Output is correct
25 Correct 1317 ms 52656 KB Output is correct
26 Correct 234 ms 22004 KB Output is correct
27 Correct 230 ms 22108 KB Output is correct
28 Correct 237 ms 22168 KB Output is correct
29 Correct 236 ms 22112 KB Output is correct
30 Correct 227 ms 22192 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5088 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5028 KB Output is correct
4 Correct 7 ms 5032 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5040 KB Output is correct
7 Correct 6 ms 5096 KB Output is correct
8 Correct 6 ms 5088 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 7 ms 5108 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 29416 KB Output is correct
2 Correct 1254 ms 50508 KB Output is correct
3 Correct 1259 ms 51812 KB Output is correct
4 Correct 145 ms 20732 KB Output is correct
5 Correct 1258 ms 50616 KB Output is correct
6 Correct 1244 ms 51800 KB Output is correct
7 Correct 1251 ms 51744 KB Output is correct
8 Correct 1284 ms 52032 KB Output is correct
9 Correct 1260 ms 51832 KB Output is correct
10 Correct 1257 ms 51284 KB Output is correct
11 Correct 1231 ms 51836 KB Output is correct
12 Correct 1232 ms 51784 KB Output is correct
13 Correct 1219 ms 51748 KB Output is correct
14 Correct 1242 ms 52052 KB Output is correct
15 Correct 1252 ms 52288 KB Output is correct
16 Correct 1255 ms 51780 KB Output is correct
17 Correct 1233 ms 50628 KB Output is correct
18 Correct 1221 ms 51796 KB Output is correct
19 Correct 127 ms 21016 KB Output is correct
20 Correct 1215 ms 50612 KB Output is correct
21 Correct 1325 ms 57144 KB Output is correct
22 Correct 178 ms 21848 KB Output is correct
23 Correct 166 ms 21056 KB Output is correct
24 Correct 174 ms 21820 KB Output is correct
25 Correct 170 ms 21772 KB Output is correct
26 Correct 183 ms 21160 KB Output is correct
27 Correct 141 ms 20452 KB Output is correct
28 Correct 176 ms 21780 KB Output is correct
29 Correct 174 ms 20644 KB Output is correct
30 Correct 192 ms 21812 KB Output is correct
31 Correct 174 ms 20500 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 8 ms 5304 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 8 ms 5212 KB Output is correct
6 Correct 8 ms 5212 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 7 ms 5084 KB Output is correct
9 Correct 9 ms 5240 KB Output is correct
10 Correct 8 ms 5240 KB Output is correct
11 Correct 8 ms 5268 KB Output is correct
12 Correct 7 ms 5212 KB Output is correct
13 Correct 8 ms 5148 KB Output is correct
14 Correct 8 ms 5244 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct
16 Correct 252 ms 20148 KB Output is correct
17 Correct 1300 ms 52256 KB Output is correct
18 Correct 65 ms 9264 KB Output is correct
19 Correct 230 ms 22200 KB Output is correct
20 Correct 1262 ms 51768 KB Output is correct
21 Correct 534 ms 32544 KB Output is correct
22 Correct 191 ms 21940 KB Output is correct
23 Correct 1304 ms 51732 KB Output is correct
24 Correct 1262 ms 51656 KB Output is correct
25 Correct 1317 ms 52656 KB Output is correct
26 Correct 234 ms 22004 KB Output is correct
27 Correct 230 ms 22108 KB Output is correct
28 Correct 237 ms 22168 KB Output is correct
29 Correct 236 ms 22112 KB Output is correct
30 Correct 227 ms 22192 KB Output is correct
31 Correct 6 ms 5088 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 6 ms 5028 KB Output is correct
34 Correct 7 ms 5032 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 6 ms 5040 KB Output is correct
37 Correct 6 ms 5096 KB Output is correct
38 Correct 6 ms 5088 KB Output is correct
39 Correct 6 ms 4984 KB Output is correct
40 Correct 7 ms 5108 KB Output is correct
41 Correct 404 ms 29416 KB Output is correct
42 Correct 1254 ms 50508 KB Output is correct
43 Correct 1259 ms 51812 KB Output is correct
44 Correct 145 ms 20732 KB Output is correct
45 Correct 1258 ms 50616 KB Output is correct
46 Correct 1244 ms 51800 KB Output is correct
47 Correct 1251 ms 51744 KB Output is correct
48 Correct 1284 ms 52032 KB Output is correct
49 Correct 1260 ms 51832 KB Output is correct
50 Correct 1257 ms 51284 KB Output is correct
51 Correct 1231 ms 51836 KB Output is correct
52 Correct 1232 ms 51784 KB Output is correct
53 Correct 1219 ms 51748 KB Output is correct
54 Correct 1242 ms 52052 KB Output is correct
55 Correct 1252 ms 52288 KB Output is correct
56 Correct 1255 ms 51780 KB Output is correct
57 Correct 1233 ms 50628 KB Output is correct
58 Correct 1221 ms 51796 KB Output is correct
59 Correct 127 ms 21016 KB Output is correct
60 Correct 1215 ms 50612 KB Output is correct
61 Correct 1325 ms 57144 KB Output is correct
62 Correct 178 ms 21848 KB Output is correct
63 Correct 166 ms 21056 KB Output is correct
64 Correct 174 ms 21820 KB Output is correct
65 Correct 170 ms 21772 KB Output is correct
66 Correct 183 ms 21160 KB Output is correct
67 Correct 141 ms 20452 KB Output is correct
68 Correct 176 ms 21780 KB Output is correct
69 Correct 174 ms 20644 KB Output is correct
70 Correct 192 ms 21812 KB Output is correct
71 Correct 174 ms 20500 KB Output is correct
72 Correct 506 ms 28332 KB Output is correct
73 Correct 1315 ms 50952 KB Output is correct
74 Correct 1293 ms 51712 KB Output is correct
75 Correct 1290 ms 52252 KB Output is correct
76 Correct 1294 ms 51604 KB Output is correct
77 Correct 1268 ms 52204 KB Output is correct
78 Correct 1308 ms 52296 KB Output is correct
79 Correct 1250 ms 52168 KB Output is correct
80 Correct 1297 ms 51688 KB Output is correct
81 Correct 1274 ms 52508 KB Output is correct
82 Correct 1292 ms 52248 KB Output is correct
83 Correct 1270 ms 52272 KB Output is correct
84 Correct 1264 ms 52388 KB Output is correct
85 Correct 1267 ms 52600 KB Output is correct
86 Correct 1266 ms 52268 KB Output is correct
87 Correct 1314 ms 53244 KB Output is correct
88 Correct 1268 ms 61612 KB Output is correct
89 Correct 191 ms 24796 KB Output is correct
90 Correct 1258 ms 61612 KB Output is correct
91 Correct 1339 ms 66208 KB Output is correct
92 Correct 232 ms 23264 KB Output is correct
93 Correct 239 ms 24740 KB Output is correct
94 Correct 223 ms 24960 KB Output is correct
95 Correct 234 ms 25076 KB Output is correct
96 Correct 300 ms 24304 KB Output is correct
97 Correct 259 ms 23188 KB Output is correct
98 Correct 234 ms 23128 KB Output is correct
99 Correct 213 ms 24312 KB Output is correct
100 Correct 237 ms 24812 KB Output is correct