oj.uz

답안 #443793

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443793 2021-07-12T06:22:16 Z wind_reaper Pipes (BOI13_pipes) C++17
74.0741 / 100
 500 ms 131076 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];
vector<bool> vis(MXN);

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;

	vector<int> ans(M);

	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]});
	}

	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;

		vector<int> a, b;

		while(u != x || a.empty()){
			auto [v, idx] = a.empty() || (*g[u].begin())[0] != a.back() ? *g[u].begin() : *g[u].rbegin();
			a.push_back(v);
			b.push_back(idx);
			u = v;
		}

		N = a.size();
		vector<int> suf(N);
		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 || a.empty()){
      |         ~~~~~~~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 128 ms 20600 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 5068 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 93 ms 17456 KB Output is correct
14 Correct 117 ms 19708 KB Output is correct
15 Correct 129 ms 20584 KB Output is correct
16 Correct 106 ms 18332 KB Output is correct
17 Correct 134 ms 20388 KB Output is correct
18 Correct 123 ms 20492 KB Output is correct
19 Correct 108 ms 19580 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 128 ms 20568 KB Output is correct
23 Correct 100 ms 17464 KB Output is correct
24 Correct 124 ms 20484 KB Output is correct
25 Correct 106 ms 18020 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 188 ms 131076 KB Execution killed with signal 9
2 Runtime error 192 ms 131076 KB Execution killed with signal 9
3 Correct 90 ms 18936 KB Output is correct
4 Correct 72 ms 18212 KB Output is correct
5 Correct 74 ms 17892 KB Output is correct
6 Correct 494 ms 68444 KB Output is correct
7 Runtime error 192 ms 131076 KB Execution killed with signal 9
8 Runtime error 194 ms 131076 KB Execution killed with signal 9
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Runtime error 187 ms 131076 KB Execution killed with signal 9
15 Runtime error 187 ms 131076 KB Execution killed with signal 9
16 Runtime error 193 ms 131076 KB Execution killed with signal 9
17 Correct 3 ms 5068 KB Output is correct
18 Correct 4 ms 5068 KB Output is correct
19 Correct 4 ms 5068 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 4 ms 5324 KB Output is correct
22 Runtime error 192 ms 131076 KB Execution killed with signal 9
23 Runtime error 237 ms 131076 KB Execution killed with signal 9
24 Runtime error 258 ms 131076 KB Execution killed with signal 9
25 Correct 93 ms 18920 KB Output is correct
26 Correct 73 ms 18204 KB Output is correct
27 Correct 76 ms 18116 KB Output is correct
28 Correct 78 ms 18884 KB Output is correct
29 Correct 369 ms 55812 KB Output is correct
30 Runtime error 245 ms 131076 KB Execution killed with signal 9
31 Runtime error 238 ms 131076 KB Execution killed with signal 9
32 Runtime error 285 ms 131076 KB Execution killed with signal 9
33 Correct 97 ms 19660 KB Output is correct
34 Correct 74 ms 18236 KB Output is correct
35 Correct 74 ms 18196 KB Output is correct
36 Correct 73 ms 18352 KB Output is correct
37 Correct 500 ms 68452 KB Output is correct
38 Runtime error 272 ms 131076 KB Execution killed with signal 9
39 Runtime error 288 ms 131076 KB Execution killed with signal 9
40 Runtime error 257 ms 131076 KB Execution killed with signal 9
41 Correct 83 ms 19156 KB Output is correct
42 Correct 74 ms 18288 KB Output is correct
43 Correct 71 ms 18224 KB Output is correct
44 Correct 72 ms 17908 KB Output is correct
45 Correct 487 ms 60872 KB Output is correct
46 Runtime error 261 ms 131076 KB Execution killed with signal 9
47 Runtime error 266 ms 131076 KB Execution killed with signal 9
48 Runtime error 236 ms 131076 KB Execution killed with signal 9
49 Correct 105 ms 19340 KB Output is correct
50 Correct 81 ms 18228 KB Output is correct
51 Correct 77 ms 18304 KB Output is correct
52 Correct 75 ms 18008 KB Output is correct
53 Correct 448 ms 62112 KB Output is correct
54 Runtime error 266 ms 131076 KB Execution killed with signal 9