oj.uz

답안 #168801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168801 2019-12-16T13:40:11 Z abil Evacuation plan (IZhO18_plan) C++14
100 / 100
 893 ms 55348 KB 
#include <bits/stdc++.h>
 
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long
 
using namespace std;
 
const int N = (1e5 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);
 
vector<pair<int,int > > g[N];
vector<pair<int,pair<int,int > > > vec;
vector<pair<int,int > > road;
 
int dist[N], par[N], sz[N], up[20][N], mn[20][N], tin[N], tout[N], timer;
 
int find(int v){
	if(v == par[v]){
		return v;
	}
	return par[v] = find(par[v]);
}
 
void dsu(int a,int b){
	a = find(a);
	b = find(b);
	if(sz[a] < sz[b]){
		swap(a, b);
	}
	sz[a] += sz[b];
	par[b] = a;
}
 
void dfs(int v,int pr,int w){
	up[0][v] = pr;
	mn[0][v] = w;
	tin[v] = ++timer;
	for(int i = 1;i <= 19; i++){
		up[i][v] = up[i - 1][up[i - 1][v]];
		mn[i][v] = min(mn[i - 1][v], mn[i - 1][up[i - 1][v]]);
	}
	for(auto to : g[v]){
		if(to.fr != pr){
			dfs(to.fr, v, to.sc);
		}
	}
	tout[v] = ++timer;
}
 
bool upper(int a,int b){
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}
 
int get(int a,int b){
	int res = INF;
	if(upper(a, b)){
		for(int i = 19;i >= 0; i--){
			if(!upper(up[i][b], a)){
				res = min(res, mn[i][b]);
				b = up[i][b];
			}
		}
		res = min(res, mn[0][b]);
	}
	else
	if(upper(b, a)){
		for(int i = 19;i >= 0; i--){
			if(!upper(up[i][a], b)){
				res = min(res, mn[i][a]);
				a = up[i][a];
			}
		}
		res = min(res, mn[0][a]);
	}
	else{
		for(int i = 19;i >= 0; i--){
			if(!upper(up[i][b], a)){
				res = min(res, mn[i][b]);
				b = up[i][b];
			}
		}
		res = min(res, mn[0][b]);
		for(int i = 19;i >= 0; i--){
			if(!upper(up[i][a], b)){
				res = min(res, mn[i][a]);
				a = up[i][a];
			}
		}
		res = min(res, mn[0][a]);
	}
	return res;
}
main()
{
	int n, m, u, v, w;
	scanf("%d%d", &n, &m);
	for(int i = 1;i <= n; i++){
		par[i] = i;
		sz[i] = 1;
	}
	for(int i = 1;i <= m; i++){
		scanf("%d%d%d", &u, &v, &w);
		g[u].pb({v,w});
		g[v].pb({u,w});
		road.pb({u, v});
	}
	int k;
	priority_queue<pair<int,int > > q;
	scanf("%d", &k);
	memset(dist, 0x3f3f3f3f,sizeof(dist));
	for(int i = 0;i < k; i++){
		scanf("%d", &v);
		dist[v] = 0;
		q.push({0,v});
	}
	while(!q.empty()){
		v = q.top().sc;
		q.pop();
		for(auto to : g[v]){
			if(dist[to.fr] > dist[v] + to.sc){
				dist[to.fr] = dist[v] + to.sc;
				q.push({-dist[to.fr], to.fr});
			}
		}
	}
	for(int i = 1;i <= n; i++){
		g[i].clear();
	}
	for(int i = 0;i < m; i++){
		vec.pb({min(dist[road[i].fr],dist[road[i].sc]),{road[i].fr,road[i].sc}});
	}
	sort(all(vec));
	reverse(all(vec));
	for(int i = 0;i < m; i++){
		v = vec[i].sc.fr, u = vec[i].sc.sc, w = min(dist[u], dist[v]);
		if(find(v) != find(u)){
			g[v].pb({u, w});
			g[u].pb({v, w});
			dsu(u,v);
		}
	}
	dfs(1, 1, INF);
	int t;
	scanf("%d", &t);
	while(t--){
		scanf("%d%d", &u, &v);
		printf("%d\n", get(u, v));
	}
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/

Compilation message

plan.cpp:98:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
plan.cpp: In function 'int main()':
plan.cpp:101:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
plan.cpp:107:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plan.cpp:114:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &k);
  ~~~~~^~~~~~~~~~
plan.cpp:117:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &v);
   ~~~~~^~~~~~~~~~
plan.cpp:149:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &t);
  ~~~~~^~~~~~~~~~
plan.cpp:151:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3320 KB Output is correct
2 Correct 5 ms 3540 KB Output is correct
3 Correct 6 ms 3448 KB Output is correct
4 Correct 4 ms 3244 KB Output is correct
5 Correct 6 ms 3448 KB Output is correct
6 Correct 6 ms 3580 KB Output is correct
7 Correct 4 ms 3292 KB Output is correct
8 Correct 4 ms 3320 KB Output is correct
9 Correct 6 ms 3448 KB Output is correct
10 Correct 6 ms 3448 KB Output is correct
11 Correct 6 ms 3448 KB Output is correct
12 Correct 6 ms 3576 KB Output is correct
13 Correct 6 ms 3448 KB Output is correct
14 Correct 6 ms 3448 KB Output is correct
15 Correct 6 ms 3448 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3320 KB Output is correct
2 Correct 5 ms 3540 KB Output is correct
3 Correct 6 ms 3448 KB Output is correct
4 Correct 4 ms 3244 KB Output is correct
5 Correct 6 ms 3448 KB Output is correct
6 Correct 6 ms 3580 KB Output is correct
7 Correct 4 ms 3292 KB Output is correct
8 Correct 4 ms 3320 KB Output is correct
9 Correct 6 ms 3448 KB Output is correct
10 Correct 6 ms 3448 KB Output is correct
11 Correct 6 ms 3448 KB Output is correct
12 Correct 6 ms 3576 KB Output is correct
13 Correct 6 ms 3448 KB Output is correct
14 Correct 6 ms 3448 KB Output is correct
15 Correct 6 ms 3448 KB Output is correct
16 Correct 285 ms 26528 KB Output is correct
17 Correct 800 ms 55192 KB Output is correct
18 Correct 54 ms 8684 KB Output is correct
19 Correct 212 ms 30644 KB Output is correct
20 Correct 869 ms 54508 KB Output is correct
21 Correct 531 ms 36740 KB Output is correct
22 Correct 284 ms 34400 KB Output is correct
23 Correct 864 ms 53892 KB Output is correct
24 Correct 796 ms 54476 KB Output is correct
25 Correct 804 ms 55348 KB Output is correct
26 Correct 212 ms 30580 KB Output is correct
27 Correct 209 ms 30956 KB Output is correct
28 Correct 201 ms 30864 KB Output is correct
29 Correct 210 ms 30924 KB Output is correct
30 Correct 211 ms 31084 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 407 ms 36044 KB Output is correct
2 Correct 753 ms 54496 KB Output is correct
3 Correct 784 ms 52576 KB Output is correct
4 Correct 260 ms 30700 KB Output is correct
5 Correct 753 ms 54776 KB Output is correct
6 Correct 715 ms 54184 KB Output is correct
7 Correct 750 ms 52548 KB Output is correct
8 Correct 715 ms 51680 KB Output is correct
9 Correct 714 ms 52172 KB Output is correct
10 Correct 702 ms 53136 KB Output is correct
11 Correct 736 ms 52172 KB Output is correct
12 Correct 708 ms 52620 KB Output is correct
13 Correct 712 ms 52576 KB Output is correct
14 Correct 763 ms 52672 KB Output is correct
15 Correct 792 ms 52372 KB Output is correct
16 Correct 739 ms 52580 KB Output is correct
17 Correct 749 ms 51548 KB Output is correct
18 Correct 733 ms 50664 KB Output is correct
19 Correct 254 ms 31788 KB Output is correct
20 Correct 762 ms 51120 KB Output is correct
21 Correct 710 ms 51076 KB Output is correct
22 Correct 148 ms 29196 KB Output is correct
23 Correct 238 ms 28812 KB Output is correct
24 Correct 147 ms 29332 KB Output is correct
25 Correct 143 ms 29364 KB Output is correct
26 Correct 270 ms 29216 KB Output is correct
27 Correct 248 ms 32008 KB Output is correct
28 Correct 150 ms 28844 KB Output is correct
29 Correct 232 ms 31176 KB Output is correct
30 Correct 145 ms 29268 KB Output is correct
31 Correct 261 ms 30864 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3320 KB Output is correct
2 Correct 5 ms 3540 KB Output is correct
3 Correct 6 ms 3448 KB Output is correct
4 Correct 4 ms 3244 KB Output is correct
5 Correct 6 ms 3448 KB Output is correct
6 Correct 6 ms 3580 KB Output is correct
7 Correct 4 ms 3292 KB Output is correct
8 Correct 4 ms 3320 KB Output is correct
9 Correct 6 ms 3448 KB Output is correct
10 Correct 6 ms 3448 KB Output is correct
11 Correct 6 ms 3448 KB Output is correct
12 Correct 6 ms 3576 KB Output is correct
13 Correct 6 ms 3448 KB Output is correct
14 Correct 6 ms 3448 KB Output is correct
15 Correct 6 ms 3448 KB Output is correct
16 Correct 285 ms 26528 KB Output is correct
17 Correct 800 ms 55192 KB Output is correct
18 Correct 54 ms 8684 KB Output is correct
19 Correct 212 ms 30644 KB Output is correct
20 Correct 869 ms 54508 KB Output is correct
21 Correct 531 ms 36740 KB Output is correct
22 Correct 284 ms 34400 KB Output is correct
23 Correct 864 ms 53892 KB Output is correct
24 Correct 796 ms 54476 KB Output is correct
25 Correct 804 ms 55348 KB Output is correct
26 Correct 212 ms 30580 KB Output is correct
27 Correct 209 ms 30956 KB Output is correct
28 Correct 201 ms 30864 KB Output is correct
29 Correct 210 ms 30924 KB Output is correct
30 Correct 211 ms 31084 KB Output is correct
31 Correct 4 ms 3192 KB Output is correct
32 Correct 4 ms 3192 KB Output is correct
33 Correct 4 ms 3192 KB Output is correct
34 Correct 4 ms 3192 KB Output is correct
35 Correct 5 ms 3264 KB Output is correct
36 Correct 4 ms 3320 KB Output is correct
37 Correct 5 ms 3320 KB Output is correct
38 Correct 4 ms 3192 KB Output is correct
39 Correct 4 ms 3192 KB Output is correct
40 Correct 5 ms 3320 KB Output is correct
41 Correct 407 ms 36044 KB Output is correct
42 Correct 753 ms 54496 KB Output is correct
43 Correct 784 ms 52576 KB Output is correct
44 Correct 260 ms 30700 KB Output is correct
45 Correct 753 ms 54776 KB Output is correct
46 Correct 715 ms 54184 KB Output is correct
47 Correct 750 ms 52548 KB Output is correct
48 Correct 715 ms 51680 KB Output is correct
49 Correct 714 ms 52172 KB Output is correct
50 Correct 702 ms 53136 KB Output is correct
51 Correct 736 ms 52172 KB Output is correct
52 Correct 708 ms 52620 KB Output is correct
53 Correct 712 ms 52576 KB Output is correct
54 Correct 763 ms 52672 KB Output is correct
55 Correct 792 ms 52372 KB Output is correct
56 Correct 739 ms 52580 KB Output is correct
57 Correct 749 ms 51548 KB Output is correct
58 Correct 733 ms 50664 KB Output is correct
59 Correct 254 ms 31788 KB Output is correct
60 Correct 762 ms 51120 KB Output is correct
61 Correct 710 ms 51076 KB Output is correct
62 Correct 148 ms 29196 KB Output is correct
63 Correct 238 ms 28812 KB Output is correct
64 Correct 147 ms 29332 KB Output is correct
65 Correct 143 ms 29364 KB Output is correct
66 Correct 270 ms 29216 KB Output is correct
67 Correct 248 ms 32008 KB Output is correct
68 Correct 150 ms 28844 KB Output is correct
69 Correct 232 ms 31176 KB Output is correct
70 Correct 145 ms 29268 KB Output is correct
71 Correct 261 ms 30864 KB Output is correct
72 Correct 483 ms 36392 KB Output is correct
73 Correct 791 ms 52440 KB Output is correct
74 Correct 839 ms 52204 KB Output is correct
75 Correct 859 ms 52456 KB Output is correct
76 Correct 831 ms 52040 KB Output is correct
77 Correct 872 ms 52520 KB Output is correct
78 Correct 893 ms 51504 KB Output is correct
79 Correct 825 ms 51480 KB Output is correct
80 Correct 837 ms 51452 KB Output is correct
81 Correct 889 ms 52412 KB Output is correct
82 Correct 871 ms 53548 KB Output is correct
83 Correct 865 ms 54488 KB Output is correct
84 Correct 847 ms 54524 KB Output is correct
85 Correct 812 ms 54128 KB Output is correct
86 Correct 861 ms 53616 KB Output is correct
87 Correct 876 ms 53400 KB Output is correct
88 Correct 888 ms 52672 KB Output is correct
89 Correct 382 ms 32940 KB Output is correct
90 Correct 805 ms 52432 KB Output is correct
91 Correct 776 ms 52104 KB Output is correct
92 Correct 223 ms 29732 KB Output is correct
93 Correct 335 ms 29952 KB Output is correct
94 Correct 213 ms 30064 KB Output is correct
95 Correct 214 ms 29912 KB Output is correct
96 Correct 408 ms 29792 KB Output is correct
97 Correct 398 ms 31608 KB Output is correct
98 Correct 210 ms 29964 KB Output is correct
99 Correct 366 ms 32984 KB Output is correct
100 Correct 212 ms 30300 KB Output is correct