oj.uz

답안 #93337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93337 2019-01-07T15:19:37 Z muradeyn Evacuation plan (IZhO18_plan) C++14
100 / 100
 1119 ms 77980 KB 
/* Murad Eynizade */

#include <bits/stdc++.h>
#define int long long
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define SIZE 100001
#define INF INT_MAX
#define F first
#define S second
#define in(a) scanf("%d",&a);
#define outn(a) printf("%d\n",&a);
#define outs(a) printf("%d ",&a);
#define LOG 18

using namespace std;

int n , m , w , d[SIZE] , sze[SIZE] , par[SIZE] , lvl[SIZE] , p[SIZE][LOG] , q , ans , val[SIZE][LOG];

vector< pair<int,int> >v[SIZE];

vector< pair< int , pair<int,int> > >edges;

priority_queue< pair<int,int> >pq;

void init() {
    for (int i = 1;i<SIZE;i++) {
        d[i] = INF;
        sze[i] = 1;
        par[i] = i;
    }
}

void dijkstra() {
    while (!pq.empty()) {
        int u = pq.top().S;
        pq.pop();
        for (auto i : v[u]) {
            int to = i.first , we = i.second;
            if (d[to] > d[u] + we) {
                //cout<<to<<" "<<d[to]<<endl;
                //cout<<u<<" "<<d[u]<<endl;
                //cout<<we<<endl;
                //char aa;
                //cin>>aa;
                d[to] = d[u] + we;
                pq.push({-d[to] , to});
            }
        }
    }
}

int find_root(int a) {
    if (a == par[a]) return a;
    return par[a] = find_root(par[a]);
}

void dfs(int s,int pa,int l) {
    lvl[s] = l;
    p[s][0] = pa;
    val[s][0] = d[s];
    for (auto i : v[s]) {
        int to = i.F;
        if (to == pa)continue;
        dfs(to,s,l + 1);
    }
}

int lg(int x) {
    int ret = 0;
    while (x > 1) {
        ret++;
        x /= 2;
    }
    return ret;
}

int lca(int x,int y) {
    if (lvl[x] < lvl[y])swap(x,y);
    while (lvl[x] != lvl[y]) {
        int dist = lvl[x] - lvl[y];
        int lg2 = lg(dist);
        ans = min(ans , val[x][lg2]);
        x = p[x][lg2];
        ans = min(ans,d[x]);
    }
    if (x == y)return ans;
    for (int i = LOG - 1;i >= 0;i--) {
        if (p[x][i] != p[y][i]) {
            ans = min(ans , val[x][i]);
            x = p[x][i];
            ans = min(ans,d[x]);
            ans = min(ans , val[y][i]);
            y = p[y][i];
            ans = min(ans,d[y]);
        }
    }
    return min(ans,val[p[x][0]][0]);
}

int x,y;

main()
{
    FAST_READ;
    init();
    cin>>n>>m;
    while (m--) {
        cin>>x>>y>>w;
        v[x].push_back({y,w});
        v[y].push_back({x,w});
        edges.push_back({-1,{x,y}});
    }
    cin>>m;
    while (m--) {
        cin>>x;
        d[x] = 0;
        pq.push({0,x});
    }
    dijkstra();
    for (int i = 0;i<edges.size();i++) {
        edges[i].F = -min(d[edges[i].S.F] , d[edges[i].S.S]);
    }
    sort(edges.begin(),edges.end());
    int co = 0;
    //for (int i = 1;i<=n;i++)cout<<i<<" "<<d[i]<<endl;
    for (int i = 1;i<=n;i++) v[i].clear();
    for (auto i : edges) {
        int roota = find_root(i.S.F);
        int rootb = find_root(i.S.S);
        if (roota == rootb) continue;
        //cout<<i.S.F<<" "<<i.S.S<<endl;
        v[i.S.F].push_back({i.S.S,-1});
        v[i.S.S].push_back({i.S.F,-1});
        if (sze[i.S.F] < sze[i.S.S]) {
            sze[i.S.S] += sze[i.S.F];
            par[roota] = rootb;
        }
        else {
            sze[i.S.F] += sze[i.S.S];
            par[rootb] = roota;
        }
        co++;
        if (co == n - 1)break;
    }
    memset(p,-1,sizeof(p));
    dfs(1,-1,1);
    for (int j = 1;j < LOG;j++) {
        for (int i = 1;i<=n;i++) {
            if (p[i][j - 1] == -1)p[i][j] = -1;
            else p[i][j] = p[p[i][j - 1]][j - 1];
        }
    }
    for (int j = 1;j < LOG;j++) {
        for (int i = 1;i<=n;i++) {
            if (p[i][j - 1] == -1)val[i][j] = val[i][j - 1];
            else val[i][j] = min(val[i][j - 1],val[p[i][j - 1]][j - 1]);
        }
    }
    cin>>q;
    while (q--) {
        cin>>x>>y;
        ans = min(d[x],d[y]);
        cout<<lca(x,y)<<endl;
    }
    return 0;
}

Compilation message

plan.cpp:102:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
plan.cpp: In function 'int main()':
plan.cpp:120:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0;i<edges.size();i++) {
                    ~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19064 KB Output is correct
2 Correct 22 ms 19320 KB Output is correct
3 Correct 22 ms 19448 KB Output is correct
4 Correct 18 ms 19164 KB Output is correct
5 Correct 22 ms 19320 KB Output is correct
6 Correct 22 ms 19448 KB Output is correct
7 Correct 20 ms 19192 KB Output is correct
8 Correct 18 ms 19192 KB Output is correct
9 Correct 21 ms 19320 KB Output is correct
10 Correct 22 ms 19448 KB Output is correct
11 Correct 22 ms 19320 KB Output is correct
12 Correct 22 ms 19448 KB Output is correct
13 Correct 22 ms 19376 KB Output is correct
14 Correct 22 ms 19320 KB Output is correct
15 Correct 22 ms 19448 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19064 KB Output is correct
2 Correct 22 ms 19320 KB Output is correct
3 Correct 22 ms 19448 KB Output is correct
4 Correct 18 ms 19164 KB Output is correct
5 Correct 22 ms 19320 KB Output is correct
6 Correct 22 ms 19448 KB Output is correct
7 Correct 20 ms 19192 KB Output is correct
8 Correct 18 ms 19192 KB Output is correct
9 Correct 21 ms 19320 KB Output is correct
10 Correct 22 ms 19448 KB Output is correct
11 Correct 22 ms 19320 KB Output is correct
12 Correct 22 ms 19448 KB Output is correct
13 Correct 22 ms 19376 KB Output is correct
14 Correct 22 ms 19320 KB Output is correct
15 Correct 22 ms 19448 KB Output is correct
16 Correct 513 ms 39920 KB Output is correct
17 Correct 1045 ms 75876 KB Output is correct
18 Correct 92 ms 24652 KB Output is correct
19 Correct 491 ms 45204 KB Output is correct
20 Correct 1035 ms 75888 KB Output is correct
21 Correct 697 ms 52876 KB Output is correct
22 Correct 492 ms 46556 KB Output is correct
23 Correct 1038 ms 75836 KB Output is correct
24 Correct 1056 ms 75864 KB Output is correct
25 Correct 1119 ms 75928 KB Output is correct
26 Correct 495 ms 44808 KB Output is correct
27 Correct 493 ms 45016 KB Output is correct
28 Correct 494 ms 44804 KB Output is correct
29 Correct 494 ms 44976 KB Output is correct
30 Correct 501 ms 45148 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19064 KB Output is correct
2 Correct 19 ms 19192 KB Output is correct
3 Correct 19 ms 19168 KB Output is correct
4 Correct 18 ms 19192 KB Output is correct
5 Correct 19 ms 19092 KB Output is correct
6 Correct 19 ms 19064 KB Output is correct
7 Correct 19 ms 19064 KB Output is correct
8 Correct 18 ms 19064 KB Output is correct
9 Correct 18 ms 19064 KB Output is correct
10 Correct 18 ms 19196 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 344 ms 51428 KB Output is correct
2 Correct 685 ms 75364 KB Output is correct
3 Correct 717 ms 75336 KB Output is correct
4 Correct 191 ms 43940 KB Output is correct
5 Correct 740 ms 75380 KB Output is correct
6 Correct 728 ms 75356 KB Output is correct
7 Correct 709 ms 75428 KB Output is correct
8 Correct 735 ms 75384 KB Output is correct
9 Correct 716 ms 75416 KB Output is correct
10 Correct 714 ms 75412 KB Output is correct
11 Correct 694 ms 75392 KB Output is correct
12 Correct 696 ms 75504 KB Output is correct
13 Correct 689 ms 75488 KB Output is correct
14 Correct 690 ms 75544 KB Output is correct
15 Correct 692 ms 77620 KB Output is correct
16 Correct 692 ms 75388 KB Output is correct
17 Correct 697 ms 75312 KB Output is correct
18 Correct 714 ms 75388 KB Output is correct
19 Correct 204 ms 45472 KB Output is correct
20 Correct 701 ms 75456 KB Output is correct
21 Correct 638 ms 74760 KB Output is correct
22 Correct 201 ms 44816 KB Output is correct
23 Correct 188 ms 41892 KB Output is correct
24 Correct 218 ms 44700 KB Output is correct
25 Correct 203 ms 44700 KB Output is correct
26 Correct 200 ms 42404 KB Output is correct
27 Correct 191 ms 45348 KB Output is correct
28 Correct 190 ms 44700 KB Output is correct
29 Correct 195 ms 44548 KB Output is correct
30 Correct 180 ms 44752 KB Output is correct
31 Correct 198 ms 44696 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19064 KB Output is correct
2 Correct 22 ms 19320 KB Output is correct
3 Correct 22 ms 19448 KB Output is correct
4 Correct 18 ms 19164 KB Output is correct
5 Correct 22 ms 19320 KB Output is correct
6 Correct 22 ms 19448 KB Output is correct
7 Correct 20 ms 19192 KB Output is correct
8 Correct 18 ms 19192 KB Output is correct
9 Correct 21 ms 19320 KB Output is correct
10 Correct 22 ms 19448 KB Output is correct
11 Correct 22 ms 19320 KB Output is correct
12 Correct 22 ms 19448 KB Output is correct
13 Correct 22 ms 19376 KB Output is correct
14 Correct 22 ms 19320 KB Output is correct
15 Correct 22 ms 19448 KB Output is correct
16 Correct 513 ms 39920 KB Output is correct
17 Correct 1045 ms 75876 KB Output is correct
18 Correct 92 ms 24652 KB Output is correct
19 Correct 491 ms 45204 KB Output is correct
20 Correct 1035 ms 75888 KB Output is correct
21 Correct 697 ms 52876 KB Output is correct
22 Correct 492 ms 46556 KB Output is correct
23 Correct 1038 ms 75836 KB Output is correct
24 Correct 1056 ms 75864 KB Output is correct
25 Correct 1119 ms 75928 KB Output is correct
26 Correct 495 ms 44808 KB Output is correct
27 Correct 493 ms 45016 KB Output is correct
28 Correct 494 ms 44804 KB Output is correct
29 Correct 494 ms 44976 KB Output is correct
30 Correct 501 ms 45148 KB Output is correct
31 Correct 18 ms 19064 KB Output is correct
32 Correct 19 ms 19192 KB Output is correct
33 Correct 19 ms 19168 KB Output is correct
34 Correct 18 ms 19192 KB Output is correct
35 Correct 19 ms 19092 KB Output is correct
36 Correct 19 ms 19064 KB Output is correct
37 Correct 19 ms 19064 KB Output is correct
38 Correct 18 ms 19064 KB Output is correct
39 Correct 18 ms 19064 KB Output is correct
40 Correct 18 ms 19196 KB Output is correct
41 Correct 344 ms 51428 KB Output is correct
42 Correct 685 ms 75364 KB Output is correct
43 Correct 717 ms 75336 KB Output is correct
44 Correct 191 ms 43940 KB Output is correct
45 Correct 740 ms 75380 KB Output is correct
46 Correct 728 ms 75356 KB Output is correct
47 Correct 709 ms 75428 KB Output is correct
48 Correct 735 ms 75384 KB Output is correct
49 Correct 716 ms 75416 KB Output is correct
50 Correct 714 ms 75412 KB Output is correct
51 Correct 694 ms 75392 KB Output is correct
52 Correct 696 ms 75504 KB Output is correct
53 Correct 689 ms 75488 KB Output is correct
54 Correct 690 ms 75544 KB Output is correct
55 Correct 692 ms 77620 KB Output is correct
56 Correct 692 ms 75388 KB Output is correct
57 Correct 697 ms 75312 KB Output is correct
58 Correct 714 ms 75388 KB Output is correct
59 Correct 204 ms 45472 KB Output is correct
60 Correct 701 ms 75456 KB Output is correct
61 Correct 638 ms 74760 KB Output is correct
62 Correct 201 ms 44816 KB Output is correct
63 Correct 188 ms 41892 KB Output is correct
64 Correct 218 ms 44700 KB Output is correct
65 Correct 203 ms 44700 KB Output is correct
66 Correct 200 ms 42404 KB Output is correct
67 Correct 191 ms 45348 KB Output is correct
68 Correct 190 ms 44700 KB Output is correct
69 Correct 195 ms 44548 KB Output is correct
70 Correct 180 ms 44752 KB Output is correct
71 Correct 198 ms 44696 KB Output is correct
72 Correct 741 ms 52112 KB Output is correct
73 Correct 1027 ms 75932 KB Output is correct
74 Correct 1036 ms 75804 KB Output is correct
75 Correct 1046 ms 75756 KB Output is correct
76 Correct 1052 ms 75872 KB Output is correct
77 Correct 1037 ms 75772 KB Output is correct
78 Correct 1072 ms 75764 KB Output is correct
79 Correct 1053 ms 75752 KB Output is correct
80 Correct 1032 ms 75916 KB Output is correct
81 Correct 1042 ms 75888 KB Output is correct
82 Correct 1048 ms 75872 KB Output is correct
83 Correct 1020 ms 75900 KB Output is correct
84 Correct 1056 ms 75800 KB Output is correct
85 Correct 1047 ms 77980 KB Output is correct
86 Correct 1070 ms 75796 KB Output is correct
87 Correct 1053 ms 75736 KB Output is correct
88 Correct 1064 ms 75956 KB Output is correct
89 Correct 632 ms 45720 KB Output is correct
90 Correct 1067 ms 75784 KB Output is correct
91 Correct 1030 ms 75212 KB Output is correct
92 Correct 503 ms 44972 KB Output is correct
93 Correct 583 ms 42756 KB Output is correct
94 Correct 493 ms 45020 KB Output is correct
95 Correct 495 ms 45024 KB Output is correct
96 Correct 581 ms 43028 KB Output is correct
97 Correct 632 ms 44620 KB Output is correct
98 Correct 563 ms 44812 KB Output is correct
99 Correct 697 ms 45848 KB Output is correct
100 Correct 503 ms 45016 KB Output is correct