oj.uz

Submission #42501

# Submission time Handle Problem Language Result Execution time Memory
42501 2018-02-27T22:58:10 Z MatheusLealV Evacuation plan (IZhO18_plan) C++14
100 / 100
 655 ms 34952 KB 
#include <bits/stdc++.h>
#define N 100005
#define inf 2000000000
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

int n, m, k, q, P[N], id[N], dist[N], rev[N], pai[N], peso[N];

vector<pii> grafo[N];

list<int> l[N];

list<pii> hist[N];

void dijkstra()
{
	priority_queue<pii, vector<pii>, greater<pii> > pq;

	for(int i = 1; i <= n; i++) dist[i] = inf;

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

	while(!pq.empty())
	{
		int x = pq.top().s, d = pq.top().f;

		pq.pop();

		if(d > dist[x]) continue;

		for(auto v: grafo[x])
		{
			if(dist[v.f] > dist[x] + v.s)
			{
				dist[v.f] = dist[x] + v.s;

				pq.push({dist[v.f], v.f});
			}
		}
	}

	vector<pii> v;

	for(int i = 1; i <= n; i++) v.push_back({dist[i], i});

	sort(v.begin(), v.end());

	for(int i = 0; i < v.size(); i++) id[ v[i].s ] = i + 1, rev[i + 1] = v[i].s;
}

void persistent_join(int a, int b, int t)
{
	a = pai[a], b = pai[b];

	if(a != b)
	{
        if(peso[a] > peso[b]) swap(a, b);

        for(auto it = l[a].begin(); it != l[a].end(); it++)
        {
                hist[*it].push_back(pii(t, b));

                pai[*it] = b;
        }

        peso[b] += peso[a];

        l[b].splice(l[b].end(), l[a]);
	}
}

int p_query(int a, int b)
{
	int ans = 0;

	for(auto x: hist[a])
		for(auto y: hist[b])
			if(x.s == y.s)
				ans = max(ans, min(x.f, y.f));

	return ans;
}

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

	cin>>n>>m;

	for(int i = 1, a, b, c; i <= m; i++)
	{
		cin>>a>>b>>c;

		grafo[a].push_back({b, c});

		grafo[b].push_back({a, c});
	}

	cin>>k;

	for(int i = 1; i <= k; i++) cin>>P[i];

	dijkstra();

    for(int i = 1; i <= n; i++)
    {
        l[i].push_back(i);

        hist[i].push_back(pii(dist[i], i));

        peso[i] = 1, pai[i] = i;
    }

	for(int x = n; x >= 1; x--)
	{
		int xi = rev[x];

		for(auto v: grafo[xi])

			if(id[v.f] > x) persistent_join(v.f, xi, dist[xi]);
	}

	cin>>q;

	for(int t = 1, a, b; t <= q; t++)
	{
		cin>>a>>b;

		cout<<p_query(a, b)<<"\n";
	}
}

Compilation message

plan.cpp: In function 'void dijkstra()':
plan.cpp:51:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); i++) id[ v[i].s ] = i + 1, rev[i + 1] = v[i].s;
                 ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 9 ms 7500 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 9 ms 7624 KB Output is correct
10 Correct 9 ms 7644 KB Output is correct
11 Correct 9 ms 7672 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7672 KB Output is correct
14 Correct 9 ms 7672 KB Output is correct
15 Correct 9 ms 7672 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 9 ms 7500 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 9 ms 7624 KB Output is correct
10 Correct 9 ms 7644 KB Output is correct
11 Correct 9 ms 7672 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7672 KB Output is correct
14 Correct 9 ms 7672 KB Output is correct
15 Correct 9 ms 7672 KB Output is correct
16 Correct 256 ms 22252 KB Output is correct
17 Correct 598 ms 32752 KB Output is correct
18 Correct 43 ms 10412 KB Output is correct
19 Correct 218 ms 23572 KB Output is correct
20 Correct 622 ms 33088 KB Output is correct
21 Correct 352 ms 26704 KB Output is correct
22 Correct 231 ms 23332 KB Output is correct
23 Correct 635 ms 33068 KB Output is correct
24 Correct 602 ms 33480 KB Output is correct
25 Correct 623 ms 33004 KB Output is correct
26 Correct 229 ms 23244 KB Output is correct
27 Correct 237 ms 23208 KB Output is correct
28 Correct 236 ms 23012 KB Output is correct
29 Correct 240 ms 23220 KB Output is correct
30 Correct 246 ms 23332 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 10 ms 7416 KB Output is correct
3 Correct 9 ms 7384 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 8 ms 7416 KB Output is correct
6 Correct 9 ms 7432 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 8 ms 7416 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 25704 KB Output is correct
2 Correct 565 ms 31888 KB Output is correct
3 Correct 543 ms 31804 KB Output is correct
4 Correct 154 ms 23448 KB Output is correct
5 Correct 532 ms 32516 KB Output is correct
6 Correct 539 ms 32576 KB Output is correct
7 Correct 536 ms 32332 KB Output is correct
8 Correct 534 ms 32316 KB Output is correct
9 Correct 546 ms 32320 KB Output is correct
10 Correct 526 ms 32488 KB Output is correct
11 Correct 557 ms 32500 KB Output is correct
12 Correct 536 ms 32312 KB Output is correct
13 Correct 563 ms 32688 KB Output is correct
14 Correct 560 ms 32464 KB Output is correct
15 Correct 534 ms 32432 KB Output is correct
16 Correct 548 ms 32544 KB Output is correct
17 Correct 541 ms 32492 KB Output is correct
18 Correct 552 ms 32576 KB Output is correct
19 Correct 152 ms 22216 KB Output is correct
20 Correct 572 ms 32652 KB Output is correct
21 Correct 514 ms 32988 KB Output is correct
22 Correct 167 ms 22844 KB Output is correct
23 Correct 231 ms 31632 KB Output is correct
24 Correct 170 ms 22856 KB Output is correct
25 Correct 165 ms 22824 KB Output is correct
26 Correct 280 ms 32320 KB Output is correct
27 Correct 161 ms 23628 KB Output is correct
28 Correct 165 ms 22984 KB Output is correct
29 Correct 179 ms 23708 KB Output is correct
30 Correct 181 ms 23016 KB Output is correct
31 Correct 210 ms 23820 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 9 ms 7500 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 9 ms 7624 KB Output is correct
10 Correct 9 ms 7644 KB Output is correct
11 Correct 9 ms 7672 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7672 KB Output is correct
14 Correct 9 ms 7672 KB Output is correct
15 Correct 9 ms 7672 KB Output is correct
16 Correct 256 ms 22252 KB Output is correct
17 Correct 598 ms 32752 KB Output is correct
18 Correct 43 ms 10412 KB Output is correct
19 Correct 218 ms 23572 KB Output is correct
20 Correct 622 ms 33088 KB Output is correct
21 Correct 352 ms 26704 KB Output is correct
22 Correct 231 ms 23332 KB Output is correct
23 Correct 635 ms 33068 KB Output is correct
24 Correct 602 ms 33480 KB Output is correct
25 Correct 623 ms 33004 KB Output is correct
26 Correct 229 ms 23244 KB Output is correct
27 Correct 237 ms 23208 KB Output is correct
28 Correct 236 ms 23012 KB Output is correct
29 Correct 240 ms 23220 KB Output is correct
30 Correct 246 ms 23332 KB Output is correct
31 Correct 8 ms 7416 KB Output is correct
32 Correct 10 ms 7416 KB Output is correct
33 Correct 9 ms 7384 KB Output is correct
34 Correct 9 ms 7416 KB Output is correct
35 Correct 8 ms 7416 KB Output is correct
36 Correct 9 ms 7432 KB Output is correct
37 Correct 8 ms 7416 KB Output is correct
38 Correct 8 ms 7416 KB Output is correct
39 Correct 8 ms 7416 KB Output is correct
40 Correct 8 ms 7416 KB Output is correct
41 Correct 292 ms 25704 KB Output is correct
42 Correct 565 ms 31888 KB Output is correct
43 Correct 543 ms 31804 KB Output is correct
44 Correct 154 ms 23448 KB Output is correct
45 Correct 532 ms 32516 KB Output is correct
46 Correct 539 ms 32576 KB Output is correct
47 Correct 536 ms 32332 KB Output is correct
48 Correct 534 ms 32316 KB Output is correct
49 Correct 546 ms 32320 KB Output is correct
50 Correct 526 ms 32488 KB Output is correct
51 Correct 557 ms 32500 KB Output is correct
52 Correct 536 ms 32312 KB Output is correct
53 Correct 563 ms 32688 KB Output is correct
54 Correct 560 ms 32464 KB Output is correct
55 Correct 534 ms 32432 KB Output is correct
56 Correct 548 ms 32544 KB Output is correct
57 Correct 541 ms 32492 KB Output is correct
58 Correct 552 ms 32576 KB Output is correct
59 Correct 152 ms 22216 KB Output is correct
60 Correct 572 ms 32652 KB Output is correct
61 Correct 514 ms 32988 KB Output is correct
62 Correct 167 ms 22844 KB Output is correct
63 Correct 231 ms 31632 KB Output is correct
64 Correct 170 ms 22856 KB Output is correct
65 Correct 165 ms 22824 KB Output is correct
66 Correct 280 ms 32320 KB Output is correct
67 Correct 161 ms 23628 KB Output is correct
68 Correct 165 ms 22984 KB Output is correct
69 Correct 179 ms 23708 KB Output is correct
70 Correct 181 ms 23016 KB Output is correct
71 Correct 210 ms 23820 KB Output is correct
72 Correct 364 ms 26672 KB Output is correct
73 Correct 620 ms 32996 KB Output is correct
74 Correct 592 ms 34424 KB Output is correct
75 Correct 621 ms 34800 KB Output is correct
76 Correct 622 ms 34820 KB Output is correct
77 Correct 601 ms 34952 KB Output is correct
78 Correct 617 ms 34792 KB Output is correct
79 Correct 626 ms 34452 KB Output is correct
80 Correct 615 ms 33956 KB Output is correct
81 Correct 610 ms 34504 KB Output is correct
82 Correct 634 ms 34076 KB Output is correct
83 Correct 655 ms 33932 KB Output is correct
84 Correct 642 ms 34564 KB Output is correct
85 Correct 598 ms 34476 KB Output is correct
86 Correct 589 ms 34328 KB Output is correct
87 Correct 575 ms 33920 KB Output is correct
88 Correct 595 ms 34740 KB Output is correct
89 Correct 217 ms 24608 KB Output is correct
90 Correct 618 ms 34660 KB Output is correct
91 Correct 561 ms 34048 KB Output is correct
92 Correct 234 ms 24736 KB Output is correct
93 Correct 336 ms 33708 KB Output is correct
94 Correct 229 ms 24596 KB Output is correct
95 Correct 228 ms 24500 KB Output is correct
96 Correct 394 ms 34864 KB Output is correct
97 Correct 229 ms 25680 KB Output is correct
98 Correct 218 ms 24012 KB Output is correct
99 Correct 250 ms 25808 KB Output is correct
100 Correct 224 ms 24564 KB Output is correct