oj.uz

답안 #971999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971999 2024-04-29T16:49:18 Z Sunbae Evacuation plan (IZhO18_plan) C++17
100 / 100
 468 ms 80524 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using pli = pair<ll,int>;
const int N = 1e5 + 5, M = 5e5 + 5;
const ll inf = 1e18; // beaware maybe not enough
vector<pli> adj[N];
ll D[N], mn[N][20];
bool vis[N];
tuple<int,int,int> E[M];
tuple<ll,int,int> edges[M];
int p[N], up[N][20], dep[N], LOG, sz[N];
int fp(int x){if(x == p[x]) return x; return p[x] = fp(p[x]);}
void dfs(int u, int p, ll wp){
	up[u][0] = p; mn[u][0] = min(mn[u][0], wp);
	if(u != p) dep[u] = dep[p] + 1;
	for(int j = 1; j<LOG; ++j){
		up[u][j] = up[up[u][j-1]][j-1];
		mn[u][j] = min(mn[u][j-1], mn[up[u][j-1]][j-1]);
	}
	for(pli it: adj[u]){
		ll w = it.first; int v = it.second;
		if(v != p) dfs(v, u, w);
	}
}
pair<ll,int> get_lca(int u, int v){
	ll w = inf;
	if(u == v) return make_pair(w, u);
	if(dep[u] < dep[v]) swap(u, v);
	for(int j = LOG-1; j>=0; --j) if((dep[u]-dep[v])>>j&1) w = min(w, mn[u][j]), u = up[u][j];
	if(u == v) return make_pair(w, u);
	for(int j = LOG-1; j>=0; --j) if(up[u][j] != up[v][j]){w = min({w, mn[u][j], mn[v][j]}); u = up[u][j]; v = up[v][j];}
	return make_pair(min({w, mn[u][0], mn[v][0]}), up[u][0]);
}
signed main(){
	int n, m; scanf("%d %d", &n, &m); LOG = 32 - __builtin_clz(n);
	for(int i = 0, u, v, w; i<m; ++i){
		scanf("%d %d %d", &u, &v, &w); --u; --v;
		E[i] = make_tuple(u, v, w);
		adj[u].emplace_back(w, v); adj[v].emplace_back(w, u);
	}
	priority_queue<pli, vector<pli>, greater<pli>> pq;
	fill(D, D+n, inf); fill(vis, vis+n, false);
	int k; scanf("%d", &k);
	for(int i = 0, u; i<k; ++i) scanf("%d", &u), pq.emplace(D[u-1] = 0, u-1);
	while(!pq.empty()){
		int u = pq.top().second; pq.pop();
		if(vis[u]) continue; vis[u] = true;
		for(pli it: adj[u]){
			ll w = it.first; int v = it.second;
			if(D[u] < inf && D[u] + w < D[v]) pq.emplace(D[v] = D[u] + w, v);
		}
	}
	for(int i = 0; i<m; ++i){
		int u, v, _; tie(u, v, _) = E[i];
		edges[i] = make_tuple(min(D[u], D[v]), u, v);
	}
	for(int i = 0; i<n; ++i){
		adj[i].clear(); p[i] = i; sz[i] = 1; fill(mn[i], mn[i]+LOG, inf);
	}
	sort(edges, edges+m, greater<tuple<ll,int,int>>());
	for(int i = 0; i<m; ++i){
		ll w; int u, v; tie(w, u, v) = edges[i];
		if(fp(u) != fp(v)){
			int pu = fp(u), pv = fp(v);
			if(sz[pu] < sz[pv]) swap(pu, pv);
			sz[pu] += sz[pv]; p[pv] = pu;
			adj[u].emplace_back(w, v); adj[v].emplace_back(w, u);
		}
	}
	dfs(0, 0, inf);
	int q; scanf("%d", &q);
	while(q--){
		int u, v; scanf("%d %d", &u, &v); --u; --v;
		pair<ll,int> tmp = get_lca(u, v);
		ll w = tmp.first; int lca = tmp.second;
		printf("%lld\n", w);
	}
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:48:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   48 |   if(vis[u]) continue; vis[u] = true;
      |   ^~
plan.cpp:48:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   48 |   if(vis[u]) continue; vis[u] = true;
      |                        ^~~
plan.cpp:76:25: warning: unused variable 'lca' [-Wunused-variable]
   76 |   ll w = tmp.first; int lca = tmp.second;
      |                         ^~~
plan.cpp:36:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  int n, m; scanf("%d %d", &n, &m); LOG = 32 - __builtin_clz(n);
      |            ~~~~~^~~~~~~~~~~~~~~~~
plan.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   scanf("%d %d %d", &u, &v, &w); --u; --v;
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |  int k; scanf("%d", &k);
      |         ~~~~~^~~~~~~~~~
plan.cpp:45:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  for(int i = 0, u; i<k; ++i) scanf("%d", &u), pq.emplace(D[u-1] = 0, u-1);
      |                              ~~~~~^~~~~~~~~~
plan.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  int q; scanf("%d", &q);
      |         ~~~~~^~~~~~~~~~
plan.cpp:74:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   int u, v; scanf("%d %d", &u, &v); --u; --v;
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 4 ms 15196 KB Output is correct
3 Correct 3 ms 15348 KB Output is correct
4 Correct 2 ms 15156 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 4 ms 15032 KB Output is correct
7 Correct 3 ms 15204 KB Output is correct
8 Correct 2 ms 15196 KB Output is correct
9 Correct 4 ms 15196 KB Output is correct
10 Correct 3 ms 15164 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 4 ms 15176 KB Output is correct
13 Correct 3 ms 15164 KB Output is correct
14 Correct 3 ms 15032 KB Output is correct
15 Correct 4 ms 15196 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 4 ms 15196 KB Output is correct
3 Correct 3 ms 15348 KB Output is correct
4 Correct 2 ms 15156 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 4 ms 15032 KB Output is correct
7 Correct 3 ms 15204 KB Output is correct
8 Correct 2 ms 15196 KB Output is correct
9 Correct 4 ms 15196 KB Output is correct
10 Correct 3 ms 15164 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 4 ms 15176 KB Output is correct
13 Correct 3 ms 15164 KB Output is correct
14 Correct 3 ms 15032 KB Output is correct
15 Correct 4 ms 15196 KB Output is correct
16 Correct 139 ms 42992 KB Output is correct
17 Correct 456 ms 79308 KB Output is correct
18 Correct 32 ms 18388 KB Output is correct
19 Correct 127 ms 45480 KB Output is correct
20 Correct 440 ms 79264 KB Output is correct
21 Correct 221 ms 54884 KB Output is correct
22 Correct 144 ms 48848 KB Output is correct
23 Correct 402 ms 79016 KB Output is correct
24 Correct 439 ms 79332 KB Output is correct
25 Correct 404 ms 79044 KB Output is correct
26 Correct 131 ms 45332 KB Output is correct
27 Correct 114 ms 45252 KB Output is correct
28 Correct 115 ms 45352 KB Output is correct
29 Correct 117 ms 45300 KB Output is correct
30 Correct 112 ms 45376 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 49784 KB Output is correct
2 Correct 417 ms 70156 KB Output is correct
3 Correct 369 ms 69968 KB Output is correct
4 Correct 94 ms 43220 KB Output is correct
5 Correct 370 ms 70408 KB Output is correct
6 Correct 392 ms 70136 KB Output is correct
7 Correct 363 ms 70040 KB Output is correct
8 Correct 348 ms 70080 KB Output is correct
9 Correct 363 ms 70068 KB Output is correct
10 Correct 362 ms 70076 KB Output is correct
11 Correct 387 ms 70184 KB Output is correct
12 Correct 352 ms 70076 KB Output is correct
13 Correct 382 ms 70336 KB Output is correct
14 Correct 385 ms 70080 KB Output is correct
15 Correct 361 ms 71100 KB Output is correct
16 Correct 357 ms 70072 KB Output is correct
17 Correct 370 ms 70172 KB Output is correct
18 Correct 355 ms 70076 KB Output is correct
19 Correct 92 ms 44856 KB Output is correct
20 Correct 355 ms 69976 KB Output is correct
21 Correct 362 ms 69604 KB Output is correct
22 Correct 73 ms 42228 KB Output is correct
23 Correct 95 ms 41300 KB Output is correct
24 Correct 85 ms 42240 KB Output is correct
25 Correct 78 ms 42044 KB Output is correct
26 Correct 94 ms 41932 KB Output is correct
27 Correct 95 ms 44796 KB Output is correct
28 Correct 75 ms 42232 KB Output is correct
29 Correct 89 ms 44116 KB Output is correct
30 Correct 71 ms 42208 KB Output is correct
31 Correct 88 ms 43908 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 4 ms 15196 KB Output is correct
3 Correct 3 ms 15348 KB Output is correct
4 Correct 2 ms 15156 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 4 ms 15032 KB Output is correct
7 Correct 3 ms 15204 KB Output is correct
8 Correct 2 ms 15196 KB Output is correct
9 Correct 4 ms 15196 KB Output is correct
10 Correct 3 ms 15164 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 4 ms 15176 KB Output is correct
13 Correct 3 ms 15164 KB Output is correct
14 Correct 3 ms 15032 KB Output is correct
15 Correct 4 ms 15196 KB Output is correct
16 Correct 139 ms 42992 KB Output is correct
17 Correct 456 ms 79308 KB Output is correct
18 Correct 32 ms 18388 KB Output is correct
19 Correct 127 ms 45480 KB Output is correct
20 Correct 440 ms 79264 KB Output is correct
21 Correct 221 ms 54884 KB Output is correct
22 Correct 144 ms 48848 KB Output is correct
23 Correct 402 ms 79016 KB Output is correct
24 Correct 439 ms 79332 KB Output is correct
25 Correct 404 ms 79044 KB Output is correct
26 Correct 131 ms 45332 KB Output is correct
27 Correct 114 ms 45252 KB Output is correct
28 Correct 115 ms 45352 KB Output is correct
29 Correct 117 ms 45300 KB Output is correct
30 Correct 112 ms 45376 KB Output is correct
31 Correct 2 ms 14940 KB Output is correct
32 Correct 3 ms 14936 KB Output is correct
33 Correct 3 ms 15152 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 2 ms 14940 KB Output is correct
36 Correct 2 ms 14940 KB Output is correct
37 Correct 3 ms 14940 KB Output is correct
38 Correct 3 ms 14940 KB Output is correct
39 Correct 3 ms 14936 KB Output is correct
40 Correct 3 ms 14940 KB Output is correct
41 Correct 173 ms 49784 KB Output is correct
42 Correct 417 ms 70156 KB Output is correct
43 Correct 369 ms 69968 KB Output is correct
44 Correct 94 ms 43220 KB Output is correct
45 Correct 370 ms 70408 KB Output is correct
46 Correct 392 ms 70136 KB Output is correct
47 Correct 363 ms 70040 KB Output is correct
48 Correct 348 ms 70080 KB Output is correct
49 Correct 363 ms 70068 KB Output is correct
50 Correct 362 ms 70076 KB Output is correct
51 Correct 387 ms 70184 KB Output is correct
52 Correct 352 ms 70076 KB Output is correct
53 Correct 382 ms 70336 KB Output is correct
54 Correct 385 ms 70080 KB Output is correct
55 Correct 361 ms 71100 KB Output is correct
56 Correct 357 ms 70072 KB Output is correct
57 Correct 370 ms 70172 KB Output is correct
58 Correct 355 ms 70076 KB Output is correct
59 Correct 92 ms 44856 KB Output is correct
60 Correct 355 ms 69976 KB Output is correct
61 Correct 362 ms 69604 KB Output is correct
62 Correct 73 ms 42228 KB Output is correct
63 Correct 95 ms 41300 KB Output is correct
64 Correct 85 ms 42240 KB Output is correct
65 Correct 78 ms 42044 KB Output is correct
66 Correct 94 ms 41932 KB Output is correct
67 Correct 95 ms 44796 KB Output is correct
68 Correct 75 ms 42232 KB Output is correct
69 Correct 89 ms 44116 KB Output is correct
70 Correct 71 ms 42208 KB Output is correct
71 Correct 88 ms 43908 KB Output is correct
72 Correct 230 ms 54600 KB Output is correct
73 Correct 422 ms 79168 KB Output is correct
74 Correct 467 ms 79212 KB Output is correct
75 Correct 437 ms 79288 KB Output is correct
76 Correct 415 ms 79212 KB Output is correct
77 Correct 400 ms 79100 KB Output is correct
78 Correct 468 ms 79228 KB Output is correct
79 Correct 412 ms 79200 KB Output is correct
80 Correct 445 ms 79292 KB Output is correct
81 Correct 433 ms 79284 KB Output is correct
82 Correct 456 ms 79168 KB Output is correct
83 Correct 415 ms 79376 KB Output is correct
84 Correct 434 ms 79504 KB Output is correct
85 Correct 468 ms 80524 KB Output is correct
86 Correct 437 ms 79224 KB Output is correct
87 Correct 420 ms 79040 KB Output is correct
88 Correct 435 ms 79208 KB Output is correct
89 Correct 163 ms 47700 KB Output is correct
90 Correct 438 ms 79104 KB Output is correct
91 Correct 434 ms 78628 KB Output is correct
92 Correct 130 ms 45356 KB Output is correct
93 Correct 159 ms 45136 KB Output is correct
94 Correct 124 ms 45120 KB Output is correct
95 Correct 126 ms 45380 KB Output is correct
96 Correct 158 ms 44752 KB Output is correct
97 Correct 172 ms 46896 KB Output is correct
98 Correct 132 ms 45632 KB Output is correct
99 Correct 168 ms 48216 KB Output is correct
100 Correct 130 ms 45380 KB Output is correct