답안 #84261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
84261 2018-11-14T03:53:17 Z Dat160601 Pipes (BOI13_pipes) C++17
72.7778 / 100
265 ms 18652 KB
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int n, m, cnt[100007], u, v, elim = 0, cur = 0;
long long c[100007], ans[500007], sum = 0;
vector < pair <int, int> > edge[100007];

void solve(){
	queue <int> q;
	memset(cnt, 0, sizeof(cnt));
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < (int)edge[i].size(); j++){
			if(edge[i][j].se == elim) continue;
			cnt[i]++;
		}
		if(cnt[i] == 1) q.push(i);
	}
	while(!q.empty()){
		int u = q.front();
		cnt[u]--;
		q.pop();
		for(int i = 0; i < (int)edge[u].size(); i++){
			int v = edge[u][i].fi, id = edge[u][i].se;
			//cout << u << " " << v << " " << id << endl;
			if(id == elim || cnt[v] <= 0) continue;
			ans[id] = c[u] * 2LL;
			c[u] -= ans[id] / 2LL, c[v] -= ans[id] / 2LL;
			cnt[v]--;
			if(cnt[v] == 1) q.push(v);
		}
	}
	for(int i = 1; i <= n; i++){
		if(c[i] != 0){
			cout << 0;
			exit(0);
		}
	}
	for(int i = 1; i <= m; i++) cout << ans[i] << "\n";
	exit(0);
}

void dfs(int u, int par){
	cur++;
	if(cur & 1) sum += c[u];
	else sum -= c[u];
	for(int i = 0; i < (int)edge[u].size(); i++){
		int v = edge[u][i].fi, id = edge[u][i].se;
		if(v == par) continue;
		if(cur == n){
			ans[id] = sum;
			c[u] -= sum / 2LL;
			c[v] -= sum / 2LL;
			elim = id;
			return;
		}
		dfs(v, u);
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> c[i];
	}
	for(int i = 1; i <= m; i++){
		cin >> u >> v;
		edge[u].pb(mp(v, i));
		edge[v].pb(mp(u, i));
	}
	if(m > n) return cout << 0, 0;
	if(m == n - 1) solve();
	if(n % 2 == 0) return cout << 0, 0;
	dfs(1, 1);
	solve();
}
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3064 KB Output is correct
2 Correct 4 ms 3200 KB Output is correct
3 Correct 5 ms 3240 KB Output is correct
4 Correct 74 ms 9468 KB Output is correct
5 Correct 5 ms 9468 KB Output is correct
6 Correct 4 ms 9468 KB Output is correct
7 Correct 4 ms 9468 KB Output is correct
8 Correct 4 ms 9468 KB Output is correct
9 Correct 5 ms 9468 KB Output is correct
10 Correct 5 ms 9468 KB Output is correct
11 Correct 5 ms 9468 KB Output is correct
12 Correct 5 ms 9468 KB Output is correct
13 Correct 59 ms 9468 KB Output is correct
14 Correct 77 ms 9468 KB Output is correct
15 Correct 74 ms 9680 KB Output is correct
16 Correct 68 ms 9680 KB Output is correct
17 Correct 74 ms 9680 KB Output is correct
18 Correct 90 ms 9960 KB Output is correct
19 Correct 82 ms 9960 KB Output is correct
20 Correct 4 ms 9960 KB Output is correct
21 Correct 5 ms 9960 KB Output is correct
22 Correct 72 ms 9972 KB Output is correct
23 Correct 62 ms 9972 KB Output is correct
24 Correct 87 ms 10204 KB Output is correct
25 Correct 61 ms 10204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 10204 KB Output isn't correct
2 Incorrect 4 ms 10204 KB Output isn't correct
3 Correct 55 ms 10204 KB Output is correct
4 Correct 76 ms 10204 KB Output is correct
5 Correct 64 ms 10204 KB Output is correct
6 Correct 260 ms 18576 KB Output is correct
7 Incorrect 4 ms 18576 KB Output isn't correct
8 Incorrect 5 ms 18576 KB Output isn't correct
9 Correct 4 ms 18576 KB Output is correct
10 Correct 4 ms 18576 KB Output is correct
11 Correct 4 ms 18576 KB Output is correct
12 Correct 4 ms 18576 KB Output is correct
13 Correct 4 ms 18576 KB Output is correct
14 Incorrect 4 ms 18576 KB Output isn't correct
15 Incorrect 5 ms 18576 KB Output isn't correct
16 Incorrect 6 ms 18576 KB Output isn't correct
17 Correct 4 ms 18576 KB Output is correct
18 Correct 4 ms 18576 KB Output is correct
19 Correct 4 ms 18576 KB Output is correct
20 Correct 4 ms 18576 KB Output is correct
21 Correct 5 ms 18576 KB Output is correct
22 Incorrect 4 ms 18576 KB Output isn't correct
23 Incorrect 65 ms 18576 KB Output isn't correct
24 Incorrect 59 ms 18576 KB Output isn't correct
25 Correct 67 ms 18576 KB Output is correct
26 Correct 58 ms 18576 KB Output is correct
27 Correct 59 ms 18576 KB Output is correct
28 Correct 62 ms 18576 KB Output is correct
29 Correct 234 ms 18576 KB Output is correct
30 Incorrect 56 ms 18576 KB Output isn't correct
31 Incorrect 81 ms 18576 KB Output isn't correct
32 Incorrect 80 ms 18576 KB Output isn't correct
33 Correct 59 ms 18576 KB Output is correct
34 Correct 64 ms 18576 KB Output is correct
35 Correct 103 ms 18576 KB Output is correct
36 Correct 62 ms 18576 KB Output is correct
37 Correct 265 ms 18652 KB Output is correct
38 Incorrect 59 ms 18652 KB Output isn't correct
39 Incorrect 79 ms 18652 KB Output isn't correct
40 Incorrect 60 ms 18652 KB Output isn't correct
41 Incorrect 94 ms 18652 KB Output isn't correct
42 Correct 60 ms 18652 KB Output is correct
43 Correct 63 ms 18652 KB Output is correct
44 Correct 59 ms 18652 KB Output is correct
45 Correct 183 ms 18652 KB Output is correct
46 Incorrect 60 ms 18652 KB Output isn't correct
47 Incorrect 58 ms 18652 KB Output isn't correct
48 Incorrect 91 ms 18652 KB Output isn't correct
49 Correct 55 ms 18652 KB Output is correct
50 Correct 64 ms 18652 KB Output is correct
51 Correct 59 ms 18652 KB Output is correct
52 Correct 62 ms 18652 KB Output is correct
53 Correct 203 ms 18652 KB Output is correct
54 Incorrect 57 ms 18652 KB Output isn't correct