oj.uz

Submission #830151

# Submission time Handle Problem Language Result Execution time Memory
830151 2023-08-18T20:06:31 Z raphaelp Evacuation plan (IZhO18_plan) C++14
100 / 100
 1200 ms 81404 KB 
#include <bits/stdc++.h>
using namespace std;
class UnionFind
{
private:
    vector<int> p, rank;
    int numSets;

public:
    UnionFind(int m)
    {
        p.assign(m, 0);
        for (int i = 0; i < m; ++i)
            p[i] = i;
        rank.assign(m, 0);
        numSets = m;
    }
    int find(int x) { return (p[x] == x) ? x : p[x] = find(p[x]); }
    bool sameSet(int a, int b) { return find(a) == find(b); }
    int nbSets() { return numSets; }
    bool merge(int a, int b)
    {
        if (sameSet(a, b))
            return false;
        int x = find(a);
        int y = find(b);
        if (rank[x] > rank[y])
            swap(x, y);
        p[x] = y;
        if (rank[x] == rank[y])
            rank[y]++;
        numSets--;
        return true;
    }
};
void par(int n, int p, vector<vector<pair<int, int>>> &parent, vector<int> &poids, vector<vector<pair<int, int>>> &roads, vector<int> &prof)
{
    parent[n][0].first = p;
    prof[n] = prof[p] + 1;
    for (int i = 0; i < roads[n].size(); i++)
    {
        if (roads[n][i].first == p)
            continue;
        parent[roads[n][i].first][0].second = roads[n][i].second;
        par(roads[n][i].first, n, parent, poids, roads, prof);
    }
}
int main()
{
    int N, M;
    cin >> N >> M;
    vector<vector<pair<int, int>>> roads(N, vector<pair<int, int>>(0));
    vector<vector<int>> aretes(M, vector<int>(0));
    for (int i = 0; i < M; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        roads[a - 1].push_back({b - 1, c});
        roads[b - 1].push_back({a - 1, c});
        aretes[i] = {0, b - 1, a - 1};
    }
    vector<vector<pair<int, int>>> parent(N, vector<pair<int, int>>(20, {0, 123456789}));
    vector<int> poids(N, -1);
    int K;
    cin >> K;
    vector<int> NPP(K);
    priority_queue<pair<int, int>> Q;
    for (int i = 0; i < K; i++)
    {
        cin >> NPP[i];
        Q.push({0, NPP[i] - 1});
    }
    while (!Q.empty())
    {
        int dist = -Q.top().first;
        int n = Q.top().second;
        Q.pop();
        if (poids[n] != -1)
            continue;
        poids[n] = dist;
        for (int i = 0; i < roads[n].size(); i++)
        {
            Q.push({-(dist + roads[n][i].second), roads[n][i].first});
        }
    }
    for (int i = 0; i < M; i++)
    {
        aretes[i][0] = min(poids[aretes[i][2]], poids[aretes[i][1]]);
    }
    sort(aretes.begin(), aretes.end());
    UnionFind UF(N);
    for (int i = 0; i < N; i++)
        roads[i].clear();
    for (int i = aretes.size() - 1; UF.nbSets() > 1; i--)
    {
        if (UF.merge(aretes[i][1], aretes[i][2]))
        {
            roads[aretes[i][1]].push_back({aretes[i][2], aretes[i][0]});
            roads[aretes[i][2]].push_back({aretes[i][1], aretes[i][0]});
        }
    }
    vector<int> prof(N, 0);
    par(0, 0, parent, poids, roads, prof);
    for (int i = 1; i < 20; i++)
    {
        for (int j = 0; j < N; j++)
        {
            parent[j][i].first = parent[parent[j][i - 1].first][i - 1].first;
            parent[j][i].second = min(parent[parent[j][i - 1].first][i - 1].second, parent[j][i - 1].second);
        }
    }
    int q;
    cin >> q;
    for (int j = 0; j < q; j++)
    {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        if (prof[a] < prof[b])
            swap(a, b);
        int minn = 123456789;
        for (int i = 19; i >= 0; i--)
        {
            if (prof[a] - (1 << i) >= prof[b])
            {
                minn = min(minn, parent[a][i].second);
                a = parent[a][i].first;
            }
        }
        if (a != b)
        {
            for (int i = 19; i >= 0; i--)
            {
                if (parent[a][i].first != parent[b][i].first)
                {
                    minn = min(minn, parent[a][i].second);
                    minn = min(minn, parent[b][i].second);
                    a = parent[a][i].first;
                    b = parent[b][i].first;
                }
            }
            minn = min(minn, parent[a][0].second);
            minn = min(minn, parent[b][0].second);
        }

        cout << minn << endl;
    }
}

Compilation message

plan.cpp: In function 'void par(int, int, std::vector<std::vector<std::pair<int, int> > >&, std::vector<int>&, std::vector<std::vector<std::pair<int, int> > >&, std::vector<int>&)':
plan.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for (int i = 0; i < roads[n].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~
plan.cpp: In function 'int main()':
plan.cpp:81:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int i = 0; i < roads[n].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 572 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 3 ms 548 KB Output is correct
15 Correct 3 ms 596 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 572 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 3 ms 548 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 341 ms 31072 KB Output is correct
17 Correct 1074 ms 79988 KB Output is correct
18 Correct 65 ms 7752 KB Output is correct
19 Correct 326 ms 37240 KB Output is correct
20 Correct 1045 ms 79984 KB Output is correct
21 Correct 532 ms 47352 KB Output is correct
22 Correct 317 ms 44096 KB Output is correct
23 Correct 1051 ms 79944 KB Output is correct
24 Correct 1061 ms 79996 KB Output is correct
25 Correct 1034 ms 80160 KB Output is correct
26 Correct 321 ms 36960 KB Output is correct
27 Correct 329 ms 37160 KB Output is correct
28 Correct 326 ms 37028 KB Output is correct
29 Correct 354 ms 37056 KB Output is correct
30 Correct 330 ms 37180 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 41592 KB Output is correct
2 Correct 916 ms 79796 KB Output is correct
3 Correct 962 ms 79700 KB Output is correct
4 Correct 171 ms 38836 KB Output is correct
5 Correct 960 ms 79784 KB Output is correct
6 Correct 990 ms 79796 KB Output is correct
7 Correct 920 ms 80048 KB Output is correct
8 Correct 1110 ms 79780 KB Output is correct
9 Correct 916 ms 79800 KB Output is correct
10 Correct 956 ms 79716 KB Output is correct
11 Correct 963 ms 79756 KB Output is correct
12 Correct 840 ms 79804 KB Output is correct
13 Correct 1200 ms 79768 KB Output is correct
14 Correct 898 ms 79776 KB Output is correct
15 Correct 970 ms 79868 KB Output is correct
16 Correct 880 ms 79768 KB Output is correct
17 Correct 974 ms 79748 KB Output is correct
18 Correct 919 ms 79784 KB Output is correct
19 Correct 179 ms 41352 KB Output is correct
20 Correct 968 ms 79712 KB Output is correct
21 Correct 863 ms 80480 KB Output is correct
22 Correct 178 ms 35608 KB Output is correct
23 Correct 158 ms 35344 KB Output is correct
24 Correct 158 ms 35524 KB Output is correct
25 Correct 159 ms 35604 KB Output is correct
26 Correct 178 ms 36184 KB Output is correct
27 Correct 162 ms 41128 KB Output is correct
28 Correct 156 ms 35596 KB Output is correct
29 Correct 152 ms 39984 KB Output is correct
30 Correct 169 ms 35608 KB Output is correct
31 Correct 153 ms 39932 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 572 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 3 ms 548 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 341 ms 31072 KB Output is correct
17 Correct 1074 ms 79988 KB Output is correct
18 Correct 65 ms 7752 KB Output is correct
19 Correct 326 ms 37240 KB Output is correct
20 Correct 1045 ms 79984 KB Output is correct
21 Correct 532 ms 47352 KB Output is correct
22 Correct 317 ms 44096 KB Output is correct
23 Correct 1051 ms 79944 KB Output is correct
24 Correct 1061 ms 79996 KB Output is correct
25 Correct 1034 ms 80160 KB Output is correct
26 Correct 321 ms 36960 KB Output is correct
27 Correct 329 ms 37160 KB Output is correct
28 Correct 326 ms 37028 KB Output is correct
29 Correct 354 ms 37056 KB Output is correct
30 Correct 330 ms 37180 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 353 ms 41592 KB Output is correct
42 Correct 916 ms 79796 KB Output is correct
43 Correct 962 ms 79700 KB Output is correct
44 Correct 171 ms 38836 KB Output is correct
45 Correct 960 ms 79784 KB Output is correct
46 Correct 990 ms 79796 KB Output is correct
47 Correct 920 ms 80048 KB Output is correct
48 Correct 1110 ms 79780 KB Output is correct
49 Correct 916 ms 79800 KB Output is correct
50 Correct 956 ms 79716 KB Output is correct
51 Correct 963 ms 79756 KB Output is correct
52 Correct 840 ms 79804 KB Output is correct
53 Correct 1200 ms 79768 KB Output is correct
54 Correct 898 ms 79776 KB Output is correct
55 Correct 970 ms 79868 KB Output is correct
56 Correct 880 ms 79768 KB Output is correct
57 Correct 974 ms 79748 KB Output is correct
58 Correct 919 ms 79784 KB Output is correct
59 Correct 179 ms 41352 KB Output is correct
60 Correct 968 ms 79712 KB Output is correct
61 Correct 863 ms 80480 KB Output is correct
62 Correct 178 ms 35608 KB Output is correct
63 Correct 158 ms 35344 KB Output is correct
64 Correct 158 ms 35524 KB Output is correct
65 Correct 159 ms 35604 KB Output is correct
66 Correct 178 ms 36184 KB Output is correct
67 Correct 162 ms 41128 KB Output is correct
68 Correct 156 ms 35596 KB Output is correct
69 Correct 152 ms 39984 KB Output is correct
70 Correct 169 ms 35608 KB Output is correct
71 Correct 153 ms 39932 KB Output is correct
72 Correct 535 ms 46716 KB Output is correct
73 Correct 998 ms 80000 KB Output is correct
74 Correct 1020 ms 79892 KB Output is correct
75 Correct 1048 ms 80020 KB Output is correct
76 Correct 1041 ms 79876 KB Output is correct
77 Correct 1037 ms 79984 KB Output is correct
78 Correct 1025 ms 79880 KB Output is correct
79 Correct 1047 ms 79992 KB Output is correct
80 Correct 1022 ms 79896 KB Output is correct
81 Correct 1041 ms 79852 KB Output is correct
82 Correct 1029 ms 79988 KB Output is correct
83 Correct 1044 ms 79932 KB Output is correct
84 Correct 1040 ms 80000 KB Output is correct
85 Correct 1016 ms 79960 KB Output is correct
86 Correct 1020 ms 80016 KB Output is correct
87 Correct 1036 ms 79948 KB Output is correct
88 Correct 1049 ms 80028 KB Output is correct
89 Correct 395 ms 42204 KB Output is correct
90 Correct 1014 ms 79920 KB Output is correct
91 Correct 1042 ms 81404 KB Output is correct
92 Correct 335 ms 37056 KB Output is correct
93 Correct 370 ms 37512 KB Output is correct
94 Correct 337 ms 37044 KB Output is correct
95 Correct 328 ms 37120 KB Output is correct
96 Correct 391 ms 37448 KB Output is correct
97 Correct 444 ms 40760 KB Output is correct
98 Correct 320 ms 37060 KB Output is correct
99 Correct 401 ms 42796 KB Output is correct
100 Correct 330 ms 37216 KB Output is correct