oj.uz

Submission #93562

# Submission time Handle Problem Language Result Execution time Memory
93562 2019-01-09T16:02:18 Z muradeyn Evacuation plan (IZhO18_plan) C++14
100 / 100
 1078 ms 79836 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, dd = pq.top().F; pq.pop();
        if (dd != -d[u]) continue;
        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

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19064 KB Output is correct
2 Correct 22 ms 19448 KB Output is correct
3 Correct 22 ms 19320 KB Output is correct
4 Correct 19 ms 19076 KB Output is correct
5 Correct 22 ms 19420 KB Output is correct
6 Correct 23 ms 19320 KB Output is correct
7 Correct 18 ms 19196 KB Output is correct
8 Correct 19 ms 19192 KB Output is correct
9 Correct 22 ms 19320 KB Output is correct
10 Correct 22 ms 19320 KB Output is correct
11 Correct 23 ms 19320 KB Output is correct
12 Correct 22 ms 19320 KB Output is correct
13 Correct 22 ms 19448 KB Output is correct
14 Correct 22 ms 19416 KB Output is correct
15 Correct 22 ms 19320 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19064 KB Output is correct
2 Correct 22 ms 19448 KB Output is correct
3 Correct 22 ms 19320 KB Output is correct
4 Correct 19 ms 19076 KB Output is correct
5 Correct 22 ms 19420 KB Output is correct
6 Correct 23 ms 19320 KB Output is correct
7 Correct 18 ms 19196 KB Output is correct
8 Correct 19 ms 19192 KB Output is correct
9 Correct 22 ms 19320 KB Output is correct
10 Correct 22 ms 19320 KB Output is correct
11 Correct 23 ms 19320 KB Output is correct
12 Correct 22 ms 19320 KB Output is correct
13 Correct 22 ms 19448 KB Output is correct
14 Correct 22 ms 19416 KB Output is correct
15 Correct 22 ms 19320 KB Output is correct
16 Correct 508 ms 39872 KB Output is correct
17 Correct 1012 ms 75804 KB Output is correct
18 Correct 90 ms 24616 KB Output is correct
19 Correct 485 ms 45212 KB Output is correct
20 Correct 1018 ms 75828 KB Output is correct
21 Correct 694 ms 53016 KB Output is correct
22 Correct 492 ms 46640 KB Output is correct
23 Correct 1029 ms 75744 KB Output is correct
24 Correct 1024 ms 75744 KB Output is correct
25 Correct 1041 ms 75828 KB Output is correct
26 Correct 515 ms 44904 KB Output is correct
27 Correct 495 ms 44980 KB Output is correct
28 Correct 497 ms 44820 KB Output is correct
29 Correct 497 ms 45148 KB Output is correct
30 Correct 503 ms 45032 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 18 ms 19164 KB Output is correct
3 Correct 19 ms 19064 KB Output is correct
4 Correct 18 ms 19064 KB Output is correct
5 Correct 18 ms 19144 KB Output is correct
6 Correct 18 ms 19064 KB Output is correct
7 Correct 18 ms 19064 KB Output is correct
8 Correct 18 ms 19064 KB Output is correct
9 Correct 18 ms 19152 KB Output is correct
10 Correct 18 ms 19064 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 51508 KB Output is correct
2 Correct 669 ms 75348 KB Output is correct
3 Correct 675 ms 75472 KB Output is correct
4 Correct 188 ms 44064 KB Output is correct
5 Correct 666 ms 75340 KB Output is correct
6 Correct 680 ms 75316 KB Output is correct
7 Correct 690 ms 75404 KB Output is correct
8 Correct 668 ms 75564 KB Output is correct
9 Correct 693 ms 75408 KB Output is correct
10 Correct 671 ms 75348 KB Output is correct
11 Correct 666 ms 75456 KB Output is correct
12 Correct 670 ms 75396 KB Output is correct
13 Correct 674 ms 75420 KB Output is correct
14 Correct 680 ms 75420 KB Output is correct
15 Correct 679 ms 77512 KB Output is correct
16 Correct 655 ms 75372 KB Output is correct
17 Correct 677 ms 75400 KB Output is correct
18 Correct 682 ms 75560 KB Output is correct
19 Correct 182 ms 45476 KB Output is correct
20 Correct 681 ms 75440 KB Output is correct
21 Correct 664 ms 74804 KB Output is correct
22 Correct 187 ms 44628 KB Output is correct
23 Correct 206 ms 42020 KB Output is correct
24 Correct 188 ms 44664 KB Output is correct
25 Correct 180 ms 44632 KB Output is correct
26 Correct 201 ms 42404 KB Output is correct
27 Correct 193 ms 45340 KB Output is correct
28 Correct 181 ms 44780 KB Output is correct
29 Correct 201 ms 44680 KB Output is correct
30 Correct 196 ms 44632 KB Output is correct
31 Correct 183 ms 44584 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19064 KB Output is correct
2 Correct 22 ms 19448 KB Output is correct
3 Correct 22 ms 19320 KB Output is correct
4 Correct 19 ms 19076 KB Output is correct
5 Correct 22 ms 19420 KB Output is correct
6 Correct 23 ms 19320 KB Output is correct
7 Correct 18 ms 19196 KB Output is correct
8 Correct 19 ms 19192 KB Output is correct
9 Correct 22 ms 19320 KB Output is correct
10 Correct 22 ms 19320 KB Output is correct
11 Correct 23 ms 19320 KB Output is correct
12 Correct 22 ms 19320 KB Output is correct
13 Correct 22 ms 19448 KB Output is correct
14 Correct 22 ms 19416 KB Output is correct
15 Correct 22 ms 19320 KB Output is correct
16 Correct 508 ms 39872 KB Output is correct
17 Correct 1012 ms 75804 KB Output is correct
18 Correct 90 ms 24616 KB Output is correct
19 Correct 485 ms 45212 KB Output is correct
20 Correct 1018 ms 75828 KB Output is correct
21 Correct 694 ms 53016 KB Output is correct
22 Correct 492 ms 46640 KB Output is correct
23 Correct 1029 ms 75744 KB Output is correct
24 Correct 1024 ms 75744 KB Output is correct
25 Correct 1041 ms 75828 KB Output is correct
26 Correct 515 ms 44904 KB Output is correct
27 Correct 495 ms 44980 KB Output is correct
28 Correct 497 ms 44820 KB Output is correct
29 Correct 497 ms 45148 KB Output is correct
30 Correct 503 ms 45032 KB Output is correct
31 Correct 19 ms 19192 KB Output is correct
32 Correct 18 ms 19164 KB Output is correct
33 Correct 19 ms 19064 KB Output is correct
34 Correct 18 ms 19064 KB Output is correct
35 Correct 18 ms 19144 KB Output is correct
36 Correct 18 ms 19064 KB Output is correct
37 Correct 18 ms 19064 KB Output is correct
38 Correct 18 ms 19064 KB Output is correct
39 Correct 18 ms 19152 KB Output is correct
40 Correct 18 ms 19064 KB Output is correct
41 Correct 340 ms 51508 KB Output is correct
42 Correct 669 ms 75348 KB Output is correct
43 Correct 675 ms 75472 KB Output is correct
44 Correct 188 ms 44064 KB Output is correct
45 Correct 666 ms 75340 KB Output is correct
46 Correct 680 ms 75316 KB Output is correct
47 Correct 690 ms 75404 KB Output is correct
48 Correct 668 ms 75564 KB Output is correct
49 Correct 693 ms 75408 KB Output is correct
50 Correct 671 ms 75348 KB Output is correct
51 Correct 666 ms 75456 KB Output is correct
52 Correct 670 ms 75396 KB Output is correct
53 Correct 674 ms 75420 KB Output is correct
54 Correct 680 ms 75420 KB Output is correct
55 Correct 679 ms 77512 KB Output is correct
56 Correct 655 ms 75372 KB Output is correct
57 Correct 677 ms 75400 KB Output is correct
58 Correct 682 ms 75560 KB Output is correct
59 Correct 182 ms 45476 KB Output is correct
60 Correct 681 ms 75440 KB Output is correct
61 Correct 664 ms 74804 KB Output is correct
62 Correct 187 ms 44628 KB Output is correct
63 Correct 206 ms 42020 KB Output is correct
64 Correct 188 ms 44664 KB Output is correct
65 Correct 180 ms 44632 KB Output is correct
66 Correct 201 ms 42404 KB Output is correct
67 Correct 193 ms 45340 KB Output is correct
68 Correct 181 ms 44780 KB Output is correct
69 Correct 201 ms 44680 KB Output is correct
70 Correct 196 ms 44632 KB Output is correct
71 Correct 183 ms 44584 KB Output is correct
72 Correct 710 ms 52076 KB Output is correct
73 Correct 1044 ms 75824 KB Output is correct
74 Correct 1053 ms 75836 KB Output is correct
75 Correct 1041 ms 75960 KB Output is correct
76 Correct 1014 ms 75716 KB Output is correct
77 Correct 1033 ms 75844 KB Output is correct
78 Correct 1078 ms 75760 KB Output is correct
79 Correct 1072 ms 75876 KB Output is correct
80 Correct 1012 ms 75880 KB Output is correct
81 Correct 1010 ms 75808 KB Output is correct
82 Correct 1008 ms 75776 KB Output is correct
83 Correct 1040 ms 75748 KB Output is correct
84 Correct 1008 ms 75760 KB Output is correct
85 Correct 1020 ms 79836 KB Output is correct
86 Correct 1022 ms 79028 KB Output is correct
87 Correct 1032 ms 79296 KB Output is correct
88 Correct 1022 ms 79300 KB Output is correct
89 Correct 626 ms 47236 KB Output is correct
90 Correct 1053 ms 79200 KB Output is correct
91 Correct 1012 ms 78440 KB Output is correct
92 Correct 490 ms 46708 KB Output is correct
93 Correct 573 ms 44416 KB Output is correct
94 Correct 497 ms 46768 KB Output is correct
95 Correct 513 ms 46796 KB Output is correct
96 Correct 571 ms 44620 KB Output is correct
97 Correct 616 ms 46584 KB Output is correct
98 Correct 496 ms 46652 KB Output is correct
99 Correct 611 ms 47588 KB Output is correct
100 Correct 487 ms 46736 KB Output is correct