oj.uz

답안 #334007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334007 2020-12-08T05:32:43 Z limabeans Evacuation plan (IZhO18_plan) C++17
100 / 100
 678 ms 62212 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;

const ll inf = 1e18;

const int maxn = 1e5 + 5;



int n, m, k;
vector<pair<ll,int>> g[maxn];
vector<pair<ll,pair<int,int>>> edges;

vector<int> a;

ll dist[maxn];

void dijk() {
    for (int i=1; i<=n; i++) {
	dist[i] = inf;
    }
    priority_queue<pair<ll,int>> pq;
    for (int x: a) {
	dist[x] = 0;
	pq.push({0, x});
    }

    while (pq.size()) {
	auto cur = pq.top();
	pq.pop();
	ll d = -cur.first;
	int at = cur.second;
	if (d > dist[at]) continue;

	for (auto ed: g[at]) {
	    int to = ed.second;
	    ll walk = d + ed.first;
	    if (walk < dist[to]) {
		dist[to] = walk;
		pq.push({-dist[to],to});
	    }
	}
    }
}


int par[maxn];

vector<int> nodes[maxn];
vector<pair<ll,int>> trans[maxn];



void join(int u, int v, ll wei) {
    u = par[u];
    v = par[v];
    if (u == v) return;

    if (nodes[u].size()<nodes[v].size()) {
	swap(u,v);
    }

    while (nodes[v].size()) {
	int cur = nodes[v].back();
	nodes[v].pop_back();

	trans[cur].push_back({wei,u});
	nodes[u].push_back(cur);
	par[cur] = u;
    }
    
}


ll solve(int u, int v) {
    if (trans[u].size()>trans[v].size()) {
	swap(u,v);
    }

    int ulen = trans[u].size();
    int vlen = trans[v].size();
    int ans = 0;
    for (int i=1; i<=ulen; i++) {
	if (trans[u][ulen-i].second != trans[v][vlen-i].second) {
	    break;
	}
	ans = min(trans[u][ulen-i].first, trans[v][vlen-i].first);
    }

    return ans;
}


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

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

    cin>>k;
    a.resize(k);
    for (int i=0; i<k; i++) {
	cin>>a[i];
    }

    dijk();

    for (auto &ed: edges) {
	int u = ed.second.first;
	int v = ed.second.second;
	ed.first = min(dist[u],dist[v]);
    }



    //dsu edges from hi to lo
    sort(edges.rbegin(), edges.rend());

    for (int i=1; i<=n; i++) {
	par[i]=i;
	nodes[i].push_back(i);
	trans[i].push_back({inf,i});
    }

    for (auto ed: edges) {
	int u = ed.second.first;
	int v = ed.second.second;
	join(u,v,ed.first);
    }


    int q;
    cin>>q;
    while (q--) {
	int u,v;
	cin>>u>>v;
	cout<<solve(u,v)<<"\n";
    }
    
    
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 6 ms 7660 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7664 KB Output is correct
6 Correct 6 ms 7660 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 6 ms 7404 KB Output is correct
9 Correct 7 ms 7660 KB Output is correct
10 Correct 7 ms 7660 KB Output is correct
11 Correct 7 ms 7660 KB Output is correct
12 Correct 7 ms 7668 KB Output is correct
13 Correct 7 ms 7660 KB Output is correct
14 Correct 7 ms 7660 KB Output is correct
15 Correct 7 ms 7660 KB Output is correct
16 Correct 224 ms 28764 KB Output is correct
17 Correct 667 ms 60744 KB Output is correct
18 Correct 42 ms 12384 KB Output is correct
19 Correct 175 ms 29672 KB Output is correct
20 Correct 628 ms 61264 KB Output is correct
21 Correct 363 ms 39100 KB Output is correct
22 Correct 176 ms 29916 KB Output is correct
23 Correct 654 ms 60932 KB Output is correct
24 Correct 678 ms 61132 KB Output is correct
25 Correct 625 ms 61128 KB Output is correct
26 Correct 186 ms 29416 KB Output is correct
27 Correct 169 ms 29440 KB Output is correct
28 Correct 173 ms 29496 KB Output is correct
29 Correct 190 ms 29448 KB Output is correct
30 Correct 171 ms 29488 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 301 ms 34004 KB Output is correct
2 Correct 587 ms 59464 KB Output is correct
3 Correct 601 ms 59212 KB Output is correct
4 Correct 157 ms 32048 KB Output is correct
5 Correct 598 ms 59256 KB Output is correct
6 Correct 580 ms 59336 KB Output is correct
7 Correct 605 ms 59160 KB Output is correct
8 Correct 574 ms 59404 KB Output is correct
9 Correct 577 ms 59024 KB Output is correct
10 Correct 590 ms 59144 KB Output is correct
11 Correct 566 ms 59592 KB Output is correct
12 Correct 567 ms 59388 KB Output is correct
13 Correct 613 ms 59080 KB Output is correct
14 Correct 572 ms 59224 KB Output is correct
15 Correct 595 ms 59608 KB Output is correct
16 Correct 569 ms 59336 KB Output is correct
17 Correct 587 ms 59624 KB Output is correct
18 Correct 599 ms 59464 KB Output is correct
19 Correct 131 ms 27868 KB Output is correct
20 Correct 581 ms 59216 KB Output is correct
21 Correct 556 ms 60324 KB Output is correct
22 Correct 126 ms 27824 KB Output is correct
23 Correct 196 ms 36700 KB Output is correct
24 Correct 129 ms 27840 KB Output is correct
25 Correct 124 ms 27824 KB Output is correct
26 Correct 230 ms 38108 KB Output is correct
27 Correct 153 ms 31836 KB Output is correct
28 Correct 125 ms 27840 KB Output is correct
29 Correct 160 ms 31964 KB Output is correct
30 Correct 123 ms 27824 KB Output is correct
31 Correct 156 ms 31976 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 6 ms 7660 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 6 ms 7664 KB Output is correct
6 Correct 6 ms 7660 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 6 ms 7404 KB Output is correct
9 Correct 7 ms 7660 KB Output is correct
10 Correct 7 ms 7660 KB Output is correct
11 Correct 7 ms 7660 KB Output is correct
12 Correct 7 ms 7668 KB Output is correct
13 Correct 7 ms 7660 KB Output is correct
14 Correct 7 ms 7660 KB Output is correct
15 Correct 7 ms 7660 KB Output is correct
16 Correct 224 ms 28764 KB Output is correct
17 Correct 667 ms 60744 KB Output is correct
18 Correct 42 ms 12384 KB Output is correct
19 Correct 175 ms 29672 KB Output is correct
20 Correct 628 ms 61264 KB Output is correct
21 Correct 363 ms 39100 KB Output is correct
22 Correct 176 ms 29916 KB Output is correct
23 Correct 654 ms 60932 KB Output is correct
24 Correct 678 ms 61132 KB Output is correct
25 Correct 625 ms 61128 KB Output is correct
26 Correct 186 ms 29416 KB Output is correct
27 Correct 169 ms 29440 KB Output is correct
28 Correct 173 ms 29496 KB Output is correct
29 Correct 190 ms 29448 KB Output is correct
30 Correct 171 ms 29488 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 5 ms 7404 KB Output is correct
33 Correct 7 ms 7404 KB Output is correct
34 Correct 5 ms 7404 KB Output is correct
35 Correct 5 ms 7404 KB Output is correct
36 Correct 6 ms 7404 KB Output is correct
37 Correct 5 ms 7404 KB Output is correct
38 Correct 5 ms 7404 KB Output is correct
39 Correct 5 ms 7404 KB Output is correct
40 Correct 6 ms 7404 KB Output is correct
41 Correct 301 ms 34004 KB Output is correct
42 Correct 587 ms 59464 KB Output is correct
43 Correct 601 ms 59212 KB Output is correct
44 Correct 157 ms 32048 KB Output is correct
45 Correct 598 ms 59256 KB Output is correct
46 Correct 580 ms 59336 KB Output is correct
47 Correct 605 ms 59160 KB Output is correct
48 Correct 574 ms 59404 KB Output is correct
49 Correct 577 ms 59024 KB Output is correct
50 Correct 590 ms 59144 KB Output is correct
51 Correct 566 ms 59592 KB Output is correct
52 Correct 567 ms 59388 KB Output is correct
53 Correct 613 ms 59080 KB Output is correct
54 Correct 572 ms 59224 KB Output is correct
55 Correct 595 ms 59608 KB Output is correct
56 Correct 569 ms 59336 KB Output is correct
57 Correct 587 ms 59624 KB Output is correct
58 Correct 599 ms 59464 KB Output is correct
59 Correct 131 ms 27868 KB Output is correct
60 Correct 581 ms 59216 KB Output is correct
61 Correct 556 ms 60324 KB Output is correct
62 Correct 126 ms 27824 KB Output is correct
63 Correct 196 ms 36700 KB Output is correct
64 Correct 129 ms 27840 KB Output is correct
65 Correct 124 ms 27824 KB Output is correct
66 Correct 230 ms 38108 KB Output is correct
67 Correct 153 ms 31836 KB Output is correct
68 Correct 125 ms 27840 KB Output is correct
69 Correct 160 ms 31964 KB Output is correct
70 Correct 123 ms 27824 KB Output is correct
71 Correct 156 ms 31976 KB Output is correct
72 Correct 343 ms 38740 KB Output is correct
73 Correct 643 ms 60796 KB Output is correct
74 Correct 621 ms 61228 KB Output is correct
75 Correct 614 ms 60872 KB Output is correct
76 Correct 605 ms 61128 KB Output is correct
77 Correct 625 ms 61132 KB Output is correct
78 Correct 610 ms 61256 KB Output is correct
79 Correct 618 ms 60796 KB Output is correct
80 Correct 615 ms 61128 KB Output is correct
81 Correct 616 ms 60856 KB Output is correct
82 Correct 608 ms 60840 KB Output is correct
83 Correct 616 ms 60936 KB Output is correct
84 Correct 607 ms 61000 KB Output is correct
85 Correct 614 ms 60864 KB Output is correct
86 Correct 599 ms 61000 KB Output is correct
87 Correct 611 ms 61136 KB Output is correct
88 Correct 611 ms 61128 KB Output is correct
89 Correct 174 ms 29976 KB Output is correct
90 Correct 618 ms 60872 KB Output is correct
91 Correct 600 ms 62212 KB Output is correct
92 Correct 173 ms 29596 KB Output is correct
93 Correct 248 ms 38748 KB Output is correct
94 Correct 169 ms 29248 KB Output is correct
95 Correct 178 ms 29360 KB Output is correct
96 Correct 294 ms 39772 KB Output is correct
97 Correct 202 ms 33756 KB Output is correct
98 Correct 171 ms 29248 KB Output is correct
99 Correct 206 ms 33884 KB Output is correct
100 Correct 170 ms 29528 KB Output is correct