oj.uz

Submission #339296

# Submission time Handle Problem Language Result Execution time Memory
339296 2020-12-25T03:29:31 Z Dilshod_Imomov Evacuation plan (IZhO18_plan) C++17
100 / 100
 1140 ms 189036 KB 
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second
 
using namespace std;
 
const int N = 2e6 + 7;
const int mod = 1e9 + 7;

vector < pair < int, int > > adj[N];
int dist[N], n, m, go, pr[N], ans[N], sz[N];
bool used[N];
set < int > st[N];

int find_set( int a ) {
    if ( a == pr[a] ) {
        return a;
    }
    return find_set(pr[a]);
}

void merge( int a, int b, int val ) {
    int x = find_set(a);
    int y = find_set(b);
    if ( x == y ) {
        return;
    }
    if ( sz[x] < sz[y] ) {
        swap( x, y );
    }
    for ( auto i: st[y] ) {
        if ( st[x].count(i) ) {
            ans[ i ] = val;
        }
        else {
            st[x].insert(i);
        }
    }
    st[y].clear();
    pr[y] = x;
    sz[x] += sz[y];
}

int32_t main() {
    speed;
    cin >> n >> m;
    for ( int i = 1; i <= m; i++ ) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back( { v, w } );
        adj[v].push_back( { u, w } );
    }
    for ( int i = 1; i <= n; i++ ) {
        dist[i] = 1e12;
        pr[i] = i;
        sz[i] = 1;
    }
    int k;
    cin >> k;
    set < pair < int, int > > q;
    for ( int i = 1; i <= k; i++ ) {
        int x;
        cin >> x;
        q.insert( { 0, x } );
        dist[x] = 0;
    }
    while ( !q.empty() ) {
        int v = q.begin()->se;
        q.erase( q.begin() );
        for ( auto pr: adj[v] ) {
            int u = pr.fi, w = pr.se;
            if ( dist[u] > dist[v] + w ) {
                q.erase( { dist[u], u } );
                dist[u] = dist[v] + w;
                q.insert( { dist[u], u } );
            }
        }
    }
    int qr;
    cin >> qr;
    for ( int i = 1; i <= qr; i++ ) {
        int x, y;
        cin >> x >> y;
        st[x].insert(i);
        st[y].insert(i);
    }
    vector < pair < int, int > > vc;
    for ( int i = 1; i <= n; i++ ) {
        vc.push_back( { dist[i], i } );
    }
    sort( vc.rbegin(), vc.rend() );
    for ( int i = 0; i < n; i++ ) {
        int x = vc[i].se;
        used[x] = 1;
        // cout << x << endl;
        for ( auto pr: adj[x] ) {
            int u = pr.fi;
            if ( used[u] ) {
                merge( x, u, dist[x] );
            }
        }
    }
    for ( int i = 1; i <= qr; i++ ) {
        cout << ans[i] << '\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 141292 KB Output is correct
2 Correct 90 ms 141548 KB Output is correct
3 Correct 89 ms 141548 KB Output is correct
4 Correct 87 ms 141292 KB Output is correct
5 Correct 88 ms 141552 KB Output is correct
6 Correct 88 ms 141548 KB Output is correct
7 Correct 88 ms 141292 KB Output is correct
8 Correct 88 ms 141516 KB Output is correct
9 Correct 90 ms 141548 KB Output is correct
10 Correct 89 ms 141568 KB Output is correct
11 Correct 92 ms 141548 KB Output is correct
12 Correct 89 ms 141548 KB Output is correct
13 Correct 89 ms 141548 KB Output is correct
14 Correct 90 ms 141676 KB Output is correct
15 Correct 89 ms 141548 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 141292 KB Output is correct
2 Correct 90 ms 141548 KB Output is correct
3 Correct 89 ms 141548 KB Output is correct
4 Correct 87 ms 141292 KB Output is correct
5 Correct 88 ms 141552 KB Output is correct
6 Correct 88 ms 141548 KB Output is correct
7 Correct 88 ms 141292 KB Output is correct
8 Correct 88 ms 141516 KB Output is correct
9 Correct 90 ms 141548 KB Output is correct
10 Correct 89 ms 141568 KB Output is correct
11 Correct 92 ms 141548 KB Output is correct
12 Correct 89 ms 141548 KB Output is correct
13 Correct 89 ms 141548 KB Output is correct
14 Correct 90 ms 141676 KB Output is correct
15 Correct 89 ms 141548 KB Output is correct
16 Correct 470 ms 163420 KB Output is correct
17 Correct 1043 ms 185956 KB Output is correct
18 Correct 136 ms 145772 KB Output is correct
19 Correct 356 ms 163676 KB Output is correct
20 Correct 1037 ms 185572 KB Output is correct
21 Correct 645 ms 170720 KB Output is correct
22 Correct 360 ms 164116 KB Output is correct
23 Correct 1032 ms 185948 KB Output is correct
24 Correct 1024 ms 185824 KB Output is correct
25 Correct 1043 ms 185564 KB Output is correct
26 Correct 348 ms 163676 KB Output is correct
27 Correct 346 ms 163676 KB Output is correct
28 Correct 346 ms 163804 KB Output is correct
29 Correct 343 ms 163676 KB Output is correct
30 Correct 351 ms 163804 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 141292 KB Output is correct
2 Correct 87 ms 141292 KB Output is correct
3 Correct 91 ms 141292 KB Output is correct
4 Correct 91 ms 141324 KB Output is correct
5 Correct 89 ms 141292 KB Output is correct
6 Correct 88 ms 141292 KB Output is correct
7 Correct 86 ms 141292 KB Output is correct
8 Correct 93 ms 141320 KB Output is correct
9 Correct 85 ms 141292 KB Output is correct
10 Correct 83 ms 141292 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 161900 KB Output is correct
2 Correct 780 ms 179108 KB Output is correct
3 Correct 753 ms 179068 KB Output is correct
4 Correct 173 ms 152160 KB Output is correct
5 Correct 766 ms 179532 KB Output is correct
6 Correct 752 ms 179396 KB Output is correct
7 Correct 750 ms 179144 KB Output is correct
8 Correct 752 ms 179732 KB Output is correct
9 Correct 758 ms 179544 KB Output is correct
10 Correct 762 ms 179080 KB Output is correct
11 Correct 765 ms 179532 KB Output is correct
12 Correct 770 ms 179276 KB Output is correct
13 Correct 760 ms 179576 KB Output is correct
14 Correct 775 ms 178844 KB Output is correct
15 Correct 788 ms 179808 KB Output is correct
16 Correct 836 ms 179896 KB Output is correct
17 Correct 741 ms 179820 KB Output is correct
18 Correct 755 ms 179216 KB Output is correct
19 Correct 179 ms 152160 KB Output is correct
20 Correct 728 ms 179692 KB Output is correct
21 Correct 604 ms 180248 KB Output is correct
22 Correct 232 ms 157916 KB Output is correct
23 Correct 191 ms 152544 KB Output is correct
24 Correct 233 ms 157880 KB Output is correct
25 Correct 241 ms 156380 KB Output is correct
26 Correct 214 ms 152932 KB Output is correct
27 Correct 171 ms 152160 KB Output is correct
28 Correct 232 ms 157916 KB Output is correct
29 Correct 171 ms 152160 KB Output is correct
30 Correct 233 ms 157916 KB Output is correct
31 Correct 172 ms 152160 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 141292 KB Output is correct
2 Correct 90 ms 141548 KB Output is correct
3 Correct 89 ms 141548 KB Output is correct
4 Correct 87 ms 141292 KB Output is correct
5 Correct 88 ms 141552 KB Output is correct
6 Correct 88 ms 141548 KB Output is correct
7 Correct 88 ms 141292 KB Output is correct
8 Correct 88 ms 141516 KB Output is correct
9 Correct 90 ms 141548 KB Output is correct
10 Correct 89 ms 141568 KB Output is correct
11 Correct 92 ms 141548 KB Output is correct
12 Correct 89 ms 141548 KB Output is correct
13 Correct 89 ms 141548 KB Output is correct
14 Correct 90 ms 141676 KB Output is correct
15 Correct 89 ms 141548 KB Output is correct
16 Correct 470 ms 163420 KB Output is correct
17 Correct 1043 ms 185956 KB Output is correct
18 Correct 136 ms 145772 KB Output is correct
19 Correct 356 ms 163676 KB Output is correct
20 Correct 1037 ms 185572 KB Output is correct
21 Correct 645 ms 170720 KB Output is correct
22 Correct 360 ms 164116 KB Output is correct
23 Correct 1032 ms 185948 KB Output is correct
24 Correct 1024 ms 185824 KB Output is correct
25 Correct 1043 ms 185564 KB Output is correct
26 Correct 348 ms 163676 KB Output is correct
27 Correct 346 ms 163676 KB Output is correct
28 Correct 346 ms 163804 KB Output is correct
29 Correct 343 ms 163676 KB Output is correct
30 Correct 351 ms 163804 KB Output is correct
31 Correct 88 ms 141292 KB Output is correct
32 Correct 87 ms 141292 KB Output is correct
33 Correct 91 ms 141292 KB Output is correct
34 Correct 91 ms 141324 KB Output is correct
35 Correct 89 ms 141292 KB Output is correct
36 Correct 88 ms 141292 KB Output is correct
37 Correct 86 ms 141292 KB Output is correct
38 Correct 93 ms 141320 KB Output is correct
39 Correct 85 ms 141292 KB Output is correct
40 Correct 83 ms 141292 KB Output is correct
41 Correct 400 ms 161900 KB Output is correct
42 Correct 780 ms 179108 KB Output is correct
43 Correct 753 ms 179068 KB Output is correct
44 Correct 173 ms 152160 KB Output is correct
45 Correct 766 ms 179532 KB Output is correct
46 Correct 752 ms 179396 KB Output is correct
47 Correct 750 ms 179144 KB Output is correct
48 Correct 752 ms 179732 KB Output is correct
49 Correct 758 ms 179544 KB Output is correct
50 Correct 762 ms 179080 KB Output is correct
51 Correct 765 ms 179532 KB Output is correct
52 Correct 770 ms 179276 KB Output is correct
53 Correct 760 ms 179576 KB Output is correct
54 Correct 775 ms 178844 KB Output is correct
55 Correct 788 ms 179808 KB Output is correct
56 Correct 836 ms 179896 KB Output is correct
57 Correct 741 ms 179820 KB Output is correct
58 Correct 755 ms 179216 KB Output is correct
59 Correct 179 ms 152160 KB Output is correct
60 Correct 728 ms 179692 KB Output is correct
61 Correct 604 ms 180248 KB Output is correct
62 Correct 232 ms 157916 KB Output is correct
63 Correct 191 ms 152544 KB Output is correct
64 Correct 233 ms 157880 KB Output is correct
65 Correct 241 ms 156380 KB Output is correct
66 Correct 214 ms 152932 KB Output is correct
67 Correct 171 ms 152160 KB Output is correct
68 Correct 232 ms 157916 KB Output is correct
69 Correct 171 ms 152160 KB Output is correct
70 Correct 233 ms 157916 KB Output is correct
71 Correct 172 ms 152160 KB Output is correct
72 Correct 679 ms 170852 KB Output is correct
73 Correct 1090 ms 188852 KB Output is correct
74 Correct 1093 ms 188900 KB Output is correct
75 Correct 1140 ms 188888 KB Output is correct
76 Correct 1079 ms 188772 KB Output is correct
77 Correct 1113 ms 188772 KB Output is correct
78 Correct 1059 ms 188800 KB Output is correct
79 Correct 1014 ms 188900 KB Output is correct
80 Correct 1042 ms 188896 KB Output is correct
81 Correct 1065 ms 188916 KB Output is correct
82 Correct 1054 ms 188996 KB Output is correct
83 Correct 1076 ms 189000 KB Output is correct
84 Correct 1061 ms 188804 KB Output is correct
85 Correct 1042 ms 188908 KB Output is correct
86 Correct 1042 ms 188808 KB Output is correct
87 Correct 1056 ms 188788 KB Output is correct
88 Correct 1046 ms 188824 KB Output is correct
89 Correct 423 ms 164188 KB Output is correct
90 Correct 1040 ms 188764 KB Output is correct
91 Correct 925 ms 189036 KB Output is correct
92 Correct 501 ms 163804 KB Output is correct
93 Correct 579 ms 164832 KB Output is correct
94 Correct 483 ms 163676 KB Output is correct
95 Correct 483 ms 163776 KB Output is correct
96 Correct 668 ms 163936 KB Output is correct
97 Correct 468 ms 163804 KB Output is correct
98 Correct 487 ms 163676 KB Output is correct
99 Correct 472 ms 163676 KB Output is correct
100 Correct 483 ms 163816 KB Output is correct