oj.uz

답안 #810351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810351 2023-08-06T08:43:18 Z qwerasdfzxcl Security Guard (JOI23_guard) C++17
33 / 100
 350 ms 76104 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int n, mn, mx;
ll a[200200];
pair<int, int> E[200200];

ll ans[200200];

priority_queue<array<ll, 4>, vector<array<ll, 4>>, greater<array<ll, 4>>> pq;

struct DSU{
	int path[200200], valid[200200], n;
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq2[200200];

	void init(int N){
		n = N;
		for (int i=1;i<=n;i++){
			path[i] = i;
			valid[i] = 1;
		}
	}

	void reset(int x){valid[x] = 0;}

	void push(int x, int y){
		pq2[x].emplace(a[x]+a[y], y);
		pq2[y].emplace(a[x]+a[y], x);
	}

	void init2(){
		for (int i=1;i<=n;i++) if (valid[i] && !pq2[i].empty()){
			auto [cst, v] = pq2[i].top();
			pq.push({cst - a[i] - a[mn], cst, v, i});
		}
	}

	int find(int s){
		if (path[s]==s) return s;
		return path[s] = find(path[s]);
	}

	void merge(int s, int v){
		s = find(s), v = find(v);
		assert(s!=v);
		assert(valid[v]);

		path[v] = s;
		if (!valid[s]) return;

		if (pq2[s].size() < pq2[v].size()) swap(pq2[s], pq2[v]);
		while(!pq2[v].empty()){
			pq2[s].push(pq2[v].top()); pq2[v].pop();
		}

		while(!pq2[s].empty() && find(pq2[s].top().second)==s) pq2[s].pop();
		if (!pq2[s].empty()){
			auto [cst, nxt] = pq2[s].top();
			pq.push({cst - a[s] - a[mn], cst, nxt, s});
		} 

	}
}dsu;

bool valid(const array<ll, 4> &p){
	if (dsu.find(p[2]) == dsu.find(p[3])) return 0;
	return p[1] - a[mn] - a[dsu.find(p[3])] == p[0];
}

int main(){
	int n, m, q;
	scanf("%d %d %d", &n, &m, &q);
	for (int i=1;i<=n;i++) scanf("%lld", a+i);
	for (int i=1;i<=m;i++){
		int x, y;
		scanf("%d %d", &x, &y);
		E[i] = {x, y};
	}

	mn = min_element(a+1, a+n+1) - a;
	mx = max_element(a+1, a+n+1) - a;
	dsu.init(n);

	int sz = n-1;

	for (int i=1;i<=m;i++){
		if (E[i].first==mn || E[i].second==mn){
			if (E[i].second==mn) swap(E[i].first, E[i].second);
			dsu.reset(E[i].second);
			sz--;
		}

		else{
			dsu.push(E[i].first, E[i].second);
		}
	}

	dsu.init2();

	for (int i=1;i<=n;i++) ans[sz] += a[i];
	ans[sz] += a[mn] * (n-2);

	for (int i=sz-1;i>=0;i--){
		while(!pq.empty() && !valid(pq.top())) pq.pop();
		assert(!pq.empty());
		auto [cst, _, u, v] = pq.top(); pq.pop();

		dsu.merge(u, v);
		ans[i] = ans[i+1] + cst;
	}

	ll ofs = a[mx];
	for (int i=1;i<=n;i++) ofs -= a[i];

	for (int i=0;i<=q;i++) printf("%lld\n", ans[min(i, sz)] + ofs);
}

Compilation message

guard.cpp: In function 'int main()':
guard.cpp:74:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |  scanf("%d %d %d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
guard.cpp:75:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |  for (int i=1;i<=n;i++) scanf("%lld", a+i);
      |                         ~~~~~^~~~~~~~~~~~~
guard.cpp:78:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |   scanf("%d %d", &x, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 90 ms 28976 KB Output is correct
3 Correct 102 ms 28960 KB Output is correct
4 Correct 163 ms 35208 KB Output is correct
5 Correct 164 ms 35180 KB Output is correct
6 Correct 170 ms 35244 KB Output is correct
7 Correct 180 ms 35176 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 90 ms 28976 KB Output is correct
3 Correct 102 ms 28960 KB Output is correct
4 Correct 163 ms 35208 KB Output is correct
5 Correct 164 ms 35180 KB Output is correct
6 Correct 170 ms 35244 KB Output is correct
7 Correct 180 ms 35176 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 256 ms 35684 KB Output is correct
11 Correct 124 ms 28944 KB Output is correct
12 Correct 95 ms 32716 KB Output is correct
13 Correct 103 ms 32344 KB Output is correct
14 Correct 277 ms 39504 KB Output is correct
15 Correct 243 ms 39104 KB Output is correct
16 Correct 256 ms 39088 KB Output is correct
17 Correct 242 ms 38960 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 90 ms 28976 KB Output is correct
3 Correct 102 ms 28960 KB Output is correct
4 Correct 163 ms 35208 KB Output is correct
5 Correct 164 ms 35180 KB Output is correct
6 Correct 170 ms 35244 KB Output is correct
7 Correct 180 ms 35176 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 256 ms 35684 KB Output is correct
11 Correct 124 ms 28944 KB Output is correct
12 Correct 95 ms 32716 KB Output is correct
13 Correct 103 ms 32344 KB Output is correct
14 Correct 277 ms 39504 KB Output is correct
15 Correct 243 ms 39104 KB Output is correct
16 Correct 256 ms 39088 KB Output is correct
17 Correct 242 ms 38960 KB Output is correct
18 Correct 4 ms 6484 KB Output is correct
19 Correct 323 ms 39624 KB Output is correct
20 Correct 300 ms 39492 KB Output is correct
21 Correct 350 ms 40108 KB Output is correct
22 Correct 348 ms 39180 KB Output is correct
23 Correct 328 ms 38424 KB Output is correct
24 Correct 337 ms 37672 KB Output is correct
25 Correct 231 ms 33448 KB Output is correct
26 Correct 214 ms 32408 KB Output is correct
27 Correct 145 ms 32460 KB Output is correct
28 Correct 314 ms 37848 KB Output is correct
29 Correct 326 ms 36660 KB Output is correct
30 Correct 233 ms 34056 KB Output is correct
31 Correct 153 ms 33220 KB Output is correct
32 Correct 312 ms 39868 KB Output is correct
33 Correct 305 ms 36592 KB Output is correct
34 Correct 342 ms 76104 KB Output is correct
35 Correct 335 ms 72100 KB Output is correct
36 Correct 213 ms 55760 KB Output is correct
37 Correct 226 ms 50836 KB Output is correct
38 Correct 291 ms 34236 KB Output is correct
39 Correct 182 ms 32456 KB Output is correct
40 Correct 214 ms 32960 KB Output is correct
41 Correct 151 ms 32664 KB Output is correct
42 Correct 302 ms 40152 KB Output is correct
43 Runtime error 286 ms 71892 KB Execution killed with signal 6
44 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 90 ms 28976 KB Output is correct
3 Correct 102 ms 28960 KB Output is correct
4 Correct 163 ms 35208 KB Output is correct
5 Correct 164 ms 35180 KB Output is correct
6 Correct 170 ms 35244 KB Output is correct
7 Correct 180 ms 35176 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 256 ms 35684 KB Output is correct
11 Correct 124 ms 28944 KB Output is correct
12 Correct 95 ms 32716 KB Output is correct
13 Correct 103 ms 32344 KB Output is correct
14 Correct 277 ms 39504 KB Output is correct
15 Correct 243 ms 39104 KB Output is correct
16 Correct 256 ms 39088 KB Output is correct
17 Correct 242 ms 38960 KB Output is correct
18 Correct 4 ms 6484 KB Output is correct
19 Correct 323 ms 39624 KB Output is correct
20 Correct 300 ms 39492 KB Output is correct
21 Correct 350 ms 40108 KB Output is correct
22 Correct 348 ms 39180 KB Output is correct
23 Correct 328 ms 38424 KB Output is correct
24 Correct 337 ms 37672 KB Output is correct
25 Correct 231 ms 33448 KB Output is correct
26 Correct 214 ms 32408 KB Output is correct
27 Correct 145 ms 32460 KB Output is correct
28 Correct 314 ms 37848 KB Output is correct
29 Correct 326 ms 36660 KB Output is correct
30 Correct 233 ms 34056 KB Output is correct
31 Correct 153 ms 33220 KB Output is correct
32 Correct 312 ms 39868 KB Output is correct
33 Correct 305 ms 36592 KB Output is correct
34 Correct 342 ms 76104 KB Output is correct
35 Correct 335 ms 72100 KB Output is correct
36 Correct 213 ms 55760 KB Output is correct
37 Correct 226 ms 50836 KB Output is correct
38 Correct 291 ms 34236 KB Output is correct
39 Correct 182 ms 32456 KB Output is correct
40 Correct 214 ms 32960 KB Output is correct
41 Correct 151 ms 32664 KB Output is correct
42 Correct 302 ms 40152 KB Output is correct
43 Runtime error 286 ms 71892 KB Execution killed with signal 6
44 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 3 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 20 ms 8772 KB Output is correct
9 Correct 20 ms 8788 KB Output is correct
10 Correct 20 ms 8532 KB Output is correct
11 Correct 24 ms 8788 KB Output is correct
12 Correct 20 ms 8788 KB Output is correct
13 Correct 19 ms 8800 KB Output is correct
14 Correct 22 ms 8800 KB Output is correct
15 Correct 20 ms 8788 KB Output is correct
16 Correct 23 ms 8760 KB Output is correct

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 3 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 20 ms 8772 KB Output is correct
9 Correct 20 ms 8788 KB Output is correct
10 Correct 20 ms 8532 KB Output is correct
11 Correct 24 ms 8788 KB Output is correct
12 Correct 20 ms 8788 KB Output is correct
13 Correct 19 ms 8800 KB Output is correct
14 Correct 22 ms 8800 KB Output is correct
15 Correct 20 ms 8788 KB Output is correct
16 Correct 23 ms 8760 KB Output is correct
17 Correct 35 ms 12392 KB Output is correct
18 Correct 43 ms 12468 KB Output is correct
19 Correct 62 ms 19136 KB Output is correct
20 Correct 103 ms 29628 KB Output is correct
21 Incorrect 113 ms 29076 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 90 ms 28976 KB Output is correct
3 Correct 102 ms 28960 KB Output is correct
4 Correct 163 ms 35208 KB Output is correct
5 Correct 164 ms 35180 KB Output is correct
6 Correct 170 ms 35244 KB Output is correct
7 Correct 180 ms 35176 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 256 ms 35684 KB Output is correct
11 Correct 124 ms 28944 KB Output is correct
12 Correct 95 ms 32716 KB Output is correct
13 Correct 103 ms 32344 KB Output is correct
14 Correct 277 ms 39504 KB Output is correct
15 Correct 243 ms 39104 KB Output is correct
16 Correct 256 ms 39088 KB Output is correct
17 Correct 242 ms 38960 KB Output is correct
18 Correct 4 ms 6484 KB Output is correct
19 Correct 323 ms 39624 KB Output is correct
20 Correct 300 ms 39492 KB Output is correct
21 Correct 350 ms 40108 KB Output is correct
22 Correct 348 ms 39180 KB Output is correct
23 Correct 328 ms 38424 KB Output is correct
24 Correct 337 ms 37672 KB Output is correct
25 Correct 231 ms 33448 KB Output is correct
26 Correct 214 ms 32408 KB Output is correct
27 Correct 145 ms 32460 KB Output is correct
28 Correct 314 ms 37848 KB Output is correct
29 Correct 326 ms 36660 KB Output is correct
30 Correct 233 ms 34056 KB Output is correct
31 Correct 153 ms 33220 KB Output is correct
32 Correct 312 ms 39868 KB Output is correct
33 Correct 305 ms 36592 KB Output is correct
34 Correct 342 ms 76104 KB Output is correct
35 Correct 335 ms 72100 KB Output is correct
36 Correct 213 ms 55760 KB Output is correct
37 Correct 226 ms 50836 KB Output is correct
38 Correct 291 ms 34236 KB Output is correct
39 Correct 182 ms 32456 KB Output is correct
40 Correct 214 ms 32960 KB Output is correct
41 Correct 151 ms 32664 KB Output is correct
42 Correct 302 ms 40152 KB Output is correct
43 Runtime error 286 ms 71892 KB Execution killed with signal 6
44 Halted 0 ms 0 KB -