oj.uz

답안 #184109

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
184109 2020-01-10T19:04:54 Z rzbt Evacuation plan (IZhO18_plan) C++14
100 / 100
 1515 ms 65700 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5212 KB Output is correct
3 Correct 8 ms 5212 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5012 KB Output is correct
8 Correct 7 ms 5080 KB Output is correct
9 Correct 8 ms 5220 KB Output is correct
10 Correct 8 ms 5204 KB Output is correct
11 Correct 8 ms 5268 KB Output is correct
12 Correct 8 ms 5212 KB Output is correct
13 Correct 8 ms 5212 KB Output is correct
14 Correct 8 ms 5268 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5212 KB Output is correct
3 Correct 8 ms 5212 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5012 KB Output is correct
8 Correct 7 ms 5080 KB Output is correct
9 Correct 8 ms 5220 KB Output is correct
10 Correct 8 ms 5204 KB Output is correct
11 Correct 8 ms 5268 KB Output is correct
12 Correct 8 ms 5212 KB Output is correct
13 Correct 8 ms 5212 KB Output is correct
14 Correct 8 ms 5268 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct
16 Correct 255 ms 23012 KB Output is correct
17 Correct 1318 ms 61712 KB Output is correct
18 Correct 72 ms 9944 KB Output is correct
19 Correct 228 ms 25156 KB Output is correct
20 Correct 1295 ms 61124 KB Output is correct
21 Correct 528 ms 37324 KB Output is correct
22 Correct 200 ms 24724 KB Output is correct
23 Correct 1306 ms 61028 KB Output is correct
24 Correct 1333 ms 61036 KB Output is correct
25 Correct 1349 ms 62128 KB Output is correct
26 Correct 229 ms 24996 KB Output is correct
27 Correct 236 ms 25096 KB Output is correct
28 Correct 240 ms 24968 KB Output is correct
29 Correct 234 ms 25004 KB Output is correct
30 Correct 238 ms 25180 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5064 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 5068 KB Output is correct
4 Correct 7 ms 5068 KB Output is correct
5 Correct 6 ms 5064 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5076 KB Output is correct
8 Correct 7 ms 5100 KB Output is correct
9 Correct 6 ms 5084 KB Output is correct
10 Correct 6 ms 5084 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 32816 KB Output is correct
2 Correct 1243 ms 58780 KB Output is correct
3 Correct 1263 ms 59976 KB Output is correct
4 Correct 146 ms 22308 KB Output is correct
5 Correct 1241 ms 58676 KB Output is correct
6 Correct 1244 ms 59928 KB Output is correct
7 Correct 1225 ms 59912 KB Output is correct
8 Correct 1247 ms 60228 KB Output is correct
9 Correct 1285 ms 59932 KB Output is correct
10 Correct 1226 ms 59448 KB Output is correct
11 Correct 1232 ms 60032 KB Output is correct
12 Correct 1256 ms 60020 KB Output is correct
13 Correct 1259 ms 59912 KB Output is correct
14 Correct 1265 ms 60132 KB Output is correct
15 Correct 1254 ms 60472 KB Output is correct
16 Correct 1247 ms 60064 KB Output is correct
17 Correct 1229 ms 58752 KB Output is correct
18 Correct 1196 ms 59904 KB Output is correct
19 Correct 132 ms 22712 KB Output is correct
20 Correct 1218 ms 58740 KB Output is correct
21 Correct 1281 ms 65700 KB Output is correct
22 Correct 171 ms 23508 KB Output is correct
23 Correct 167 ms 22808 KB Output is correct
24 Correct 179 ms 23628 KB Output is correct
25 Correct 175 ms 23480 KB Output is correct
26 Correct 182 ms 22744 KB Output is correct
27 Correct 147 ms 22108 KB Output is correct
28 Correct 181 ms 23488 KB Output is correct
29 Correct 152 ms 22236 KB Output is correct
30 Correct 176 ms 23520 KB Output is correct
31 Correct 155 ms 22040 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5212 KB Output is correct
3 Correct 8 ms 5212 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5012 KB Output is correct
8 Correct 7 ms 5080 KB Output is correct
9 Correct 8 ms 5220 KB Output is correct
10 Correct 8 ms 5204 KB Output is correct
11 Correct 8 ms 5268 KB Output is correct
12 Correct 8 ms 5212 KB Output is correct
13 Correct 8 ms 5212 KB Output is correct
14 Correct 8 ms 5268 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct
16 Correct 255 ms 23012 KB Output is correct
17 Correct 1318 ms 61712 KB Output is correct
18 Correct 72 ms 9944 KB Output is correct
19 Correct 228 ms 25156 KB Output is correct
20 Correct 1295 ms 61124 KB Output is correct
21 Correct 528 ms 37324 KB Output is correct
22 Correct 200 ms 24724 KB Output is correct
23 Correct 1306 ms 61028 KB Output is correct
24 Correct 1333 ms 61036 KB Output is correct
25 Correct 1349 ms 62128 KB Output is correct
26 Correct 229 ms 24996 KB Output is correct
27 Correct 236 ms 25096 KB Output is correct
28 Correct 240 ms 24968 KB Output is correct
29 Correct 234 ms 25004 KB Output is correct
30 Correct 238 ms 25180 KB Output is correct
31 Correct 7 ms 5064 KB Output is correct
32 Correct 6 ms 4984 KB Output is correct
33 Correct 7 ms 5068 KB Output is correct
34 Correct 7 ms 5068 KB Output is correct
35 Correct 6 ms 5064 KB Output is correct
36 Correct 6 ms 4984 KB Output is correct
37 Correct 7 ms 5076 KB Output is correct
38 Correct 7 ms 5100 KB Output is correct
39 Correct 6 ms 5084 KB Output is correct
40 Correct 6 ms 5084 KB Output is correct
41 Correct 409 ms 32816 KB Output is correct
42 Correct 1243 ms 58780 KB Output is correct
43 Correct 1263 ms 59976 KB Output is correct
44 Correct 146 ms 22308 KB Output is correct
45 Correct 1241 ms 58676 KB Output is correct
46 Correct 1244 ms 59928 KB Output is correct
47 Correct 1225 ms 59912 KB Output is correct
48 Correct 1247 ms 60228 KB Output is correct
49 Correct 1285 ms 59932 KB Output is correct
50 Correct 1226 ms 59448 KB Output is correct
51 Correct 1232 ms 60032 KB Output is correct
52 Correct 1256 ms 60020 KB Output is correct
53 Correct 1259 ms 59912 KB Output is correct
54 Correct 1265 ms 60132 KB Output is correct
55 Correct 1254 ms 60472 KB Output is correct
56 Correct 1247 ms 60064 KB Output is correct
57 Correct 1229 ms 58752 KB Output is correct
58 Correct 1196 ms 59904 KB Output is correct
59 Correct 132 ms 22712 KB Output is correct
60 Correct 1218 ms 58740 KB Output is correct
61 Correct 1281 ms 65700 KB Output is correct
62 Correct 171 ms 23508 KB Output is correct
63 Correct 167 ms 22808 KB Output is correct
64 Correct 179 ms 23628 KB Output is correct
65 Correct 175 ms 23480 KB Output is correct
66 Correct 182 ms 22744 KB Output is correct
67 Correct 147 ms 22108 KB Output is correct
68 Correct 181 ms 23488 KB Output is correct
69 Correct 152 ms 22236 KB Output is correct
70 Correct 176 ms 23520 KB Output is correct
71 Correct 155 ms 22040 KB Output is correct
72 Correct 493 ms 32892 KB Output is correct
73 Correct 1311 ms 60400 KB Output is correct
74 Correct 1318 ms 61052 KB Output is correct
75 Correct 1335 ms 61604 KB Output is correct
76 Correct 1335 ms 61096 KB Output is correct
77 Correct 1326 ms 61680 KB Output is correct
78 Correct 1301 ms 61692 KB Output is correct
79 Correct 1306 ms 61636 KB Output is correct
80 Correct 1250 ms 61136 KB Output is correct
81 Correct 1280 ms 61964 KB Output is correct
82 Correct 1266 ms 61560 KB Output is correct
83 Correct 1258 ms 61600 KB Output is correct
84 Correct 1447 ms 61716 KB Output is correct
85 Correct 1310 ms 62124 KB Output is correct
86 Correct 1271 ms 61600 KB Output is correct
87 Correct 1515 ms 60540 KB Output is correct
88 Correct 1239 ms 52248 KB Output is correct
89 Correct 190 ms 21936 KB Output is correct
90 Correct 1245 ms 52268 KB Output is correct
91 Correct 1323 ms 58364 KB Output is correct
92 Correct 251 ms 23928 KB Output is correct
93 Correct 236 ms 21868 KB Output is correct
94 Correct 259 ms 22112 KB Output is correct
95 Correct 235 ms 22224 KB Output is correct
96 Correct 260 ms 21448 KB Output is correct
97 Correct 210 ms 22496 KB Output is correct
98 Correct 267 ms 23872 KB Output is correct
99 Correct 214 ms 21320 KB Output is correct
100 Correct 235 ms 22072 KB Output is correct