oj.uz

답안 #492352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492352 2021-12-07T01:30:57 Z Rainbowbunny Evacuation plan (IZhO18_plan) C++17
100 / 100
 1075 ms 32388 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 5;
const int INF = 1e9;

int n, m, k, q;
int d[MAXN];
int l[MAXN], r[MAXN];
int uu[MAXN], vv[MAXN], dsu[MAXN];
vector <pair <int, int> > Adj[MAXN];

int Root(int node)
{
    return dsu[node] == node ? node : dsu[node] = Root(dsu[node]);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int u, v, c;
        cin >> u >> v >> c;
        Adj[u].emplace_back(v, c);
        Adj[v].emplace_back(u, c);
    }
    for(int i = 1; i <= n; i++)
    {
        d[i] = INF;
    }
    priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;
    cin >> k;
    for(int i = 1; i <= k; i++)
    {
        int a;
        cin >> a;
        d[a] = 0;
        pq.emplace(0, a);
    }
    while(pq.empty() == false)
    {
        int dd = pq.top().first, node = pq.top().second;
        pq.pop();
        if(dd == d[node])
        {
            for(auto x : Adj[node])
            {
                if(d[x.first] > d[node] + x.second)
                {
                    d[x.first] = d[node] + x.second;
                    pq.emplace(d[x.first], x.first);
                }
            }
        }
    }
    vector <pair <int, int> > V;
    for(int i = 1; i <= n; i++)
    {
        V.emplace_back(d[i], i);
    }
    sort(V.rbegin(), V.rend());
    cin >> q;
    for(int i = 1; i <= q; i++)
    {
        cin >> uu[i] >> vv[i];
        l[i] = 0, r[i] = 1e9;
    }
    for(int times = 1; times <= 30; times++)
    {
        vector <pair <int, int> > Queries;
        for(int i = 1; i <= n; i++)
        {
            dsu[i] = i;
        }
        for(int i = 1; i <= q; i++)
        {
            int mid = (l[i] + r[i] + 1) >> 1;
            Queries.emplace_back(mid, i);
        }
        sort(Queries.rbegin(), Queries.rend());
        int pt = 0;
        for(auto x : Queries)
        {
            while(pt < n and V[pt].first >= x.first)
            {
                for(auto x : Adj[V[pt].second])
                {
                    int u = x.first, v = V[pt].second;
                    if(d[u] >= d[v])
                    {
                        u = Root(u), v = Root(v);
                        if(u != v)
                        {
                            dsu[u] = v;
                        }
                    }
                    
                }
                pt++;
            }
            if(Root(uu[x.second]) == Root(vv[x.second]))
            {
                l[x.second] = x.first;
            }
            else
            {
                r[x.second] = x.first - 1;
            }
        }
    }
    for(int i = 1; i <= q; i++)
    {
        cout << l[i] << '\n';
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 3 ms 2808 KB Output is correct
3 Correct 3 ms 2764 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 3 ms 2808 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 6 ms 2764 KB Output is correct
10 Correct 4 ms 2684 KB Output is correct
11 Correct 4 ms 2764 KB Output is correct
12 Correct 3 ms 2812 KB Output is correct
13 Correct 4 ms 2764 KB Output is correct
14 Correct 4 ms 2764 KB Output is correct
15 Correct 4 ms 2764 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 3 ms 2808 KB Output is correct
3 Correct 3 ms 2764 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 3 ms 2808 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 6 ms 2764 KB Output is correct
10 Correct 4 ms 2684 KB Output is correct
11 Correct 4 ms 2764 KB Output is correct
12 Correct 3 ms 2812 KB Output is correct
13 Correct 4 ms 2764 KB Output is correct
14 Correct 4 ms 2764 KB Output is correct
15 Correct 4 ms 2764 KB Output is correct
16 Correct 478 ms 13836 KB Output is correct
17 Correct 1075 ms 32068 KB Output is correct
18 Correct 62 ms 5312 KB Output is correct
19 Correct 244 ms 15368 KB Output is correct
20 Correct 1049 ms 31980 KB Output is correct
21 Correct 381 ms 19492 KB Output is correct
22 Correct 510 ms 13884 KB Output is correct
23 Correct 1012 ms 31968 KB Output is correct
24 Correct 982 ms 31996 KB Output is correct
25 Correct 834 ms 32084 KB Output is correct
26 Correct 225 ms 15304 KB Output is correct
27 Correct 232 ms 15244 KB Output is correct
28 Correct 212 ms 15224 KB Output is correct
29 Correct 238 ms 15680 KB Output is correct
30 Correct 252 ms 15216 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2636 KB Output is correct
3 Correct 2 ms 2676 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 11580 KB Output is correct
2 Correct 548 ms 19976 KB Output is correct
3 Correct 510 ms 19916 KB Output is correct
4 Correct 176 ms 8420 KB Output is correct
5 Correct 733 ms 20024 KB Output is correct
6 Correct 484 ms 20212 KB Output is correct
7 Correct 493 ms 20032 KB Output is correct
8 Correct 388 ms 19892 KB Output is correct
9 Correct 480 ms 19936 KB Output is correct
10 Correct 649 ms 19932 KB Output is correct
11 Correct 715 ms 19900 KB Output is correct
12 Correct 643 ms 19996 KB Output is correct
13 Correct 668 ms 19852 KB Output is correct
14 Correct 391 ms 19944 KB Output is correct
15 Correct 595 ms 20828 KB Output is correct
16 Correct 560 ms 19896 KB Output is correct
17 Correct 392 ms 20008 KB Output is correct
18 Correct 422 ms 19932 KB Output is correct
19 Correct 49 ms 8216 KB Output is correct
20 Correct 579 ms 19952 KB Output is correct
21 Correct 298 ms 19648 KB Output is correct
22 Correct 80 ms 9688 KB Output is correct
23 Correct 132 ms 8388 KB Output is correct
24 Correct 95 ms 9656 KB Output is correct
25 Correct 76 ms 9640 KB Output is correct
26 Correct 151 ms 8440 KB Output is correct
27 Correct 147 ms 8388 KB Output is correct
28 Correct 77 ms 9676 KB Output is correct
29 Correct 152 ms 8460 KB Output is correct
30 Correct 80 ms 9680 KB Output is correct
31 Correct 155 ms 8248 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 3 ms 2808 KB Output is correct
3 Correct 3 ms 2764 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 3 ms 2808 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 6 ms 2764 KB Output is correct
10 Correct 4 ms 2684 KB Output is correct
11 Correct 4 ms 2764 KB Output is correct
12 Correct 3 ms 2812 KB Output is correct
13 Correct 4 ms 2764 KB Output is correct
14 Correct 4 ms 2764 KB Output is correct
15 Correct 4 ms 2764 KB Output is correct
16 Correct 478 ms 13836 KB Output is correct
17 Correct 1075 ms 32068 KB Output is correct
18 Correct 62 ms 5312 KB Output is correct
19 Correct 244 ms 15368 KB Output is correct
20 Correct 1049 ms 31980 KB Output is correct
21 Correct 381 ms 19492 KB Output is correct
22 Correct 510 ms 13884 KB Output is correct
23 Correct 1012 ms 31968 KB Output is correct
24 Correct 982 ms 31996 KB Output is correct
25 Correct 834 ms 32084 KB Output is correct
26 Correct 225 ms 15304 KB Output is correct
27 Correct 232 ms 15244 KB Output is correct
28 Correct 212 ms 15224 KB Output is correct
29 Correct 238 ms 15680 KB Output is correct
30 Correct 252 ms 15216 KB Output is correct
31 Correct 1 ms 2636 KB Output is correct
32 Correct 1 ms 2636 KB Output is correct
33 Correct 2 ms 2676 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 1 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 263 ms 11580 KB Output is correct
42 Correct 548 ms 19976 KB Output is correct
43 Correct 510 ms 19916 KB Output is correct
44 Correct 176 ms 8420 KB Output is correct
45 Correct 733 ms 20024 KB Output is correct
46 Correct 484 ms 20212 KB Output is correct
47 Correct 493 ms 20032 KB Output is correct
48 Correct 388 ms 19892 KB Output is correct
49 Correct 480 ms 19936 KB Output is correct
50 Correct 649 ms 19932 KB Output is correct
51 Correct 715 ms 19900 KB Output is correct
52 Correct 643 ms 19996 KB Output is correct
53 Correct 668 ms 19852 KB Output is correct
54 Correct 391 ms 19944 KB Output is correct
55 Correct 595 ms 20828 KB Output is correct
56 Correct 560 ms 19896 KB Output is correct
57 Correct 392 ms 20008 KB Output is correct
58 Correct 422 ms 19932 KB Output is correct
59 Correct 49 ms 8216 KB Output is correct
60 Correct 579 ms 19952 KB Output is correct
61 Correct 298 ms 19648 KB Output is correct
62 Correct 80 ms 9688 KB Output is correct
63 Correct 132 ms 8388 KB Output is correct
64 Correct 95 ms 9656 KB Output is correct
65 Correct 76 ms 9640 KB Output is correct
66 Correct 151 ms 8440 KB Output is correct
67 Correct 147 ms 8388 KB Output is correct
68 Correct 77 ms 9676 KB Output is correct
69 Correct 152 ms 8460 KB Output is correct
70 Correct 80 ms 9680 KB Output is correct
71 Correct 155 ms 8248 KB Output is correct
72 Correct 665 ms 19300 KB Output is correct
73 Correct 987 ms 32224 KB Output is correct
74 Correct 991 ms 32044 KB Output is correct
75 Correct 970 ms 32100 KB Output is correct
76 Correct 917 ms 32008 KB Output is correct
77 Correct 930 ms 32156 KB Output is correct
78 Correct 950 ms 31980 KB Output is correct
79 Correct 974 ms 32024 KB Output is correct
80 Correct 973 ms 32152 KB Output is correct
81 Correct 969 ms 32092 KB Output is correct
82 Correct 952 ms 32080 KB Output is correct
83 Correct 945 ms 32112 KB Output is correct
84 Correct 871 ms 32236 KB Output is correct
85 Correct 806 ms 32388 KB Output is correct
86 Correct 927 ms 32028 KB Output is correct
87 Correct 970 ms 32060 KB Output is correct
88 Correct 1006 ms 32216 KB Output is correct
89 Correct 660 ms 14172 KB Output is correct
90 Correct 996 ms 32072 KB Output is correct
91 Correct 459 ms 32236 KB Output is correct
92 Correct 217 ms 15236 KB Output is correct
93 Correct 569 ms 14304 KB Output is correct
94 Correct 214 ms 15244 KB Output is correct
95 Correct 233 ms 15224 KB Output is correct
96 Correct 433 ms 14216 KB Output is correct
97 Correct 594 ms 14076 KB Output is correct
98 Correct 209 ms 15216 KB Output is correct
99 Correct 613 ms 14016 KB Output is correct
100 Correct 220 ms 15232 KB Output is correct