oj.uz

Submission #50845

# Submission time Handle Problem Language Result Execution time Memory
50845 2018-06-13T16:36:16 Z Nicksechko Evacuation plan (IZhO18_plan) C++14
100 / 100
 1150 ms 49156 KB 
#include <bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define mp make_pair
#define pb push_back
#define sz(x) ((int)((x).size()))
#define all(x) (x).begin(),(x).end()
#define deb(x) cerr << "(" << #x << " = " << x << ")\n";

typedef long long ll;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef vector<int> VI;

const int MAXN = 100100;
const int MAXA = 100100;
const int MAXB = 100100;
const int INF = 1e9;
const int LOGN = 17;

int n, m, A, B;
vector < PII > g[MAXN];
vector < int > gr[MAXN];
int bad[MAXA];
PII ev[MAXB];
int id[MAXN];
int sh[MAXN];
set < PII > q;

inline bool cmp(int i, int j) {
	return sh[i] > sh[j];
}

void dijkstra() {

	while(!q.empty()) {
		int v = q.begin() -> S;
		q.erase(q.begin());
		for(int i = 0; i < sz(g[v]); ++i) {
			int to = g[v][i].F;
			int w = g[v][i].S;
			if(sh[to] > sh[v] + w) {
				q.erase( mp(sh[to], to) );
				sh[to] = sh[v] + w;
				q.insert( mp(sh[to], to) );
			}
		}
	}
}

int p[MAXN];
int sz[MAXN];

inline int Find(int v) {
	return v == p[v] ? v : p[v] = Find(p[v]);
}

inline void Uni(int a, int b) {
	if(sz[a] >= sz[b])
		p[b] = a, sz[a] += sz[b];
	else
		p[a] = b, sz[b] += sz[a];
}

int tin[MAXN];
int tout[MAXN];
int timer;
int up[MAXN][LOGN + 5];
int mn[MAXN][LOGN + 5];

void dfs(int v, int p = 0) {
	tin[v] = ++timer;
	up[v][0] = p;
	mn[v][0] = sh[v];
	for(int i = 1; i <= LOGN; ++i) {
		up[v][i] = up[up[v][i-1]][i-1];
		mn[v][i] = min(mn[v][i-1], mn[up[v][i-1]][i-1]);
	}
	for(int to : gr[v]) {
		if(to != p) {
			dfs(to, v);
		}
	}
	tout[v] = ++timer;
}

inline bool upper(int a, int b) {
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}

inline int lca(int a, int b) {
	if(upper(a, b)) return a;
	if(upper(b, a)) return b;
	for(int i = LOGN; i >= 0; --i) {
		if(up[a][i] != 0 && !upper(up[a][i], b)) {
			a = up[a][i];
		}
	}
	return up[a][0];
}

int calc(int a, int b) {
	if(a == b) return sh[a];
	int c = lca(a, b);
	int res = INF;
	for(int i = LOGN; i >= 0; --i) {
		if(up[a][i] != 0 && !upper(up[a][i], c)) {
			res = min(res, mn[a][i]);
			a = up[a][i];
		}
		if(up[b][i] != 0 && !upper(up[b][i], c)) {
			res = min(res, mn[b][i]);
			b = up[b][i];
		}
	}
	res = min(res, mn[a][0]);
	res = min(res, mn[b][0]);
	res = min(res, sh[c]);
	return res;
}

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

    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
    	int x, y, z;
    	cin >> x >> y >> z;
    	g[x].pb( mp(y, z) );
    	g[y].pb( mp(x, z) );
    }

    for(int i = 1; i <= n; ++i) {
    	sh[i] = INF;
    	id[i] = i;
    }

    cin >> A;
    for(int i = 1; i <= A; ++i) {
    	cin >> bad[i];
    	q.insert( mp(sh[bad[i]] = 0, bad[i]) );
    }
    dijkstra();
    sort(id + 1, id + n + 1, &cmp);

    for(int i = 1; i <= n; ++i) {
    	p[i] = i, sz[i] = 1;
    }
    for(int it = 1; it <= n; ++it) {
    	int i = id[it];
		for(PII j : g[i]) {
			if(sh[j.F] >= sh[i] && Find(i) != Find(j.F)) {
				Uni(Find(i), Find(j.F));
				gr[i].pb(j.F);
				gr[j.F].pb(i);
			}
		}
    }
    sh[0] = INF;
    dfs(1);

    ll ans = 0;
    cin >> B;
    for(int i = 1; i <= B; ++i) {
    	int x, y;
    	cin >> x >> y;
    	cout << calc(x, y) << endl;
    }

    return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:166:8: warning: unused variable 'ans' [-Wunused-variable]
     ll ans = 0;
        ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5116 KB Output is correct
2 Correct 10 ms 5340 KB Output is correct
3 Correct 10 ms 5368 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 5368 KB Output is correct
6 Correct 10 ms 5368 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct
10 Correct 10 ms 5368 KB Output is correct
11 Correct 10 ms 5368 KB Output is correct
12 Correct 10 ms 5368 KB Output is correct
13 Correct 10 ms 5368 KB Output is correct
14 Correct 10 ms 5368 KB Output is correct
15 Correct 10 ms 5368 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5116 KB Output is correct
2 Correct 10 ms 5340 KB Output is correct
3 Correct 10 ms 5368 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 5368 KB Output is correct
6 Correct 10 ms 5368 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct
10 Correct 10 ms 5368 KB Output is correct
11 Correct 10 ms 5368 KB Output is correct
12 Correct 10 ms 5368 KB Output is correct
13 Correct 10 ms 5368 KB Output is correct
14 Correct 10 ms 5368 KB Output is correct
15 Correct 10 ms 5368 KB Output is correct
16 Correct 532 ms 27672 KB Output is correct
17 Correct 1004 ms 43332 KB Output is correct
18 Correct 77 ms 9848 KB Output is correct
19 Correct 521 ms 35560 KB Output is correct
20 Correct 1047 ms 42672 KB Output is correct
21 Correct 698 ms 35384 KB Output is correct
22 Correct 545 ms 37476 KB Output is correct
23 Correct 1056 ms 42580 KB Output is correct
24 Correct 1049 ms 43524 KB Output is correct
25 Correct 1045 ms 43408 KB Output is correct
26 Correct 516 ms 34376 KB Output is correct
27 Correct 526 ms 34516 KB Output is correct
28 Correct 517 ms 34088 KB Output is correct
29 Correct 538 ms 34616 KB Output is correct
30 Correct 523 ms 34724 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5060 KB Output is correct
2 Correct 7 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5084 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 6 ms 5060 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5084 KB Output is correct
10 Correct 7 ms 5124 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 33760 KB Output is correct
2 Correct 708 ms 42344 KB Output is correct
3 Correct 682 ms 42416 KB Output is correct
4 Correct 197 ms 34424 KB Output is correct
5 Correct 695 ms 42452 KB Output is correct
6 Correct 721 ms 42800 KB Output is correct
7 Correct 693 ms 43044 KB Output is correct
8 Correct 702 ms 43384 KB Output is correct
9 Correct 699 ms 44356 KB Output is correct
10 Correct 700 ms 44332 KB Output is correct
11 Correct 675 ms 45052 KB Output is correct
12 Correct 679 ms 44900 KB Output is correct
13 Correct 676 ms 45056 KB Output is correct
14 Correct 677 ms 44652 KB Output is correct
15 Correct 704 ms 45592 KB Output is correct
16 Correct 704 ms 46972 KB Output is correct
17 Correct 711 ms 45664 KB Output is correct
18 Correct 691 ms 45220 KB Output is correct
19 Correct 198 ms 36508 KB Output is correct
20 Correct 687 ms 45208 KB Output is correct
21 Correct 653 ms 49156 KB Output is correct
22 Correct 191 ms 34920 KB Output is correct
23 Correct 191 ms 33596 KB Output is correct
24 Correct 194 ms 34796 KB Output is correct
25 Correct 194 ms 34924 KB Output is correct
26 Correct 206 ms 33912 KB Output is correct
27 Correct 201 ms 36600 KB Output is correct
28 Correct 195 ms 34788 KB Output is correct
29 Correct 197 ms 36088 KB Output is correct
30 Correct 198 ms 34864 KB Output is correct
31 Correct 192 ms 35896 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5116 KB Output is correct
2 Correct 10 ms 5340 KB Output is correct
3 Correct 10 ms 5368 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 5368 KB Output is correct
6 Correct 10 ms 5368 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct
10 Correct 10 ms 5368 KB Output is correct
11 Correct 10 ms 5368 KB Output is correct
12 Correct 10 ms 5368 KB Output is correct
13 Correct 10 ms 5368 KB Output is correct
14 Correct 10 ms 5368 KB Output is correct
15 Correct 10 ms 5368 KB Output is correct
16 Correct 532 ms 27672 KB Output is correct
17 Correct 1004 ms 43332 KB Output is correct
18 Correct 77 ms 9848 KB Output is correct
19 Correct 521 ms 35560 KB Output is correct
20 Correct 1047 ms 42672 KB Output is correct
21 Correct 698 ms 35384 KB Output is correct
22 Correct 545 ms 37476 KB Output is correct
23 Correct 1056 ms 42580 KB Output is correct
24 Correct 1049 ms 43524 KB Output is correct
25 Correct 1045 ms 43408 KB Output is correct
26 Correct 516 ms 34376 KB Output is correct
27 Correct 526 ms 34516 KB Output is correct
28 Correct 517 ms 34088 KB Output is correct
29 Correct 538 ms 34616 KB Output is correct
30 Correct 523 ms 34724 KB Output is correct
31 Correct 6 ms 5060 KB Output is correct
32 Correct 7 ms 5112 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 5084 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 7 ms 5112 KB Output is correct
37 Correct 6 ms 5060 KB Output is correct
38 Correct 6 ms 5112 KB Output is correct
39 Correct 6 ms 5084 KB Output is correct
40 Correct 7 ms 5124 KB Output is correct
41 Correct 374 ms 33760 KB Output is correct
42 Correct 708 ms 42344 KB Output is correct
43 Correct 682 ms 42416 KB Output is correct
44 Correct 197 ms 34424 KB Output is correct
45 Correct 695 ms 42452 KB Output is correct
46 Correct 721 ms 42800 KB Output is correct
47 Correct 693 ms 43044 KB Output is correct
48 Correct 702 ms 43384 KB Output is correct
49 Correct 699 ms 44356 KB Output is correct
50 Correct 700 ms 44332 KB Output is correct
51 Correct 675 ms 45052 KB Output is correct
52 Correct 679 ms 44900 KB Output is correct
53 Correct 676 ms 45056 KB Output is correct
54 Correct 677 ms 44652 KB Output is correct
55 Correct 704 ms 45592 KB Output is correct
56 Correct 704 ms 46972 KB Output is correct
57 Correct 711 ms 45664 KB Output is correct
58 Correct 691 ms 45220 KB Output is correct
59 Correct 198 ms 36508 KB Output is correct
60 Correct 687 ms 45208 KB Output is correct
61 Correct 653 ms 49156 KB Output is correct
62 Correct 191 ms 34920 KB Output is correct
63 Correct 191 ms 33596 KB Output is correct
64 Correct 194 ms 34796 KB Output is correct
65 Correct 194 ms 34924 KB Output is correct
66 Correct 206 ms 33912 KB Output is correct
67 Correct 201 ms 36600 KB Output is correct
68 Correct 195 ms 34788 KB Output is correct
69 Correct 197 ms 36088 KB Output is correct
70 Correct 198 ms 34864 KB Output is correct
71 Correct 192 ms 35896 KB Output is correct
72 Correct 775 ms 38040 KB Output is correct
73 Correct 1105 ms 46884 KB Output is correct
74 Correct 1066 ms 47124 KB Output is correct
75 Correct 1043 ms 46012 KB Output is correct
76 Correct 1026 ms 45988 KB Output is correct
77 Correct 1039 ms 45888 KB Output is correct
78 Correct 1099 ms 45372 KB Output is correct
79 Correct 1078 ms 45068 KB Output is correct
80 Correct 1045 ms 43052 KB Output is correct
81 Correct 1062 ms 44568 KB Output is correct
82 Correct 1053 ms 44176 KB Output is correct
83 Correct 1033 ms 43592 KB Output is correct
84 Correct 1087 ms 44616 KB Output is correct
85 Correct 1073 ms 44548 KB Output is correct
86 Correct 1150 ms 43164 KB Output is correct
87 Correct 1069 ms 42556 KB Output is correct
88 Correct 1061 ms 42572 KB Output is correct
89 Correct 616 ms 36216 KB Output is correct
90 Correct 1022 ms 42244 KB Output is correct
91 Correct 956 ms 43220 KB Output is correct
92 Correct 525 ms 34284 KB Output is correct
93 Correct 577 ms 33448 KB Output is correct
94 Correct 527 ms 34100 KB Output is correct
95 Correct 521 ms 34224 KB Output is correct
96 Correct 599 ms 32912 KB Output is correct
97 Correct 636 ms 35012 KB Output is correct
98 Correct 522 ms 34060 KB Output is correct
99 Correct 633 ms 36224 KB Output is correct
100 Correct 539 ms 34292 KB Output is correct