oj.uz

Submission #958690

# Submission time Handle Problem Language Result Execution time Memory
958690 2024-04-06T11:03:45 Z I_am_Polish_Girl Evacuation plan (IZhO18_plan) C++14
100 / 100
 909 ms 82216 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>

using namespace std;

#define int long long

int log_ = 10;
int inf = 1000000000000000000;
int mod = 998244353;

vector < vector< pair <int , int > > > g;

vector <int> link;
vector <int> w;

int find(int u)
{
    if (link[u] == u)
        return u;

    link[u] = find(link[u]);
    return link[u];
}


void merge(int u, int v)
{
    u = find(u);
    v = find(v);

    if (u == v)
        return;

    if (w[u] < w[v])
        swap(u, v);

    link[v] = u;
    w[u] += w[v];
}

void init(int n)
{
    link.clear();
    w.clear();


    link.resize(n);
    w.resize(n , 1);

    for (int i = 0; i < n; i++)
        link[i] = i;
}






signed main()
{
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);

    int n , m;
    cin >> n >> m;

    g.resize(n);

    vector < pair <int , int> > edges(m);

    for (int i = 0; i < m; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        u--;
        v--;


        edges[i] = { u , v };

        g[u].push_back({ v , w });
        g[v].push_back({ u , w });
    }


    priority_queue < pair <int, int> > pq;

    vector <int> deep(n , inf);

    int k;
    cin >> k;
    
    for (int i = 0; i < k; i++)
    {
        int u;
        cin >> u;
        u--;

        deep[u] = 0;
        pq.push({ 0 , u });
    }

    while (pq.size() > 0)
    {
        int ind = pq.top().second;
        int d = -pq.top().first;

        pq.pop();

        if (deep[ind] < d)
            continue;


        for (int i = 0; i < g[ind].size(); i++)
        {
            int ind_s = g[ind][i].first;
            int d_ = g[ind][i].second;

            if (deep[ind_s] > deep[ind] + d_)
            {
                deep[ind_s] = deep[ind] + d_;

                pq.push({ -deep[ind_s] , ind_s });
            }
        }
    }


    vector < pair <int , pair <int , int>> > ed;

    for (int i = 0; i < m; i++)
    {
        int u = edges[i].first;
        int v = edges[i].second;

        if (deep[u] < deep[v])
            swap(u, v);

        ed.push_back({deep[v] , {u , v}});
    }

    sort(ed.begin(), ed.end());

    int q_;
    cin >> q_;
    vector < pair <int, int> > q(q_);

    for (int i = 0; i < q_; i++)
    {
        int u, v;
        cin >> u >> v;
        u--;
        v--;

        q[i] = { u , v };
    }

    vector <int> l(q_ ,0);
    vector <int> r(q_ , m);

    vector <int> mid(q_);

    vector < vector <int> > m_(q_);


    for (int k = 0; k < 20; k++)
    {

        init(n);

        m_.clear();
        m_.resize(m);

        for (int i = 0; i < q_; i++)
        {
            if (r[i] - l[i] == 1)
            {
                continue;
            }

            mid[i] = (l[i] + r[i]) / 2;
            m_[mid[i]].push_back(i);
        }


        for (int i = m - 1; i >= 0; i--)
        {
            int u = ed[i].second.first;
            int v = ed[i].second.second;

            merge(u, v);

            for (int j = 0; j < m_[i].size(); j++)
            {
                int u_, v_;

                int ind = m_[i][j];

                u_ = q[ind].first;
                v_ = q[ind].second;

                if (find(u_) == find(v_))
                {
                    l[ind] = mid[ind];
                }
                else
                {
                    r[ind] = mid[ind];
                }
            }
        }
    }


    for (int i = 0; i < q_; i++)
    {
        int l_ = l[i];
        cout << ed[l_].first << "\n";
    }
}

/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:126:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |         for (int i = 0; i < g[ind].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~
plan.cpp:205:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  205 |             for (int j = 0; j < m_[i].size(); j++)
      |                             ~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 560 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 560 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 290 ms 24888 KB Output is correct
17 Correct 862 ms 80588 KB Output is correct
18 Correct 53 ms 7276 KB Output is correct
19 Correct 243 ms 27372 KB Output is correct
20 Correct 905 ms 80944 KB Output is correct
21 Correct 436 ms 41392 KB Output is correct
22 Correct 224 ms 25948 KB Output is correct
23 Correct 844 ms 80540 KB Output is correct
24 Correct 882 ms 80456 KB Output is correct
25 Correct 816 ms 81048 KB Output is correct
26 Correct 223 ms 26680 KB Output is correct
27 Correct 233 ms 26808 KB Output is correct
28 Correct 225 ms 27180 KB Output is correct
29 Correct 236 ms 26748 KB Output is correct
30 Correct 237 ms 26852 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 33208 KB Output is correct
2 Correct 661 ms 72568 KB Output is correct
3 Correct 612 ms 72600 KB Output is correct
4 Correct 115 ms 17608 KB Output is correct
5 Correct 635 ms 72696 KB Output is correct
6 Correct 649 ms 72504 KB Output is correct
7 Correct 634 ms 72572 KB Output is correct
8 Correct 634 ms 72648 KB Output is correct
9 Correct 627 ms 72820 KB Output is correct
10 Correct 645 ms 72880 KB Output is correct
11 Correct 621 ms 72496 KB Output is correct
12 Correct 626 ms 72748 KB Output is correct
13 Correct 621 ms 72544 KB Output is correct
14 Correct 641 ms 73056 KB Output is correct
15 Correct 614 ms 74808 KB Output is correct
16 Correct 594 ms 72816 KB Output is correct
17 Correct 645 ms 72384 KB Output is correct
18 Correct 605 ms 72628 KB Output is correct
19 Correct 118 ms 17680 KB Output is correct
20 Correct 656 ms 72524 KB Output is correct
21 Correct 628 ms 72392 KB Output is correct
22 Correct 110 ms 19260 KB Output is correct
23 Correct 135 ms 18392 KB Output is correct
24 Correct 109 ms 19256 KB Output is correct
25 Correct 111 ms 19528 KB Output is correct
26 Correct 140 ms 18228 KB Output is correct
27 Correct 111 ms 17604 KB Output is correct
28 Correct 112 ms 19284 KB Output is correct
29 Correct 119 ms 18116 KB Output is correct
30 Correct 113 ms 19240 KB Output is correct
31 Correct 133 ms 17528 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 560 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 290 ms 24888 KB Output is correct
17 Correct 862 ms 80588 KB Output is correct
18 Correct 53 ms 7276 KB Output is correct
19 Correct 243 ms 27372 KB Output is correct
20 Correct 905 ms 80944 KB Output is correct
21 Correct 436 ms 41392 KB Output is correct
22 Correct 224 ms 25948 KB Output is correct
23 Correct 844 ms 80540 KB Output is correct
24 Correct 882 ms 80456 KB Output is correct
25 Correct 816 ms 81048 KB Output is correct
26 Correct 223 ms 26680 KB Output is correct
27 Correct 233 ms 26808 KB Output is correct
28 Correct 225 ms 27180 KB Output is correct
29 Correct 236 ms 26748 KB Output is correct
30 Correct 237 ms 26852 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 432 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 274 ms 33208 KB Output is correct
42 Correct 661 ms 72568 KB Output is correct
43 Correct 612 ms 72600 KB Output is correct
44 Correct 115 ms 17608 KB Output is correct
45 Correct 635 ms 72696 KB Output is correct
46 Correct 649 ms 72504 KB Output is correct
47 Correct 634 ms 72572 KB Output is correct
48 Correct 634 ms 72648 KB Output is correct
49 Correct 627 ms 72820 KB Output is correct
50 Correct 645 ms 72880 KB Output is correct
51 Correct 621 ms 72496 KB Output is correct
52 Correct 626 ms 72748 KB Output is correct
53 Correct 621 ms 72544 KB Output is correct
54 Correct 641 ms 73056 KB Output is correct
55 Correct 614 ms 74808 KB Output is correct
56 Correct 594 ms 72816 KB Output is correct
57 Correct 645 ms 72384 KB Output is correct
58 Correct 605 ms 72628 KB Output is correct
59 Correct 118 ms 17680 KB Output is correct
60 Correct 656 ms 72524 KB Output is correct
61 Correct 628 ms 72392 KB Output is correct
62 Correct 110 ms 19260 KB Output is correct
63 Correct 135 ms 18392 KB Output is correct
64 Correct 109 ms 19256 KB Output is correct
65 Correct 111 ms 19528 KB Output is correct
66 Correct 140 ms 18228 KB Output is correct
67 Correct 111 ms 17604 KB Output is correct
68 Correct 112 ms 19284 KB Output is correct
69 Correct 119 ms 18116 KB Output is correct
70 Correct 113 ms 19240 KB Output is correct
71 Correct 133 ms 17528 KB Output is correct
72 Correct 425 ms 40592 KB Output is correct
73 Correct 868 ms 80552 KB Output is correct
74 Correct 909 ms 80496 KB Output is correct
75 Correct 854 ms 80552 KB Output is correct
76 Correct 847 ms 80440 KB Output is correct
77 Correct 887 ms 80408 KB Output is correct
78 Correct 868 ms 80428 KB Output is correct
79 Correct 871 ms 80288 KB Output is correct
80 Correct 886 ms 80540 KB Output is correct
81 Correct 839 ms 80956 KB Output is correct
82 Correct 817 ms 80468 KB Output is correct
83 Correct 822 ms 80340 KB Output is correct
84 Correct 823 ms 80368 KB Output is correct
85 Correct 881 ms 82216 KB Output is correct
86 Correct 832 ms 80260 KB Output is correct
87 Correct 870 ms 80328 KB Output is correct
88 Correct 856 ms 80300 KB Output is correct
89 Correct 231 ms 25504 KB Output is correct
90 Correct 850 ms 80552 KB Output is correct
91 Correct 848 ms 80056 KB Output is correct
92 Correct 234 ms 26424 KB Output is correct
93 Correct 265 ms 25876 KB Output is correct
94 Correct 220 ms 26224 KB Output is correct
95 Correct 222 ms 26528 KB Output is correct
96 Correct 249 ms 25280 KB Output is correct
97 Correct 208 ms 25068 KB Output is correct
98 Correct 227 ms 26748 KB Output is correct
99 Correct 216 ms 25144 KB Output is correct
100 Correct 221 ms 26384 KB Output is correct