oj.uz

답안 #492418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492418 2021-12-07T08:00:59 Z duchung Evacuation plan (IZhO18_plan) C++17
100 / 100
 564 ms 53044 KB 
#include<bits/stdc++.h>
using namespace std;

#define ii pair<int , int>
const int N = 1e5 + 5;

int n , m , k , q;
vector<pair<int , int>> edge[N];
int dist[N] , level[N] , parent[N];
priority_queue<ii , vector<ii> , greater<ii>> pq;
set<int> S[N];
vector<ii> tmp;
int ans[N];

void dijkstra()
{
    while(!pq.empty())
    {
        int u = pq.top().second;
        int dist_u = pq.top().first;
        pq.pop();

        if (dist_u != dist[u]) continue;

        for (auto adj : edge[u])
        {
            int v = adj.first;
            int w = adj.second;

            if (dist[v] > dist[u] + w)
            {
                dist[v] = dist[u] + w;
                pq.push({dist[v] , v});
            }
        }
    }
}

int find_set(int u)
{
    return (u == parent[u] ? u : parent[u] = find_set(parent[u]));
}

void union_set(int u , int v , int w)
{
    u = find_set(u);
    v = find_set(v);
    if (u == v) return;

    if (level[u] < level[v]) swap(u , v);
    parent[v] = u;
    if (level[u] == level[v]) ++level[u];

    if ((int) S[u].size() < (int) S[v].size()) swap(S[u] , S[v]);

    for (int x : S[v])
    {
        if (S[u].find(x) != S[u].end())
        {
            ans[x] = w;
            S[u].erase(x);
        }
        else
        {
            S[u].insert(x);
        }
    }

}

int main()
{
    // freopen(".inp","r",stdin);
    // freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    for (int i = 1 ; i <= m ; ++i)
    {
        int u , v , w;
        cin >> u >> v >> w;
        edge[u].push_back({v , w});
        edge[v].push_back({u , w});
    }

    for (int i = 1 ; i <= n ; ++i) dist[i] = 2e9 , parent[i] = i , level[i] = 0;

    cin >> k;
    for (int i = 1 ; i <= k ; ++i)
    {
        int u;
        cin >> u;
        pq.push({dist[u] = 0 , u});
    }

    dijkstra();

    cin >> q;
    for (int i = 1 ; i <= q ; ++i)
    {
        int u , v;
        cin >> u >> v;
        S[u].insert(i);
        S[v].insert(i);
    }

    // for (int i = 1 ; i <= n ; ++i) cout << dist[i] << " ";
    // cout << "\n";

    for (int i = 1 ; i <= n ; ++i) tmp.push_back({dist[i] , i});
    sort(tmp.begin() , tmp.end() , greater<ii> ());

    for (auto x : tmp)
    {
        int w = x.first , u = x.second;
        for (auto adj : edge[u])
        {
            int v = adj.first;
            if (dist[v] >= w) union_set(u , v , w);
        }
    }

    for (int i = 1 ; i <= q ; ++i) cout << ans[i] << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7372 KB Output is correct
2 Correct 5 ms 7500 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 3 ms 7372 KB Output is correct
5 Correct 4 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7500 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 4 ms 7500 KB Output is correct
12 Correct 5 ms 7500 KB Output is correct
13 Correct 5 ms 7500 KB Output is correct
14 Correct 5 ms 7516 KB Output is correct
15 Correct 4 ms 7500 KB Output is correct
16 Correct 214 ms 23336 KB Output is correct
17 Correct 503 ms 36032 KB Output is correct
18 Correct 37 ms 10180 KB Output is correct
19 Correct 195 ms 24312 KB Output is correct
20 Correct 489 ms 36164 KB Output is correct
21 Correct 300 ms 29500 KB Output is correct
22 Correct 133 ms 23128 KB Output is correct
23 Correct 496 ms 36032 KB Output is correct
24 Correct 501 ms 35976 KB Output is correct
25 Correct 533 ms 36132 KB Output is correct
26 Correct 207 ms 24132 KB Output is correct
27 Correct 195 ms 24196 KB Output is correct
28 Correct 191 ms 24132 KB Output is correct
29 Correct 204 ms 24140 KB Output is correct
30 Correct 187 ms 24324 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 16560 KB Output is correct
2 Correct 324 ms 25048 KB Output is correct
3 Correct 304 ms 25140 KB Output is correct
4 Correct 57 ms 12732 KB Output is correct
5 Correct 316 ms 25092 KB Output is correct
6 Correct 314 ms 25016 KB Output is correct
7 Correct 310 ms 25016 KB Output is correct
8 Correct 309 ms 25012 KB Output is correct
9 Correct 309 ms 24952 KB Output is correct
10 Correct 312 ms 25088 KB Output is correct
11 Correct 319 ms 25040 KB Output is correct
12 Correct 310 ms 25036 KB Output is correct
13 Correct 307 ms 25040 KB Output is correct
14 Correct 298 ms 25028 KB Output is correct
15 Correct 340 ms 25352 KB Output is correct
16 Correct 314 ms 25020 KB Output is correct
17 Correct 317 ms 25132 KB Output is correct
18 Correct 310 ms 25104 KB Output is correct
19 Correct 58 ms 12716 KB Output is correct
20 Correct 306 ms 25064 KB Output is correct
21 Correct 282 ms 24764 KB Output is correct
22 Correct 69 ms 14672 KB Output is correct
23 Correct 65 ms 13244 KB Output is correct
24 Correct 78 ms 14652 KB Output is correct
25 Correct 69 ms 14724 KB Output is correct
26 Correct 74 ms 13372 KB Output is correct
27 Correct 57 ms 12764 KB Output is correct
28 Correct 68 ms 14748 KB Output is correct
29 Correct 57 ms 12744 KB Output is correct
30 Correct 72 ms 14668 KB Output is correct
31 Correct 63 ms 12752 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7372 KB Output is correct
2 Correct 5 ms 7500 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 3 ms 7372 KB Output is correct
5 Correct 4 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7500 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 4 ms 7500 KB Output is correct
12 Correct 5 ms 7500 KB Output is correct
13 Correct 5 ms 7500 KB Output is correct
14 Correct 5 ms 7516 KB Output is correct
15 Correct 4 ms 7500 KB Output is correct
16 Correct 214 ms 23336 KB Output is correct
17 Correct 503 ms 36032 KB Output is correct
18 Correct 37 ms 10180 KB Output is correct
19 Correct 195 ms 24312 KB Output is correct
20 Correct 489 ms 36164 KB Output is correct
21 Correct 300 ms 29500 KB Output is correct
22 Correct 133 ms 23128 KB Output is correct
23 Correct 496 ms 36032 KB Output is correct
24 Correct 501 ms 35976 KB Output is correct
25 Correct 533 ms 36132 KB Output is correct
26 Correct 207 ms 24132 KB Output is correct
27 Correct 195 ms 24196 KB Output is correct
28 Correct 191 ms 24132 KB Output is correct
29 Correct 204 ms 24140 KB Output is correct
30 Correct 187 ms 24324 KB Output is correct
31 Correct 4 ms 7372 KB Output is correct
32 Correct 4 ms 7372 KB Output is correct
33 Correct 4 ms 7372 KB Output is correct
34 Correct 3 ms 7372 KB Output is correct
35 Correct 4 ms 7372 KB Output is correct
36 Correct 4 ms 7372 KB Output is correct
37 Correct 4 ms 7300 KB Output is correct
38 Correct 4 ms 7372 KB Output is correct
39 Correct 4 ms 7372 KB Output is correct
40 Correct 3 ms 7372 KB Output is correct
41 Correct 143 ms 16560 KB Output is correct
42 Correct 324 ms 25048 KB Output is correct
43 Correct 304 ms 25140 KB Output is correct
44 Correct 57 ms 12732 KB Output is correct
45 Correct 316 ms 25092 KB Output is correct
46 Correct 314 ms 25016 KB Output is correct
47 Correct 310 ms 25016 KB Output is correct
48 Correct 309 ms 25012 KB Output is correct
49 Correct 309 ms 24952 KB Output is correct
50 Correct 312 ms 25088 KB Output is correct
51 Correct 319 ms 25040 KB Output is correct
52 Correct 310 ms 25036 KB Output is correct
53 Correct 307 ms 25040 KB Output is correct
54 Correct 298 ms 25028 KB Output is correct
55 Correct 340 ms 25352 KB Output is correct
56 Correct 314 ms 25020 KB Output is correct
57 Correct 317 ms 25132 KB Output is correct
58 Correct 310 ms 25104 KB Output is correct
59 Correct 58 ms 12716 KB Output is correct
60 Correct 306 ms 25064 KB Output is correct
61 Correct 282 ms 24764 KB Output is correct
62 Correct 69 ms 14672 KB Output is correct
63 Correct 65 ms 13244 KB Output is correct
64 Correct 78 ms 14652 KB Output is correct
65 Correct 69 ms 14724 KB Output is correct
66 Correct 74 ms 13372 KB Output is correct
67 Correct 57 ms 12764 KB Output is correct
68 Correct 68 ms 14748 KB Output is correct
69 Correct 57 ms 12744 KB Output is correct
70 Correct 72 ms 14668 KB Output is correct
71 Correct 63 ms 12752 KB Output is correct
72 Correct 328 ms 31700 KB Output is correct
73 Correct 528 ms 37064 KB Output is correct
74 Correct 503 ms 36924 KB Output is correct
75 Correct 564 ms 36796 KB Output is correct
76 Correct 514 ms 36876 KB Output is correct
77 Correct 517 ms 36876 KB Output is correct
78 Correct 530 ms 37044 KB Output is correct
79 Correct 544 ms 36868 KB Output is correct
80 Correct 515 ms 36924 KB Output is correct
81 Correct 542 ms 36812 KB Output is correct
82 Correct 527 ms 37044 KB Output is correct
83 Correct 503 ms 36840 KB Output is correct
84 Correct 518 ms 36780 KB Output is correct
85 Correct 534 ms 36916 KB Output is correct
86 Correct 515 ms 36748 KB Output is correct
87 Correct 537 ms 36856 KB Output is correct
88 Correct 510 ms 36796 KB Output is correct
89 Correct 223 ms 25396 KB Output is correct
90 Correct 522 ms 36956 KB Output is correct
91 Correct 497 ms 36964 KB Output is correct
92 Correct 246 ms 26508 KB Output is correct
93 Correct 315 ms 49404 KB Output is correct
94 Correct 231 ms 26300 KB Output is correct
95 Correct 247 ms 26428 KB Output is correct
96 Correct 360 ms 53044 KB Output is correct
97 Correct 254 ms 27416 KB Output is correct
98 Correct 234 ms 26236 KB Output is correct
99 Correct 251 ms 27468 KB Output is correct
100 Correct 263 ms 26624 KB Output is correct