oj.uz

Submission #334009

# Submission time Handle Problem Language Result Execution time Memory
334009 2020-12-08T05:33:40 Z limabeans Evacuation plan (IZhO18_plan) C++17
100 / 100
 654 ms 55628 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];


int parent(int u) {
    if (par[u]==u) return u;
    return par[u]=parent(par[u]);
}


void join(int u, int v, ll wei) {
    u = parent(u);
    v = parent(v);
    if (u == v) return;

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

    par[v]=u;
    while (nodes[v].size()) {
	int cur = nodes[v].back();
	nodes[v].pop_back();
 
	trans[cur].push_back({wei,u});
	nodes[u].push_back(cur);
    }
    
}


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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 7 ms 7660 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 7 ms 7660 KB Output is correct
6 Correct 7 ms 7660 KB Output is correct
7 Correct 6 ms 7404 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 7660 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 7 ms 7660 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 7 ms 7660 KB Output is correct
6 Correct 7 ms 7660 KB Output is correct
7 Correct 6 ms 7404 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 7660 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 225 ms 28388 KB Output is correct
17 Correct 654 ms 54600 KB Output is correct
18 Correct 42 ms 12384 KB Output is correct
19 Correct 170 ms 29380 KB Output is correct
20 Correct 631 ms 55188 KB Output is correct
21 Correct 360 ms 37576 KB Output is correct
22 Correct 175 ms 29916 KB Output is correct
23 Correct 654 ms 54868 KB Output is correct
24 Correct 642 ms 54600 KB Output is correct
25 Correct 634 ms 55164 KB Output is correct
26 Correct 172 ms 29372 KB Output is correct
27 Correct 175 ms 28464 KB Output is correct
28 Correct 177 ms 29240 KB Output is correct
29 Correct 177 ms 29428 KB Output is correct
30 Correct 172 ms 29488 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 5 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 6 ms 7404 KB Output is correct
8 Correct 6 ms 7404 KB Output is correct
9 Correct 6 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 35048 KB Output is correct
2 Correct 598 ms 54984 KB Output is correct
3 Correct 587 ms 54988 KB Output is correct
4 Correct 166 ms 31944 KB Output is correct
5 Correct 581 ms 54604 KB Output is correct
6 Correct 587 ms 55120 KB Output is correct
7 Correct 587 ms 54856 KB Output is correct
8 Correct 582 ms 54984 KB Output is correct
9 Correct 592 ms 54600 KB Output is correct
10 Correct 594 ms 54728 KB Output is correct
11 Correct 589 ms 54984 KB Output is correct
12 Correct 590 ms 55112 KB Output is correct
13 Correct 592 ms 54748 KB Output is correct
14 Correct 596 ms 54600 KB Output is correct
15 Correct 598 ms 55272 KB Output is correct
16 Correct 611 ms 54988 KB Output is correct
17 Correct 579 ms 54992 KB Output is correct
18 Correct 591 ms 54984 KB Output is correct
19 Correct 128 ms 27868 KB Output is correct
20 Correct 577 ms 54600 KB Output is correct
21 Correct 563 ms 55240 KB Output is correct
22 Correct 125 ms 27824 KB Output is correct
23 Correct 198 ms 36700 KB Output is correct
24 Correct 123 ms 27840 KB Output is correct
25 Correct 131 ms 27896 KB Output is correct
26 Correct 249 ms 38176 KB Output is correct
27 Correct 152 ms 31836 KB Output is correct
28 Correct 130 ms 27840 KB Output is correct
29 Correct 159 ms 31968 KB Output is correct
30 Correct 122 ms 27824 KB Output is correct
31 Correct 164 ms 31836 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 7 ms 7660 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 7 ms 7660 KB Output is correct
6 Correct 7 ms 7660 KB Output is correct
7 Correct 6 ms 7404 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 7660 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 225 ms 28388 KB Output is correct
17 Correct 654 ms 54600 KB Output is correct
18 Correct 42 ms 12384 KB Output is correct
19 Correct 170 ms 29380 KB Output is correct
20 Correct 631 ms 55188 KB Output is correct
21 Correct 360 ms 37576 KB Output is correct
22 Correct 175 ms 29916 KB Output is correct
23 Correct 654 ms 54868 KB Output is correct
24 Correct 642 ms 54600 KB Output is correct
25 Correct 634 ms 55164 KB Output is correct
26 Correct 172 ms 29372 KB Output is correct
27 Correct 175 ms 28464 KB Output is correct
28 Correct 177 ms 29240 KB Output is correct
29 Correct 177 ms 29428 KB Output is correct
30 Correct 172 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 5 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 6 ms 7404 KB Output is correct
38 Correct 6 ms 7404 KB Output is correct
39 Correct 6 ms 7404 KB Output is correct
40 Correct 6 ms 7404 KB Output is correct
41 Correct 323 ms 35048 KB Output is correct
42 Correct 598 ms 54984 KB Output is correct
43 Correct 587 ms 54988 KB Output is correct
44 Correct 166 ms 31944 KB Output is correct
45 Correct 581 ms 54604 KB Output is correct
46 Correct 587 ms 55120 KB Output is correct
47 Correct 587 ms 54856 KB Output is correct
48 Correct 582 ms 54984 KB Output is correct
49 Correct 592 ms 54600 KB Output is correct
50 Correct 594 ms 54728 KB Output is correct
51 Correct 589 ms 54984 KB Output is correct
52 Correct 590 ms 55112 KB Output is correct
53 Correct 592 ms 54748 KB Output is correct
54 Correct 596 ms 54600 KB Output is correct
55 Correct 598 ms 55272 KB Output is correct
56 Correct 611 ms 54988 KB Output is correct
57 Correct 579 ms 54992 KB Output is correct
58 Correct 591 ms 54984 KB Output is correct
59 Correct 128 ms 27868 KB Output is correct
60 Correct 577 ms 54600 KB Output is correct
61 Correct 563 ms 55240 KB Output is correct
62 Correct 125 ms 27824 KB Output is correct
63 Correct 198 ms 36700 KB Output is correct
64 Correct 123 ms 27840 KB Output is correct
65 Correct 131 ms 27896 KB Output is correct
66 Correct 249 ms 38176 KB Output is correct
67 Correct 152 ms 31836 KB Output is correct
68 Correct 130 ms 27840 KB Output is correct
69 Correct 159 ms 31968 KB Output is correct
70 Correct 122 ms 27824 KB Output is correct
71 Correct 164 ms 31836 KB Output is correct
72 Correct 355 ms 37716 KB Output is correct
73 Correct 626 ms 54984 KB Output is correct
74 Correct 624 ms 55476 KB Output is correct
75 Correct 627 ms 55112 KB Output is correct
76 Correct 631 ms 55368 KB Output is correct
77 Correct 638 ms 55240 KB Output is correct
78 Correct 637 ms 55368 KB Output is correct
79 Correct 631 ms 54984 KB Output is correct
80 Correct 640 ms 55240 KB Output is correct
81 Correct 631 ms 55112 KB Output is correct
82 Correct 642 ms 54984 KB Output is correct
83 Correct 639 ms 55112 KB Output is correct
84 Correct 634 ms 55260 KB Output is correct
85 Correct 643 ms 54968 KB Output is correct
86 Correct 630 ms 54984 KB Output is correct
87 Correct 638 ms 54984 KB Output is correct
88 Correct 642 ms 55376 KB Output is correct
89 Correct 176 ms 29916 KB Output is correct
90 Correct 647 ms 54756 KB Output is correct
91 Correct 606 ms 55628 KB Output is correct
92 Correct 166 ms 29360 KB Output is correct
93 Correct 257 ms 38748 KB Output is correct
94 Correct 174 ms 29248 KB Output is correct
95 Correct 171 ms 28592 KB Output is correct
96 Correct 287 ms 39516 KB Output is correct
97 Correct 207 ms 33756 KB Output is correct
98 Correct 171 ms 29248 KB Output is correct
99 Correct 200 ms 33636 KB Output is correct
100 Correct 172 ms 29360 KB Output is correct