oj.uz

Submission #446164

# Submission time Handle Problem Language Result Execution time Memory
446164 2021-07-21T07:15:34 Z blue Evacuation plan (IZhO18_plan) C++17
100 / 100
 1540 ms 48096 KB 
#include <iostream>
#include <vector>
#include <set>

#include <algorithm>
using namespace std;

const int max_n = 1e5;
const int INF = 1e9;

vector<int> power_dist(1+max_n, INF);

struct city
{
    int i;
};

bool operator < (city A, city B)
{
    if(power_dist[A.i] == power_dist[B.i]) return A.i < B.i;
    return power_dist[A.i] < power_dist[B.i];
}

vector<int> merge_cc[1+max_n], merge_dist[1+max_n];

vector<int> col_set[1+max_n];
vector<int> node_col(1+max_n);

void merge(int a, int b)
{
    if(node_col[a] == node_col[b]) return;

    if(col_set[ node_col[a] ].size() < col_set[ node_col[b] ].size()) swap(a, b);

    int colA  = node_col[a];
    int colB = node_col[b];

    for(int z: col_set[colB])
    {
        node_col[z] = colA;
        col_set[colA].push_back(z);
        merge_cc[z].push_back(colA);
        merge_dist[z].push_back(min(power_dist[a], power_dist[b]));
    }
    col_set[colB].clear();

//     cerr << "merging " << a << ", " << b << " at " << min(power_dist[a], power_dist[b]) << '\n';
}

int main()
{
    int n, m;
    cin >> n >> m;

    vector<int> edge[1+n], dist[1+n];

    for(int j = 1; j <= m; j++)
    {
        int a, b, w;
        cin >> a >> b >> w;

        edge[a].push_back(b);
        dist[a].push_back(w);

        edge[b].push_back(a);
        dist[b].push_back(w);
    }

    int k;
    cin >> k;
    for(int p = 1; p <= k; p++)
    {
        int g;
        cin >> g;

        power_dist[g] = 0;
    }

    set<city> tbv;
    for(int i = 1; i <= n; i++) tbv.insert(city{i});

    while(!tbv.empty())
    {
        int u = tbv.begin()->i;
        tbv.erase(tbv.begin());

        for(int e = 0; e < edge[u].size(); e++)
        {
            int v = edge[u][e];
            int w = dist[u][e];

            if(power_dist[v] > power_dist[u] + w)
            {
                tbv.erase(city{v});
                power_dist[v] = power_dist[u] + w;
                tbv.insert(city{v});
            }
        }
    }

    // for(int u = 1; u <= n; u++) cerr << u << ": " << power_dist[u] << '\n';



    vector<int> power_sort(n);
    for(int i = 0; i < n; i++) power_sort[i] = i+1;
    sort(power_sort.begin(), power_sort.end(), [] (int x, int y)
    {
        return power_dist[x] > power_dist[y];
    });





    for(int i = 1; i <= n; i++)
    {
        node_col[i] = i;
        col_set[i].push_back(i);
        merge_cc[i].push_back(i);
        merge_dist[i].push_back(INF);
    }


    for(int p: power_sort)
    {
        for(int q: edge[p])
        {
            // cerr << "p = " << p << ", q = " << q << '\n';
            if(power_dist[q] >= power_dist[p])
                merge(p, q);
        }
    }


    int Q;
    cin >> Q;

    for(int q = 1; q <= Q; q++)
    {
        int s, t;
        cin >> s >> t;

        int ans = 0;

        // cerr << "s = " << s << ", t = " << t << '\n';

        for(int e1 = 0; e1 < merge_cc[s].size(); e1++)
        {
            for(int e2 = 0; e2 < merge_cc[t].size(); e2++)
            {
                // cerr << s << ' ' << e1 << ' ' << merge_cc[s][e1] << ' ' << merge_dist[s][e1] << ", ";
                // cerr << t << ' ' << e2 << ' ' << merge_cc[t][e2] << ' ' << merge_dist[t][e2] << "\n";
                if(merge_cc[s][e1] == merge_cc[t][e2])
                {
                    ans = max(ans, min(merge_dist[s][e1], merge_dist[t][e2]));
                }
            }
        }

        cout << ans << '\n';
    }
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:87:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |         for(int e = 0; e < edge[u].size(); e++)
      |                        ~~^~~~~~~~~~~~~~~~
plan.cpp:148:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |         for(int e1 = 0; e1 < merge_cc[s].size(); e1++)
      |                         ~~~^~~~~~~~~~~~~~~~~~~~
plan.cpp:150:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |             for(int e2 = 0; e2 < merge_cc[t].size(); e2++)
      |                             ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 9 ms 8268 KB Output is correct
3 Correct 12 ms 8268 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 9 ms 8280 KB Output is correct
6 Correct 9 ms 8276 KB Output is correct
7 Correct 6 ms 8136 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 11 ms 8348 KB Output is correct
10 Correct 10 ms 8268 KB Output is correct
11 Correct 12 ms 8396 KB Output is correct
12 Correct 10 ms 8268 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 12 ms 8272 KB Output is correct
15 Correct 10 ms 8396 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 9 ms 8268 KB Output is correct
3 Correct 12 ms 8268 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 9 ms 8280 KB Output is correct
6 Correct 9 ms 8276 KB Output is correct
7 Correct 6 ms 8136 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 11 ms 8348 KB Output is correct
10 Correct 10 ms 8268 KB Output is correct
11 Correct 12 ms 8396 KB Output is correct
12 Correct 10 ms 8268 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 12 ms 8272 KB Output is correct
15 Correct 10 ms 8396 KB Output is correct
16 Correct 614 ms 28660 KB Output is correct
17 Correct 1540 ms 47640 KB Output is correct
18 Correct 97 ms 12212 KB Output is correct
19 Correct 630 ms 33396 KB Output is correct
20 Correct 1425 ms 47784 KB Output is correct
21 Correct 879 ms 36096 KB Output is correct
22 Correct 597 ms 33144 KB Output is correct
23 Correct 1441 ms 47620 KB Output is correct
24 Correct 1448 ms 47588 KB Output is correct
25 Correct 1518 ms 47592 KB Output is correct
26 Correct 722 ms 33204 KB Output is correct
27 Correct 651 ms 33396 KB Output is correct
28 Correct 620 ms 33264 KB Output is correct
29 Correct 663 ms 33412 KB Output is correct
30 Correct 647 ms 33420 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 643 ms 34204 KB Output is correct
2 Correct 1164 ms 46284 KB Output is correct
3 Correct 1189 ms 46308 KB Output is correct
4 Correct 378 ms 31424 KB Output is correct
5 Correct 1186 ms 46124 KB Output is correct
6 Correct 1142 ms 46144 KB Output is correct
7 Correct 1124 ms 46140 KB Output is correct
8 Correct 1176 ms 46100 KB Output is correct
9 Correct 1168 ms 46200 KB Output is correct
10 Correct 1203 ms 46180 KB Output is correct
11 Correct 1152 ms 46248 KB Output is correct
12 Correct 1170 ms 46128 KB Output is correct
13 Correct 1127 ms 46312 KB Output is correct
14 Correct 1118 ms 46168 KB Output is correct
15 Correct 1192 ms 46300 KB Output is correct
16 Correct 1158 ms 46160 KB Output is correct
17 Correct 1117 ms 46076 KB Output is correct
18 Correct 1170 ms 46120 KB Output is correct
19 Correct 346 ms 31032 KB Output is correct
20 Correct 1172 ms 46140 KB Output is correct
21 Correct 1103 ms 46652 KB Output is correct
22 Correct 410 ms 31956 KB Output is correct
23 Correct 461 ms 35920 KB Output is correct
24 Correct 364 ms 31972 KB Output is correct
25 Correct 380 ms 32020 KB Output is correct
26 Correct 508 ms 36208 KB Output is correct
27 Correct 351 ms 31424 KB Output is correct
28 Correct 376 ms 32048 KB Output is correct
29 Correct 351 ms 31264 KB Output is correct
30 Correct 416 ms 32076 KB Output is correct
31 Correct 372 ms 31260 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8140 KB Output is correct
2 Correct 9 ms 8268 KB Output is correct
3 Correct 12 ms 8268 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 9 ms 8280 KB Output is correct
6 Correct 9 ms 8276 KB Output is correct
7 Correct 6 ms 8136 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 11 ms 8348 KB Output is correct
10 Correct 10 ms 8268 KB Output is correct
11 Correct 12 ms 8396 KB Output is correct
12 Correct 10 ms 8268 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 12 ms 8272 KB Output is correct
15 Correct 10 ms 8396 KB Output is correct
16 Correct 614 ms 28660 KB Output is correct
17 Correct 1540 ms 47640 KB Output is correct
18 Correct 97 ms 12212 KB Output is correct
19 Correct 630 ms 33396 KB Output is correct
20 Correct 1425 ms 47784 KB Output is correct
21 Correct 879 ms 36096 KB Output is correct
22 Correct 597 ms 33144 KB Output is correct
23 Correct 1441 ms 47620 KB Output is correct
24 Correct 1448 ms 47588 KB Output is correct
25 Correct 1518 ms 47592 KB Output is correct
26 Correct 722 ms 33204 KB Output is correct
27 Correct 651 ms 33396 KB Output is correct
28 Correct 620 ms 33264 KB Output is correct
29 Correct 663 ms 33412 KB Output is correct
30 Correct 647 ms 33420 KB Output is correct
31 Correct 5 ms 8140 KB Output is correct
32 Correct 5 ms 8140 KB Output is correct
33 Correct 5 ms 8140 KB Output is correct
34 Correct 5 ms 8140 KB Output is correct
35 Correct 5 ms 8140 KB Output is correct
36 Correct 5 ms 8140 KB Output is correct
37 Correct 7 ms 8140 KB Output is correct
38 Correct 7 ms 8140 KB Output is correct
39 Correct 6 ms 8140 KB Output is correct
40 Correct 6 ms 8140 KB Output is correct
41 Correct 643 ms 34204 KB Output is correct
42 Correct 1164 ms 46284 KB Output is correct
43 Correct 1189 ms 46308 KB Output is correct
44 Correct 378 ms 31424 KB Output is correct
45 Correct 1186 ms 46124 KB Output is correct
46 Correct 1142 ms 46144 KB Output is correct
47 Correct 1124 ms 46140 KB Output is correct
48 Correct 1176 ms 46100 KB Output is correct
49 Correct 1168 ms 46200 KB Output is correct
50 Correct 1203 ms 46180 KB Output is correct
51 Correct 1152 ms 46248 KB Output is correct
52 Correct 1170 ms 46128 KB Output is correct
53 Correct 1127 ms 46312 KB Output is correct
54 Correct 1118 ms 46168 KB Output is correct
55 Correct 1192 ms 46300 KB Output is correct
56 Correct 1158 ms 46160 KB Output is correct
57 Correct 1117 ms 46076 KB Output is correct
58 Correct 1170 ms 46120 KB Output is correct
59 Correct 346 ms 31032 KB Output is correct
60 Correct 1172 ms 46140 KB Output is correct
61 Correct 1103 ms 46652 KB Output is correct
62 Correct 410 ms 31956 KB Output is correct
63 Correct 461 ms 35920 KB Output is correct
64 Correct 364 ms 31972 KB Output is correct
65 Correct 380 ms 32020 KB Output is correct
66 Correct 508 ms 36208 KB Output is correct
67 Correct 351 ms 31424 KB Output is correct
68 Correct 376 ms 32048 KB Output is correct
69 Correct 351 ms 31264 KB Output is correct
70 Correct 416 ms 32076 KB Output is correct
71 Correct 372 ms 31260 KB Output is correct
72 Correct 867 ms 36136 KB Output is correct
73 Correct 1404 ms 47828 KB Output is correct
74 Correct 1432 ms 47624 KB Output is correct
75 Correct 1427 ms 47748 KB Output is correct
76 Correct 1403 ms 47784 KB Output is correct
77 Correct 1347 ms 47672 KB Output is correct
78 Correct 1332 ms 47780 KB Output is correct
79 Correct 1394 ms 47660 KB Output is correct
80 Correct 1473 ms 47688 KB Output is correct
81 Correct 1404 ms 47672 KB Output is correct
82 Correct 1392 ms 47772 KB Output is correct
83 Correct 1528 ms 47740 KB Output is correct
84 Correct 1520 ms 47688 KB Output is correct
85 Correct 1462 ms 47660 KB Output is correct
86 Correct 1369 ms 47740 KB Output is correct
87 Correct 1367 ms 47744 KB Output is correct
88 Correct 1379 ms 47776 KB Output is correct
89 Correct 616 ms 33220 KB Output is correct
90 Correct 1455 ms 47668 KB Output is correct
91 Correct 1240 ms 48096 KB Output is correct
92 Correct 616 ms 33336 KB Output is correct
93 Correct 719 ms 38036 KB Output is correct
94 Correct 608 ms 33332 KB Output is correct
95 Correct 630 ms 33352 KB Output is correct
96 Correct 785 ms 37996 KB Output is correct
97 Correct 621 ms 33000 KB Output is correct
98 Correct 615 ms 33272 KB Output is correct
99 Correct 635 ms 33060 KB Output is correct
100 Correct 643 ms 33284 KB Output is correct