oj.uz

Submission #167426

# Submission time Handle Problem Language Result Execution time Memory
167426 2019-12-08T14:20:28 Z muhammad_hokimiyon Evacuation plan (IZhO18_plan) C++14
100 / 100
 863 ms 43080 KB 
#include <bits/stdc++.h>

//#pragma GCC optimize("Ofast")

#define fi first
#define se second
#define ll long long

using namespace std;

const int N = 1e5 + 7;
const int mod = 1e9 + 7;

int n,m,q,k;
int l = 1;
int cnt;
int a[N];
int d[N];
int p[N];
int tin[N];
int dep[N];
int tout[N];
bool used[N];
vector < int > g[N];
vector < vector < int > > up;
vector < pair < int , int > > v[N];

int get( int x )
{
    return (x == p[x] ? x : p[x] = get(p[x]));
}

void dfs( int x , int p )
{
    tin[x] = ++cnt;
    up[x][0] = p;
    for( int i = 1; i <= l; i++ ){
        up[x][i] = up[up[x][i - 1]][i - 1];
    }
    for( auto y : g[x] ){
        if( y != p ){
            dep[y] = dep[x] + 1;
            dfs(y , x);
        }
    }
    tout[x] = cnt;
}

bool upper( int x , int y )
{
    return (tin[x] <= tin[y] && tout[x] >= tout[y]);
}

int lca( int x , int y )
{
    if( upper(x , y) )return x;
    if( upper(y , x) )return y;
    for( int i = l; i >= 0; i-- ){
        if( !upper(up[x][i] , y) ){
            x = up[x][i];
        }
    }
    return up[x][0];
}

void solve()
{
    cin >> n >> m;
    while( (1 << l) <= n )l++;
    up.resize(n + 10);
    for( int i = 0; i <= n; i++ ){
        up[i].resize(l + 10);
        p[i] = i;
        d[i] = 1e9;
    }
    for( int i = 1; i <= m; i++ ){
        int x,y,z;
        cin >> x >> y >> z;
        v[x].push_back({y , z});
        v[y].push_back({x , z});
    }
    set < pair < int , int > > s;
    cin >> k;
    for( int i = 1; i <= k; i++ ){
        int x;
        cin >> x;
        d[x] = 0;
        s.insert({0 , x});
    }
    while( !s.empty() ){
        auto x = s.begin()->se;
        s.erase(s.begin());
        for( auto y : v[x] ){
            if( d[x] + y.se < d[y.fi] ){
                s.erase({d[y.fi] , y.fi});
                d[y.fi] = d[x] + y.se;
                s.insert({d[y.fi] , y.fi});
            }
        }
    }
    vector < pair < int , int > > vv;
    for( int i = 1; i <= n; i++ ){
        vv.push_back({d[i] , i});
    }
    int start = 0;
    sort( vv.rbegin() , vv.rend() );
    for( auto y : vv ){
        used[y.se] = true;
        for( auto z : v[y.se] ){
            int xx = get(z.fi);
            int yy = y.se;
            if( used[z.fi] && xx != yy ){
                p[xx] = yy;
                g[yy].push_back(xx);
                g[xx].push_back(yy);
            }
        }
    }
    dfs(vv[n - 1].se , vv[n - 1].se);
    cin >> q;
    for( int i = 1; i <= q; i++ ){
        int x,y;
        cin >> x >> y;
        int c = lca(x , y);
        cout << d[c] << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );

    int t = 1;//cin >> t;
    while( t-- ){
        solve();
    }
}

Compilation message

plan.cpp: In function 'void solve()':
plan.cpp:105:9: warning: unused variable 'start' [-Wunused-variable]
     int start = 0;
         ^~~~~

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 5368 KB Output is correct
3 Correct 7 ms 5240 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 7 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 7 ms 5240 KB Output is correct
11 Correct 7 ms 5368 KB Output is correct
12 Correct 7 ms 5236 KB Output is correct
13 Correct 8 ms 5368 KB Output is correct
14 Correct 7 ms 5252 KB Output is correct
15 Correct 7 ms 5340 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 5368 KB Output is correct
3 Correct 7 ms 5240 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 7 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 7 ms 5240 KB Output is correct
11 Correct 7 ms 5368 KB Output is correct
12 Correct 7 ms 5236 KB Output is correct
13 Correct 8 ms 5368 KB Output is correct
14 Correct 7 ms 5252 KB Output is correct
15 Correct 7 ms 5340 KB Output is correct
16 Correct 266 ms 26268 KB Output is correct
17 Correct 810 ms 42960 KB Output is correct
18 Correct 51 ms 9080 KB Output is correct
19 Correct 232 ms 30664 KB Output is correct
20 Correct 742 ms 42916 KB Output is correct
21 Correct 378 ms 34608 KB Output is correct
22 Correct 228 ms 34668 KB Output is correct
23 Correct 824 ms 42820 KB Output is correct
24 Correct 749 ms 42824 KB Output is correct
25 Correct 807 ms 42784 KB Output is correct
26 Correct 234 ms 30424 KB Output is correct
27 Correct 234 ms 30588 KB Output is correct
28 Correct 236 ms 30400 KB Output is correct
29 Correct 280 ms 30488 KB Output is correct
30 Correct 232 ms 30744 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 34428 KB Output is correct
2 Correct 755 ms 42460 KB Output is correct
3 Correct 753 ms 42368 KB Output is correct
4 Correct 198 ms 31340 KB Output is correct
5 Correct 784 ms 42404 KB Output is correct
6 Correct 773 ms 42504 KB Output is correct
7 Correct 815 ms 42452 KB Output is correct
8 Correct 739 ms 42388 KB Output is correct
9 Correct 709 ms 42444 KB Output is correct
10 Correct 712 ms 42508 KB Output is correct
11 Correct 731 ms 42368 KB Output is correct
12 Correct 718 ms 42452 KB Output is correct
13 Correct 726 ms 42444 KB Output is correct
14 Correct 747 ms 42460 KB Output is correct
15 Correct 756 ms 42420 KB Output is correct
16 Correct 779 ms 42488 KB Output is correct
17 Correct 853 ms 42544 KB Output is correct
18 Correct 753 ms 42452 KB Output is correct
19 Correct 203 ms 33712 KB Output is correct
20 Correct 726 ms 42532 KB Output is correct
21 Correct 559 ms 42440 KB Output is correct
22 Correct 204 ms 30164 KB Output is correct
23 Correct 180 ms 30564 KB Output is correct
24 Correct 200 ms 30368 KB Output is correct
25 Correct 205 ms 30244 KB Output is correct
26 Correct 208 ms 29720 KB Output is correct
27 Correct 192 ms 31304 KB Output is correct
28 Correct 200 ms 30412 KB Output is correct
29 Correct 186 ms 31340 KB Output is correct
30 Correct 234 ms 30300 KB Output is correct
31 Correct 189 ms 31460 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 5368 KB Output is correct
3 Correct 7 ms 5240 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 7 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 7 ms 5240 KB Output is correct
11 Correct 7 ms 5368 KB Output is correct
12 Correct 7 ms 5236 KB Output is correct
13 Correct 8 ms 5368 KB Output is correct
14 Correct 7 ms 5252 KB Output is correct
15 Correct 7 ms 5340 KB Output is correct
16 Correct 266 ms 26268 KB Output is correct
17 Correct 810 ms 42960 KB Output is correct
18 Correct 51 ms 9080 KB Output is correct
19 Correct 232 ms 30664 KB Output is correct
20 Correct 742 ms 42916 KB Output is correct
21 Correct 378 ms 34608 KB Output is correct
22 Correct 228 ms 34668 KB Output is correct
23 Correct 824 ms 42820 KB Output is correct
24 Correct 749 ms 42824 KB Output is correct
25 Correct 807 ms 42784 KB Output is correct
26 Correct 234 ms 30424 KB Output is correct
27 Correct 234 ms 30588 KB Output is correct
28 Correct 236 ms 30400 KB Output is correct
29 Correct 280 ms 30488 KB Output is correct
30 Correct 232 ms 30744 KB Output is correct
31 Correct 6 ms 4984 KB Output is correct
32 Correct 6 ms 4996 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 4984 KB Output is correct
37 Correct 6 ms 4984 KB Output is correct
38 Correct 6 ms 4984 KB Output is correct
39 Correct 6 ms 4984 KB Output is correct
40 Correct 6 ms 5112 KB Output is correct
41 Correct 395 ms 34428 KB Output is correct
42 Correct 755 ms 42460 KB Output is correct
43 Correct 753 ms 42368 KB Output is correct
44 Correct 198 ms 31340 KB Output is correct
45 Correct 784 ms 42404 KB Output is correct
46 Correct 773 ms 42504 KB Output is correct
47 Correct 815 ms 42452 KB Output is correct
48 Correct 739 ms 42388 KB Output is correct
49 Correct 709 ms 42444 KB Output is correct
50 Correct 712 ms 42508 KB Output is correct
51 Correct 731 ms 42368 KB Output is correct
52 Correct 718 ms 42452 KB Output is correct
53 Correct 726 ms 42444 KB Output is correct
54 Correct 747 ms 42460 KB Output is correct
55 Correct 756 ms 42420 KB Output is correct
56 Correct 779 ms 42488 KB Output is correct
57 Correct 853 ms 42544 KB Output is correct
58 Correct 753 ms 42452 KB Output is correct
59 Correct 203 ms 33712 KB Output is correct
60 Correct 726 ms 42532 KB Output is correct
61 Correct 559 ms 42440 KB Output is correct
62 Correct 204 ms 30164 KB Output is correct
63 Correct 180 ms 30564 KB Output is correct
64 Correct 200 ms 30368 KB Output is correct
65 Correct 205 ms 30244 KB Output is correct
66 Correct 208 ms 29720 KB Output is correct
67 Correct 192 ms 31304 KB Output is correct
68 Correct 200 ms 30412 KB Output is correct
69 Correct 186 ms 31340 KB Output is correct
70 Correct 234 ms 30300 KB Output is correct
71 Correct 189 ms 31460 KB Output is correct
72 Correct 448 ms 35044 KB Output is correct
73 Correct 863 ms 42836 KB Output is correct
74 Correct 806 ms 42840 KB Output is correct
75 Correct 799 ms 42888 KB Output is correct
76 Correct 776 ms 42888 KB Output is correct
77 Correct 762 ms 42844 KB Output is correct
78 Correct 760 ms 43080 KB Output is correct
79 Correct 753 ms 42796 KB Output is correct
80 Correct 748 ms 42880 KB Output is correct
81 Correct 768 ms 42856 KB Output is correct
82 Correct 762 ms 43052 KB Output is correct
83 Correct 740 ms 42776 KB Output is correct
84 Correct 752 ms 42840 KB Output is correct
85 Correct 784 ms 42708 KB Output is correct
86 Correct 766 ms 42920 KB Output is correct
87 Correct 729 ms 42812 KB Output is correct
88 Correct 768 ms 42928 KB Output is correct
89 Correct 227 ms 34572 KB Output is correct
90 Correct 742 ms 42928 KB Output is correct
91 Correct 619 ms 42556 KB Output is correct
92 Correct 245 ms 30488 KB Output is correct
93 Correct 259 ms 31316 KB Output is correct
94 Correct 239 ms 30580 KB Output is correct
95 Correct 262 ms 30532 KB Output is correct
96 Correct 257 ms 30032 KB Output is correct
97 Correct 259 ms 31856 KB Output is correct
98 Correct 254 ms 30556 KB Output is correct
99 Correct 254 ms 31924 KB Output is correct
100 Correct 253 ms 30492 KB Output is correct