oj.uz

답안 #379325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379325 2021-03-18T01:53:23 Z joylintp Evacuation plan (IZhO18_plan) C++17
100 / 100
 828 ms 59080 KB 
#include<bits/stdc++.h>
using namespace std;

//#pragma gcc optimize("Ofast,unroll-loops")
//#pragma gcc target("sse,sse2,sse3,ssse3,sse4,avx,avx2,fma,abm,mmx,popcnt,tune=native")
//#define int long long
//#define double long double
#define MP make_pair
#define F first
#define S second
#define MOD 1000000007

vector<int> group, ans;
vector<set<int>> qry;

int fnd(int a)
{
    if (a == group[a])
        return a;
    else
        return group[a] = fnd(group[a]);
}

void uni(int a, int b, int w)
{
    int x = fnd(a), y = fnd(b);
    if (x != y)
    {
        if (qry[x].size() > qry[y].size())
            swap(x, y);

        group[x] = y;
        for (int i : qry[x])
            if (qry[y].count(i))
                ans[i] = w, qry[y].erase(i);
            else
                qry[y].insert(i);
    }
}

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

    int N, M;
    cin >> N >> M;

    int a, b, w;
    vector<vector<pair<int, int>>> edge(N + 1);
    for (int i = 0; i < M; i++)
        cin >> a >> b >> w, edge[a].push_back(MP(b, w)), edge[b].push_back(MP(a, w));

    int k, g;
    vector<int> dis(N + 1, 2e9);
    priority_queue<pair<int, int>> pq;
    cin >> k;
    while (k--)
        cin >> g, dis[g] = 0, pq.push(MP(0, g));

    vector<bool> vis(N + 1);
    while (!pq.empty())
    {
        int d = -pq.top().F, u = pq.top().S;
        pq.pop();

        if (vis[u])
            continue;

        vis[u] = true;
        for (auto p : edge[u])
            if (dis[p.F] > d + p.S)
                dis[p.F] = d + p.S, pq.push(MP(-dis[p.F], p.F));
    }

    group.resize(N + 1);
    for (int i = 1; i <= N; i++)
        group[i] = i;

    int Q, s, t;
    cin >> Q, ans.resize(Q);
    qry.resize(N + 1);
    for (int i = 0; i < Q; i++)
        cin >> s >> t, qry[s].insert(i), qry[t].insert(i);

    vector<pair<int, pair<int, int>>> ev;
    for (int i = 1; i <= N; i++)
        for (auto p : edge[i])
            if (i < p.F)
                ev.push_back(MP(min(dis[i], dis[p.F]), MP(i, p.F)));
    sort(ev.begin(), ev.end()), reverse(ev.begin(), ev.end());

    for (auto p : ev)
        uni(p.S.F, p.S.S, p.F);

    for (int i = 0; i < Q; i++)
        cout << ans[i] << '\n';

    return 0;
}

//      *   *  *****  *   *  *   *   ****  ****    ****     **    **
//     *   *  *      **  *  *   *  *      *   *  *        * *   * *
//    *****  *****  * * *  *   *  *      ****   *       *  *     *
//   *   *      *  *  **  *   *  *      *  *   *       *****    *
//  *   *  *****  *   *   ***    ****  *   *    ****     *   *****

//      *****  *****  *   *  *      *****  *   *  *****  *****
//        *   *   *  *   *  *        *    **  *    *    *   *
//       *   *   *  *****  *        *    * * *    *    *****
//   *  *   *   *    *    *        *    *  **    *    *
//  ****   *****    *    *****  *****  *   *    *    *

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 284 ms 25060 KB Output is correct
17 Correct 777 ms 50132 KB Output is correct
18 Correct 48 ms 5100 KB Output is correct
19 Correct 290 ms 27872 KB Output is correct
20 Correct 743 ms 50512 KB Output is correct
21 Correct 457 ms 35296 KB Output is correct
22 Correct 191 ms 26208 KB Output is correct
23 Correct 769 ms 50384 KB Output is correct
24 Correct 755 ms 50260 KB Output is correct
25 Correct 761 ms 50268 KB Output is correct
26 Correct 255 ms 27884 KB Output is correct
27 Correct 259 ms 28004 KB Output is correct
28 Correct 267 ms 27964 KB Output is correct
29 Correct 257 ms 27836 KB Output is correct
30 Correct 274 ms 27872 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 231 ms 21860 KB Output is correct
2 Correct 542 ms 38248 KB Output is correct
3 Correct 504 ms 38360 KB Output is correct
4 Correct 91 ms 14568 KB Output is correct
5 Correct 491 ms 38236 KB Output is correct
6 Correct 516 ms 38280 KB Output is correct
7 Correct 533 ms 38232 KB Output is correct
8 Correct 506 ms 38364 KB Output is correct
9 Correct 546 ms 38216 KB Output is correct
10 Correct 505 ms 38392 KB Output is correct
11 Correct 524 ms 38236 KB Output is correct
12 Correct 498 ms 38432 KB Output is correct
13 Correct 523 ms 38380 KB Output is correct
14 Correct 534 ms 38324 KB Output is correct
15 Correct 508 ms 39144 KB Output is correct
16 Correct 468 ms 38232 KB Output is correct
17 Correct 477 ms 38276 KB Output is correct
18 Correct 517 ms 38368 KB Output is correct
19 Correct 93 ms 14696 KB Output is correct
20 Correct 534 ms 38304 KB Output is correct
21 Correct 502 ms 38536 KB Output is correct
22 Correct 116 ms 17012 KB Output is correct
23 Correct 91 ms 15088 KB Output is correct
24 Correct 111 ms 16876 KB Output is correct
25 Correct 113 ms 16864 KB Output is correct
26 Correct 99 ms 15208 KB Output is correct
27 Correct 79 ms 14568 KB Output is correct
28 Correct 97 ms 16876 KB Output is correct
29 Correct 84 ms 14660 KB Output is correct
30 Correct 100 ms 16864 KB Output is correct
31 Correct 103 ms 14568 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 284 ms 25060 KB Output is correct
17 Correct 777 ms 50132 KB Output is correct
18 Correct 48 ms 5100 KB Output is correct
19 Correct 290 ms 27872 KB Output is correct
20 Correct 743 ms 50512 KB Output is correct
21 Correct 457 ms 35296 KB Output is correct
22 Correct 191 ms 26208 KB Output is correct
23 Correct 769 ms 50384 KB Output is correct
24 Correct 755 ms 50260 KB Output is correct
25 Correct 761 ms 50268 KB Output is correct
26 Correct 255 ms 27884 KB Output is correct
27 Correct 259 ms 28004 KB Output is correct
28 Correct 267 ms 27964 KB Output is correct
29 Correct 257 ms 27836 KB Output is correct
30 Correct 274 ms 27872 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 231 ms 21860 KB Output is correct
42 Correct 542 ms 38248 KB Output is correct
43 Correct 504 ms 38360 KB Output is correct
44 Correct 91 ms 14568 KB Output is correct
45 Correct 491 ms 38236 KB Output is correct
46 Correct 516 ms 38280 KB Output is correct
47 Correct 533 ms 38232 KB Output is correct
48 Correct 506 ms 38364 KB Output is correct
49 Correct 546 ms 38216 KB Output is correct
50 Correct 505 ms 38392 KB Output is correct
51 Correct 524 ms 38236 KB Output is correct
52 Correct 498 ms 38432 KB Output is correct
53 Correct 523 ms 38380 KB Output is correct
54 Correct 534 ms 38324 KB Output is correct
55 Correct 508 ms 39144 KB Output is correct
56 Correct 468 ms 38232 KB Output is correct
57 Correct 477 ms 38276 KB Output is correct
58 Correct 517 ms 38368 KB Output is correct
59 Correct 93 ms 14696 KB Output is correct
60 Correct 534 ms 38304 KB Output is correct
61 Correct 502 ms 38536 KB Output is correct
62 Correct 116 ms 17012 KB Output is correct
63 Correct 91 ms 15088 KB Output is correct
64 Correct 111 ms 16876 KB Output is correct
65 Correct 113 ms 16864 KB Output is correct
66 Correct 99 ms 15208 KB Output is correct
67 Correct 79 ms 14568 KB Output is correct
68 Correct 97 ms 16876 KB Output is correct
69 Correct 84 ms 14660 KB Output is correct
70 Correct 100 ms 16864 KB Output is correct
71 Correct 103 ms 14568 KB Output is correct
72 Correct 460 ms 37632 KB Output is correct
73 Correct 828 ms 51168 KB Output is correct
74 Correct 771 ms 51084 KB Output is correct
75 Correct 771 ms 51236 KB Output is correct
76 Correct 789 ms 51060 KB Output is correct
77 Correct 821 ms 51024 KB Output is correct
78 Correct 781 ms 51016 KB Output is correct
79 Correct 774 ms 51124 KB Output is correct
80 Correct 765 ms 51088 KB Output is correct
81 Correct 762 ms 51064 KB Output is correct
82 Correct 764 ms 51136 KB Output is correct
83 Correct 813 ms 51092 KB Output is correct
84 Correct 802 ms 51040 KB Output is correct
85 Correct 805 ms 51132 KB Output is correct
86 Correct 754 ms 51168 KB Output is correct
87 Correct 798 ms 51012 KB Output is correct
88 Correct 762 ms 50956 KB Output is correct
89 Correct 303 ms 28488 KB Output is correct
90 Correct 765 ms 51156 KB Output is correct
91 Correct 722 ms 51412 KB Output is correct
92 Correct 319 ms 29404 KB Output is correct
93 Correct 447 ms 54372 KB Output is correct
94 Correct 345 ms 29288 KB Output is correct
95 Correct 320 ms 29404 KB Output is correct
96 Correct 506 ms 59080 KB Output is correct
97 Correct 330 ms 30560 KB Output is correct
98 Correct 318 ms 29288 KB Output is correct
99 Correct 354 ms 30432 KB Output is correct
100 Correct 326 ms 29428 KB Output is correct