oj.uz

Submission #172691

# Submission time Handle Problem Language Result Execution time Memory
172691 2020-01-02T11:46:38 Z muhammad_hokimiyon Evacuation plan (IZhO18_plan) C++14
100 / 100
 1055 ms 60176 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 = 2e5 + 7;
const int M = 23;
const int mod = 998244353;

int n,m,k,q;
int a[N];
int p[N];
int d[N];
int ans[N];
bool used[N];
set < int > ss[N];
vector < pair < int , int > > v[N];

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

void meg( int x , int y , int z )
{
    x = get(x);
    y = get(y);
    if( x == y )return;
    if( (int)ss[x].size() > (int)ss[y].size() )swap(x , y);
    auto it = ss[x].begin();
    while( it != ss[x].end() ){
        int xx = *it;
        if( ss[y].find(xx) != ss[y].end() ){
            ans[xx] = z;
            ss[y].erase(xx);
        }else{
            ss[y].insert(xx);
        }
        it++;
    }
    p[x] = y;
}

void solve1()
{
    cin >> n >> m;
    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});
    }
    for( int i = 1; i <= n; i++ ){
        p[i] = i;
        d[i] = 1e9;
    }
    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();
        s.erase(s.begin());
        for( auto y : v[x.se] ){
            if( y.se + d[x.se] < d[y.fi] ){
                s.erase({d[y.fi] , y.fi});
                d[y.fi] = y.se + d[x.se];
                s.insert({d[y.fi] , y.fi});
            }
        }
    }
    vector < pair < int , int > > f;
    for( int i = 1; i <= n; i++ ){
        f.push_back({d[i] , i});
    }
    sort( f.rbegin() , f.rend() );
    cin >> q;
    for( int i = 1; i <= q; i++ ){
        int x,y;
        cin >> x >> y;
        ss[x].insert(i);
        ss[y].insert(i);
    }
    for( int i = 0; i < (int)f.size(); i++ ){
        used[f[i].se] = true;
        for( auto y : v[f[i].se] ){
            if( used[y.fi] ){
                meg(y.fi , f[i].se , f[i].fi);
            }
        }
    }
    for( int i = 1; i <= q; i++ ){
        cout << ans[i] << "\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 cghf = 1;//cin >> cghf;
    while( cghf-- ){
        solve1();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14584 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 17 ms 14584 KB Output is correct
6 Correct 17 ms 14584 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 16 ms 14584 KB Output is correct
10 Correct 16 ms 14584 KB Output is correct
11 Correct 17 ms 14712 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 16 ms 14588 KB Output is correct
14 Correct 17 ms 14712 KB Output is correct
15 Correct 17 ms 14712 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14584 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 17 ms 14584 KB Output is correct
6 Correct 17 ms 14584 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 16 ms 14584 KB Output is correct
10 Correct 16 ms 14584 KB Output is correct
11 Correct 17 ms 14712 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 16 ms 14588 KB Output is correct
14 Correct 17 ms 14712 KB Output is correct
15 Correct 17 ms 14712 KB Output is correct
16 Correct 349 ms 33188 KB Output is correct
17 Correct 933 ms 42924 KB Output is correct
18 Correct 67 ms 17968 KB Output is correct
19 Correct 338 ms 33272 KB Output is correct
20 Correct 1055 ms 42828 KB Output is correct
21 Correct 545 ms 39896 KB Output is correct
22 Correct 230 ms 32872 KB Output is correct
23 Correct 957 ms 43044 KB Output is correct
24 Correct 940 ms 42904 KB Output is correct
25 Correct 928 ms 42840 KB Output is correct
26 Correct 342 ms 32948 KB Output is correct
27 Correct 335 ms 33088 KB Output is correct
28 Correct 338 ms 32928 KB Output is correct
29 Correct 355 ms 33104 KB Output is correct
30 Correct 360 ms 33280 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 14492 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 15 ms 14584 KB Output is correct
4 Correct 16 ms 14456 KB Output is correct
5 Correct 16 ms 14584 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 26788 KB Output is correct
2 Correct 665 ms 32524 KB Output is correct
3 Correct 678 ms 32652 KB Output is correct
4 Correct 116 ms 21104 KB Output is correct
5 Correct 670 ms 32600 KB Output is correct
6 Correct 650 ms 32704 KB Output is correct
7 Correct 660 ms 32484 KB Output is correct
8 Correct 687 ms 32584 KB Output is correct
9 Correct 685 ms 32452 KB Output is correct
10 Correct 696 ms 32756 KB Output is correct
11 Correct 637 ms 32504 KB Output is correct
12 Correct 654 ms 32504 KB Output is correct
13 Correct 680 ms 32632 KB Output is correct
14 Correct 698 ms 32760 KB Output is correct
15 Correct 682 ms 32604 KB Output is correct
16 Correct 683 ms 32632 KB Output is correct
17 Correct 666 ms 32860 KB Output is correct
18 Correct 678 ms 32764 KB Output is correct
19 Correct 115 ms 21304 KB Output is correct
20 Correct 683 ms 32736 KB Output is correct
21 Correct 585 ms 33244 KB Output is correct
22 Correct 160 ms 25424 KB Output is correct
23 Correct 129 ms 21744 KB Output is correct
24 Correct 159 ms 25452 KB Output is correct
25 Correct 164 ms 25636 KB Output is correct
26 Correct 145 ms 21696 KB Output is correct
27 Correct 117 ms 21212 KB Output is correct
28 Correct 168 ms 25604 KB Output is correct
29 Correct 116 ms 21104 KB Output is correct
30 Correct 156 ms 25528 KB Output is correct
31 Correct 117 ms 21188 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14584 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 17 ms 14584 KB Output is correct
6 Correct 17 ms 14584 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 16 ms 14584 KB Output is correct
10 Correct 16 ms 14584 KB Output is correct
11 Correct 17 ms 14712 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 16 ms 14588 KB Output is correct
14 Correct 17 ms 14712 KB Output is correct
15 Correct 17 ms 14712 KB Output is correct
16 Correct 349 ms 33188 KB Output is correct
17 Correct 933 ms 42924 KB Output is correct
18 Correct 67 ms 17968 KB Output is correct
19 Correct 338 ms 33272 KB Output is correct
20 Correct 1055 ms 42828 KB Output is correct
21 Correct 545 ms 39896 KB Output is correct
22 Correct 230 ms 32872 KB Output is correct
23 Correct 957 ms 43044 KB Output is correct
24 Correct 940 ms 42904 KB Output is correct
25 Correct 928 ms 42840 KB Output is correct
26 Correct 342 ms 32948 KB Output is correct
27 Correct 335 ms 33088 KB Output is correct
28 Correct 338 ms 32928 KB Output is correct
29 Correct 355 ms 33104 KB Output is correct
30 Correct 360 ms 33280 KB Output is correct
31 Correct 17 ms 14492 KB Output is correct
32 Correct 15 ms 14456 KB Output is correct
33 Correct 15 ms 14584 KB Output is correct
34 Correct 16 ms 14456 KB Output is correct
35 Correct 16 ms 14584 KB Output is correct
36 Correct 15 ms 14456 KB Output is correct
37 Correct 15 ms 14456 KB Output is correct
38 Correct 15 ms 14456 KB Output is correct
39 Correct 15 ms 14456 KB Output is correct
40 Correct 15 ms 14456 KB Output is correct
41 Correct 303 ms 26788 KB Output is correct
42 Correct 665 ms 32524 KB Output is correct
43 Correct 678 ms 32652 KB Output is correct
44 Correct 116 ms 21104 KB Output is correct
45 Correct 670 ms 32600 KB Output is correct
46 Correct 650 ms 32704 KB Output is correct
47 Correct 660 ms 32484 KB Output is correct
48 Correct 687 ms 32584 KB Output is correct
49 Correct 685 ms 32452 KB Output is correct
50 Correct 696 ms 32756 KB Output is correct
51 Correct 637 ms 32504 KB Output is correct
52 Correct 654 ms 32504 KB Output is correct
53 Correct 680 ms 32632 KB Output is correct
54 Correct 698 ms 32760 KB Output is correct
55 Correct 682 ms 32604 KB Output is correct
56 Correct 683 ms 32632 KB Output is correct
57 Correct 666 ms 32860 KB Output is correct
58 Correct 678 ms 32764 KB Output is correct
59 Correct 115 ms 21304 KB Output is correct
60 Correct 683 ms 32736 KB Output is correct
61 Correct 585 ms 33244 KB Output is correct
62 Correct 160 ms 25424 KB Output is correct
63 Correct 129 ms 21744 KB Output is correct
64 Correct 159 ms 25452 KB Output is correct
65 Correct 164 ms 25636 KB Output is correct
66 Correct 145 ms 21696 KB Output is correct
67 Correct 117 ms 21212 KB Output is correct
68 Correct 168 ms 25604 KB Output is correct
69 Correct 116 ms 21104 KB Output is correct
70 Correct 156 ms 25528 KB Output is correct
71 Correct 117 ms 21188 KB Output is correct
72 Correct 579 ms 42648 KB Output is correct
73 Correct 927 ms 43780 KB Output is correct
74 Correct 931 ms 43796 KB Output is correct
75 Correct 940 ms 43788 KB Output is correct
76 Correct 911 ms 43936 KB Output is correct
77 Correct 954 ms 43868 KB Output is correct
78 Correct 961 ms 43764 KB Output is correct
79 Correct 921 ms 43820 KB Output is correct
80 Correct 930 ms 43780 KB Output is correct
81 Correct 974 ms 43772 KB Output is correct
82 Correct 943 ms 43880 KB Output is correct
83 Correct 917 ms 43800 KB Output is correct
84 Correct 926 ms 43784 KB Output is correct
85 Correct 959 ms 43780 KB Output is correct
86 Correct 952 ms 43736 KB Output is correct
87 Correct 960 ms 43692 KB Output is correct
88 Correct 969 ms 43668 KB Output is correct
89 Correct 389 ms 35312 KB Output is correct
90 Correct 986 ms 43084 KB Output is correct
91 Correct 862 ms 42696 KB Output is correct
92 Correct 462 ms 32736 KB Output is correct
93 Correct 534 ms 56612 KB Output is correct
94 Correct 412 ms 32612 KB Output is correct
95 Correct 476 ms 32620 KB Output is correct
96 Correct 616 ms 60176 KB Output is correct
97 Correct 427 ms 34540 KB Output is correct
98 Correct 423 ms 32588 KB Output is correct
99 Correct 446 ms 34420 KB Output is correct
100 Correct 416 ms 32664 KB Output is correct