oj.uz

답안 #385602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385602 2021-04-04T15:52:33 Z patrikpavic2 Evacuation plan (IZhO18_plan) C++17
100 / 100
 2493 ms 34668 KB 
#include <algorithm>
#include <cstdio>
#include <set>
#include <cstring>
#include <vector>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef pair < int, int > pii;

const int N = 1e5 + 500;
const int INF = 0x3f3f3f3f;

set < pii > S;
int dis[N], pos[N];
int q1[N], q2[N], lo[N], hi[N];
int par[N], p[N];
int n, m, q;
vector < pii > v[N];

bool cmp(int A, int B){
	return dis[A] > dis[B];
}

void dijkstra(){
	memset(dis, INF, sizeof(dis));
	for(int i = 1;i <= n;i++){
		if(pos[i]){
			dis[i] = 0; S.insert({0, i});
		}
	}
	for(;!S.empty();S.erase(S.begin())){
		int cur = S.begin() -> Y;
		for(pii nxt : v[cur]){
			if(dis[nxt.X] > dis[cur] + nxt.Y){
				dis[nxt.X] = dis[cur] + nxt.Y;
				S.insert({dis[nxt.X], nxt.X});
			}
		}
	}
}

int pr(int x){
	if(par[x] == x) return x;
	return par[x] = pr(par[x]); 
}

void mrg(int x, int y){
	par[pr(x)] = pr(y);
}

void paralelka(){
	vector < pii > Q;
	for(int i = 0;i < q;i++){
		if(lo[i] != hi[i])
			Q.PB({(lo[i] + hi[i] + 1) / 2, i});
	}
	sort(Q.rbegin(), Q.rend());
	for(int i = 1;i <= n;i++) par[i] = i;
	int j = 0;
	for(int i = 0;i < n;i++){
		while(j < (int)Q.size() && Q[j].X > dis[p[i]]){
			if(pr(q1[Q[j].Y]) == pr(q2[Q[j].Y]))
				lo[Q[j].Y] = Q[j].X;
			else
				hi[Q[j].Y] = Q[j].X - 1;
			j++;
		}
		for(pii pp : v[p[i]])
			if(dis[pp.X] >= dis[p[i]])
				mrg(p[i], pp.X);
	}
}

int main(){
	scanf("%d%d", &n, &m);
	for(int i = 0;i < m;i++){
		int x, y, w; scanf("%d%d%d", &x, &y, &w);
		v[x].PB({y, w}), v[y].PB({x, w});
	}
	for(int i = 0;i < n;i++) p[i] = i + 1;
	int k; scanf("%d", &k);
	for(;k--;){
		int x; scanf("%d", &x);
		pos[x] = 1;
	}
	dijkstra();
	sort(p, p + n, cmp);
	scanf("%d", &q);
	for(int i = 0;i < q;i++){
		scanf("%d%d", q1 + i, q2 + i);
		lo[i] = 0;
		hi[i] = INF - 1;	
	}
	for(int i = 0;i < 31;i++) paralelka();
	for(int i = 0;i < q;i++)
		printf("%d\n", lo[i]);
	return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:80:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   80 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
plan.cpp:82:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   82 |   int x, y, w; scanf("%d%d%d", &x, &y, &w);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plan.cpp:86:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   86 |  int k; scanf("%d", &k);
      |         ~~~~~^~~~~~~~~~
plan.cpp:88:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   88 |   int x; scanf("%d", &x);
      |          ~~~~~^~~~~~~~~~
plan.cpp:93:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   93 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
plan.cpp:95:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   95 |   scanf("%d%d", q1 + i, q2 + i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3052 KB Output is correct
2 Correct 7 ms 3180 KB Output is correct
3 Correct 5 ms 3180 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 8 ms 3180 KB Output is correct
6 Correct 6 ms 3180 KB Output is correct
7 Correct 4 ms 3052 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 7 ms 3180 KB Output is correct
10 Correct 8 ms 3180 KB Output is correct
11 Correct 7 ms 3180 KB Output is correct
12 Correct 5 ms 3180 KB Output is correct
13 Correct 7 ms 3180 KB Output is correct
14 Correct 7 ms 3180 KB Output is correct
15 Correct 7 ms 3180 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3052 KB Output is correct
2 Correct 7 ms 3180 KB Output is correct
3 Correct 5 ms 3180 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 8 ms 3180 KB Output is correct
6 Correct 6 ms 3180 KB Output is correct
7 Correct 4 ms 3052 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 7 ms 3180 KB Output is correct
10 Correct 8 ms 3180 KB Output is correct
11 Correct 7 ms 3180 KB Output is correct
12 Correct 5 ms 3180 KB Output is correct
13 Correct 7 ms 3180 KB Output is correct
14 Correct 7 ms 3180 KB Output is correct
15 Correct 7 ms 3180 KB Output is correct
16 Correct 1069 ms 14668 KB Output is correct
17 Correct 2434 ms 33952 KB Output is correct
18 Correct 128 ms 5792 KB Output is correct
19 Correct 542 ms 18920 KB Output is correct
20 Correct 2478 ms 33964 KB Output is correct
21 Correct 1394 ms 21264 KB Output is correct
22 Correct 760 ms 13396 KB Output is correct
23 Correct 2493 ms 33972 KB Output is correct
24 Correct 2478 ms 34220 KB Output is correct
25 Correct 2408 ms 34512 KB Output is correct
26 Correct 464 ms 19804 KB Output is correct
27 Correct 514 ms 20520 KB Output is correct
28 Correct 455 ms 19776 KB Output is correct
29 Correct 517 ms 19372 KB Output is correct
30 Correct 434 ms 18528 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1220 ms 16176 KB Output is correct
2 Correct 2007 ms 30776 KB Output is correct
3 Correct 2033 ms 30788 KB Output is correct
4 Correct 207 ms 8812 KB Output is correct
5 Correct 2035 ms 30808 KB Output is correct
6 Correct 2029 ms 30972 KB Output is correct
7 Correct 2081 ms 31176 KB Output is correct
8 Correct 2050 ms 30956 KB Output is correct
9 Correct 1997 ms 30928 KB Output is correct
10 Correct 2047 ms 30828 KB Output is correct
11 Correct 2001 ms 30828 KB Output is correct
12 Correct 2095 ms 31208 KB Output is correct
13 Correct 1963 ms 31212 KB Output is correct
14 Correct 2096 ms 31300 KB Output is correct
15 Correct 2107 ms 31484 KB Output is correct
16 Correct 1995 ms 31220 KB Output is correct
17 Correct 1955 ms 31212 KB Output is correct
18 Correct 1940 ms 30828 KB Output is correct
19 Correct 167 ms 8684 KB Output is correct
20 Correct 1979 ms 30924 KB Output is correct
21 Correct 2271 ms 30060 KB Output is correct
22 Correct 303 ms 17248 KB Output is correct
23 Correct 286 ms 9196 KB Output is correct
24 Correct 320 ms 15936 KB Output is correct
25 Correct 280 ms 16864 KB Output is correct
26 Correct 365 ms 9836 KB Output is correct
27 Correct 228 ms 8812 KB Output is correct
28 Correct 307 ms 15968 KB Output is correct
29 Correct 225 ms 8684 KB Output is correct
30 Correct 300 ms 15840 KB Output is correct
31 Correct 200 ms 8684 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3052 KB Output is correct
2 Correct 7 ms 3180 KB Output is correct
3 Correct 5 ms 3180 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 8 ms 3180 KB Output is correct
6 Correct 6 ms 3180 KB Output is correct
7 Correct 4 ms 3052 KB Output is correct
8 Correct 4 ms 3052 KB Output is correct
9 Correct 7 ms 3180 KB Output is correct
10 Correct 8 ms 3180 KB Output is correct
11 Correct 7 ms 3180 KB Output is correct
12 Correct 5 ms 3180 KB Output is correct
13 Correct 7 ms 3180 KB Output is correct
14 Correct 7 ms 3180 KB Output is correct
15 Correct 7 ms 3180 KB Output is correct
16 Correct 1069 ms 14668 KB Output is correct
17 Correct 2434 ms 33952 KB Output is correct
18 Correct 128 ms 5792 KB Output is correct
19 Correct 542 ms 18920 KB Output is correct
20 Correct 2478 ms 33964 KB Output is correct
21 Correct 1394 ms 21264 KB Output is correct
22 Correct 760 ms 13396 KB Output is correct
23 Correct 2493 ms 33972 KB Output is correct
24 Correct 2478 ms 34220 KB Output is correct
25 Correct 2408 ms 34512 KB Output is correct
26 Correct 464 ms 19804 KB Output is correct
27 Correct 514 ms 20520 KB Output is correct
28 Correct 455 ms 19776 KB Output is correct
29 Correct 517 ms 19372 KB Output is correct
30 Correct 434 ms 18528 KB Output is correct
31 Correct 3 ms 3084 KB Output is correct
32 Correct 3 ms 3052 KB Output is correct
33 Correct 4 ms 3112 KB Output is correct
34 Correct 3 ms 3052 KB Output is correct
35 Correct 4 ms 3052 KB Output is correct
36 Correct 3 ms 3052 KB Output is correct
37 Correct 3 ms 3052 KB Output is correct
38 Correct 3 ms 3052 KB Output is correct
39 Correct 3 ms 3052 KB Output is correct
40 Correct 3 ms 3052 KB Output is correct
41 Correct 1220 ms 16176 KB Output is correct
42 Correct 2007 ms 30776 KB Output is correct
43 Correct 2033 ms 30788 KB Output is correct
44 Correct 207 ms 8812 KB Output is correct
45 Correct 2035 ms 30808 KB Output is correct
46 Correct 2029 ms 30972 KB Output is correct
47 Correct 2081 ms 31176 KB Output is correct
48 Correct 2050 ms 30956 KB Output is correct
49 Correct 1997 ms 30928 KB Output is correct
50 Correct 2047 ms 30828 KB Output is correct
51 Correct 2001 ms 30828 KB Output is correct
52 Correct 2095 ms 31208 KB Output is correct
53 Correct 1963 ms 31212 KB Output is correct
54 Correct 2096 ms 31300 KB Output is correct
55 Correct 2107 ms 31484 KB Output is correct
56 Correct 1995 ms 31220 KB Output is correct
57 Correct 1955 ms 31212 KB Output is correct
58 Correct 1940 ms 30828 KB Output is correct
59 Correct 167 ms 8684 KB Output is correct
60 Correct 1979 ms 30924 KB Output is correct
61 Correct 2271 ms 30060 KB Output is correct
62 Correct 303 ms 17248 KB Output is correct
63 Correct 286 ms 9196 KB Output is correct
64 Correct 320 ms 15936 KB Output is correct
65 Correct 280 ms 16864 KB Output is correct
66 Correct 365 ms 9836 KB Output is correct
67 Correct 228 ms 8812 KB Output is correct
68 Correct 307 ms 15968 KB Output is correct
69 Correct 225 ms 8684 KB Output is correct
70 Correct 300 ms 15840 KB Output is correct
71 Correct 200 ms 8684 KB Output is correct
72 Correct 1477 ms 20188 KB Output is correct
73 Correct 2272 ms 34048 KB Output is correct
74 Correct 2362 ms 34036 KB Output is correct
75 Correct 2319 ms 34140 KB Output is correct
76 Correct 2324 ms 34084 KB Output is correct
77 Correct 2332 ms 34212 KB Output is correct
78 Correct 2246 ms 34028 KB Output is correct
79 Correct 2239 ms 34032 KB Output is correct
80 Correct 2221 ms 34060 KB Output is correct
81 Correct 2289 ms 34196 KB Output is correct
82 Correct 2201 ms 34456 KB Output is correct
83 Correct 2297 ms 34396 KB Output is correct
84 Correct 2244 ms 34668 KB Output is correct
85 Correct 2277 ms 34544 KB Output is correct
86 Correct 2213 ms 34392 KB Output is correct
87 Correct 2266 ms 34372 KB Output is correct
88 Correct 2176 ms 34156 KB Output is correct
89 Correct 724 ms 13484 KB Output is correct
90 Correct 2184 ms 34156 KB Output is correct
91 Correct 2360 ms 33788 KB Output is correct
92 Correct 441 ms 18572 KB Output is correct
93 Correct 803 ms 14196 KB Output is correct
94 Correct 435 ms 20448 KB Output is correct
95 Correct 438 ms 19040 KB Output is correct
96 Correct 687 ms 14544 KB Output is correct
97 Correct 660 ms 13456 KB Output is correct
98 Correct 436 ms 18656 KB Output is correct
99 Correct 690 ms 13392 KB Output is correct
100 Correct 431 ms 19168 KB Output is correct