oj.uz

답안 #443805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443805 2021-07-12T06:38:38 Z wind_reaper Pipes (BOI13_pipes) C++17
74.0741 / 100
 592 ms 68428 KB 
#include <bits/stdc++.h>

using namespace std;
#define int int64_t

const int MXN = 100000;

set<array<int, 2>> g[MXN];
int change[MXN], suf[MXN];
bitset<MXN> vis;
int a[MXN], b[MXN], ans[MXN + 1];

void solve(){
	int N, M;
	cin >> N >> M;

	for(int i = 0; i < N; i++)
		cin >> change[i];

	for(int i = 0; i < M; i++){
		int u, v;
		cin >> u >> v;
		--u, --v;
		g[u].insert({v, i});
		g[v].insert({u, i});
	}

	if(M > N){
		cout << 0 << '\n';
		return;
	}

	queue<array<int, 3>> q;
	for(int i = 0; i < N; i++)
		if(g[i].size() < 2){
			q.push({i, (*g[i].begin())[0], (*g[i].begin())[1]});
			vis[i] = 1;
		}

	int cnt = 0;

	while(!q.empty()){
		auto [u, par, idx] = q.front();
		q.pop();

		++cnt;

		int t = change[u];
		ans[idx] += 2*t;
		change[u] -= t;
		change[par] -= t;

		g[par].erase({u, idx});

		if(g[par].size() == 1 && !vis[par]){
			q.push({par, (*g[par].begin())[0], (*g[par].begin())[1]});
			vis[par] = 1;
		}
	}

	if(cnt < N){
		if(!((N - cnt) & 1)){
			cout << 0 << '\n';
			return;
		}

		int x;
		for(int i = 0; i < N; i++) 
			if(!vis[i]) 
				x = i;

		int u = x;
		N = 0;

		while(u != x || N == 0){
			auto [v, idx] = (N == 0 || (*g[u].begin())[0] != a[N-1] ? *g[u].begin() : *g[u].rbegin());
			a[N] = v;
			b[N++] = idx;
			u = v;
		}

		suf[N-1] = change[a[N-1]];
		for(int i = N - 2; i >= 0; --i)
			suf[i] = change[a[i]] - suf[i+1];
		int pre = 0;

		for(int i = 0; i < N; i++){
			pre = change[a[i]] - pre;
			ans[b[i]] = (pre + (i + 1 < N ? suf[i+1] : 0));
		}
	}

	for(int i = 0; i < M; i++)
		cout << ans[i] << '\n';
}

int32_t main(){
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL); 

	solve();

	return 0; 
}

Compilation message

pipes.cpp: In function 'void solve()':
pipes.cpp:75:16: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |   while(u != x || N == 0){
      |         ~~~~~~~^~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 137 ms 20428 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5116 KB Output is correct
11 Correct 4 ms 5196 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 110 ms 17444 KB Output is correct
14 Correct 134 ms 19656 KB Output is correct
15 Correct 133 ms 20564 KB Output is correct
16 Correct 112 ms 18260 KB Output is correct
17 Correct 136 ms 20428 KB Output is correct
18 Correct 135 ms 20528 KB Output is correct
19 Correct 111 ms 19652 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 4 ms 5068 KB Output is correct
22 Correct 131 ms 20600 KB Output is correct
23 Correct 107 ms 17420 KB Output is correct
24 Correct 144 ms 20544 KB Output is correct
25 Correct 117 ms 18036 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 15 ms 16380 KB Execution killed with signal 11
2 Runtime error 15 ms 16616 KB Execution killed with signal 11
3 Correct 119 ms 18928 KB Output is correct
4 Correct 78 ms 18268 KB Output is correct
5 Correct 76 ms 17972 KB Output is correct
6 Correct 592 ms 68428 KB Output is correct
7 Runtime error 15 ms 16288 KB Execution killed with signal 11
8 Runtime error 15 ms 16344 KB Execution killed with signal 11
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5016 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Runtime error 14 ms 16280 KB Execution killed with signal 11
15 Runtime error 15 ms 16544 KB Execution killed with signal 11
16 Runtime error 15 ms 16588 KB Execution killed with signal 11
17 Correct 5 ms 5068 KB Output is correct
18 Correct 4 ms 5068 KB Output is correct
19 Correct 4 ms 5164 KB Output is correct
20 Correct 4 ms 5068 KB Output is correct
21 Correct 5 ms 5324 KB Output is correct
22 Runtime error 15 ms 16568 KB Execution killed with signal 11
23 Runtime error 87 ms 38952 KB Execution killed with signal 11
24 Runtime error 116 ms 44492 KB Execution killed with signal 11
25 Correct 101 ms 18972 KB Output is correct
26 Correct 94 ms 18200 KB Output is correct
27 Correct 90 ms 18116 KB Output is correct
28 Correct 82 ms 18860 KB Output is correct
29 Correct 414 ms 55864 KB Output is correct
30 Runtime error 101 ms 42972 KB Execution killed with signal 11
31 Runtime error 93 ms 43620 KB Execution killed with signal 11
32 Runtime error 136 ms 45264 KB Execution killed with signal 11
33 Correct 111 ms 19668 KB Output is correct
34 Correct 89 ms 18300 KB Output is correct
35 Correct 78 ms 18300 KB Output is correct
36 Correct 80 ms 18372 KB Output is correct
37 Correct 537 ms 68376 KB Output is correct
38 Runtime error 112 ms 43864 KB Execution killed with signal 11
39 Runtime error 167 ms 45224 KB Execution killed with signal 11
40 Runtime error 115 ms 44576 KB Execution killed with signal 11
41 Correct 79 ms 19140 KB Output is correct
42 Correct 78 ms 18200 KB Output is correct
43 Correct 78 ms 18188 KB Output is correct
44 Correct 82 ms 17964 KB Output is correct
45 Correct 523 ms 60864 KB Output is correct
46 Runtime error 107 ms 43320 KB Execution killed with signal 11
47 Runtime error 112 ms 44460 KB Execution killed with signal 11
48 Runtime error 97 ms 43676 KB Execution killed with signal 11
49 Correct 110 ms 19272 KB Output is correct
50 Correct 88 ms 18316 KB Output is correct
51 Correct 80 ms 18256 KB Output is correct
52 Correct 79 ms 17988 KB Output is correct
53 Correct 504 ms 62120 KB Output is correct
54 Runtime error 110 ms 43664 KB Execution killed with signal 11