oj.uz

답안 #319024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319024 2020-11-03T18:25:16 Z rqi Pipes (BOI13_pipes) C++14
87.037 / 100
 372 ms 19044 KB 
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<pi> vpi;

#define mp make_pair
#define f first
#define s second
#define pb push_back

struct DSU{
	vi e;
	void init(int n){
		e = vi(n, -1);
	}
	int get(int a){
		if(e[a] < 0) return a;
		e[a] = get(e[a]);
		return e[a];
	}
	bool unite(int a, int b){
		a = get(a);
		b = get(b);
		if(a == b) return 0;
		if(-e[a] < -e[b]) swap(a, b);
		e[b] = a;
		return 1;
	}
};

const int mx = 500005;
const int mx1 = 100005;
int N, M;
ll c[mx1];
ll origc[mx1];
int u[mx];
int v[mx];
ll x[mx];

bool inTree[mx1];
vpi adj[mx1];

int depth[mx1];

void genTree(int node, int prv = -1, int d = 0){
	depth[node] = d;
	for(auto u: adj[node]){
		if(u.f == prv) continue;
		genTree(u.f, node, d+1);
		ll val = c[u.f];
		x[u.s]+=val;
		c[u.f]-=val;
		c[node]-=val;
	}
}

int main(){
	cin >> N >> M;
	DSU dsu;
	dsu.init(N+5);
	for(int i = 1; i <= N; i++){
		cin >> c[i];
		origc[i] = c[i];
	}
	for(int i = 1; i <= M; i++){
		cin >> u[i] >> v[i];
		if(dsu.unite(u[i], v[i])){
			inTree[i] = 1;
			adj[u[i]].pb(mp(v[i], i));
			adj[v[i]].pb(mp(u[i], i));
		}
	}

	genTree(1);

	if(M == N-1){
		if(c[1] != 0){
			assert(0==1);
			cout << 0 << "\n";
			return 0;
		}
		for(int i = 1; i <= M; i++){
			cout << 2*x[i] << "\n";
		}
		return 0;
	}

	if(M >= N+1){
		cout << 0 << "\n";
		return 0;
	}

	for(int i = 1; i <= M; i++){
		if(inTree[i]) continue;
		if(depth[u[i]] % 2 != depth[v[i]] % 2){
			cout << 0 << "\n";
			return 0;
		}
		for(int j = 1; j <= M; j++){
			x[j] = 0;
		}
		x[i] = c[1]/2;
		origc[u[i]]-=x[i];
		origc[v[i]]-=x[i];
		for(int j = 1; j <= N; j++){
			c[j] = origc[j];
		}
		genTree(1);
	}


	for(int i = 1; i <= M; i++){
		cout << 2*x[i] << "\n";
	}

}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 3 ms 2796 KB Output is correct
4 Correct 143 ms 11620 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 3 ms 2796 KB Output is correct
10 Correct 3 ms 2796 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 107 ms 9956 KB Output is correct
14 Correct 167 ms 11236 KB Output is correct
15 Correct 145 ms 11752 KB Output is correct
16 Correct 117 ms 10468 KB Output is correct
17 Correct 142 ms 11620 KB Output is correct
18 Correct 142 ms 11640 KB Output is correct
19 Correct 152 ms 15712 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 3 ms 2796 KB Output is correct
22 Correct 144 ms 11748 KB Output is correct
23 Correct 103 ms 9956 KB Output is correct
24 Correct 134 ms 11616 KB Output is correct
25 Correct 115 ms 10340 KB Output is correct

Subtask #2
57.037037037 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Incorrect 3 ms 2924 KB Output isn't correct
3 Correct 123 ms 13284 KB Output is correct
4 Correct 139 ms 14052 KB Output is correct
5 Correct 120 ms 11108 KB Output is correct
6 Correct 372 ms 17252 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 3 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 3 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Incorrect 3 ms 2924 KB Output isn't correct
16 Incorrect 3 ms 2796 KB Output isn't correct
17 Correct 3 ms 2796 KB Output is correct
18 Correct 3 ms 2796 KB Output is correct
19 Correct 3 ms 2796 KB Output is correct
20 Correct 3 ms 2816 KB Output is correct
21 Correct 4 ms 2796 KB Output is correct
22 Incorrect 3 ms 2796 KB Output isn't correct
23 Correct 121 ms 13412 KB Output is correct
24 Incorrect 158 ms 15460 KB Output isn't correct
25 Correct 124 ms 13636 KB Output is correct
26 Correct 133 ms 16740 KB Output is correct
27 Correct 140 ms 17384 KB Output is correct
28 Correct 129 ms 11356 KB Output is correct
29 Correct 311 ms 16228 KB Output is correct
30 Incorrect 162 ms 19044 KB Output isn't correct
31 Correct 162 ms 18148 KB Output is correct
32 Correct 151 ms 13032 KB Output is correct
33 Correct 128 ms 14824 KB Output is correct
34 Correct 138 ms 16100 KB Output is correct
35 Correct 138 ms 14308 KB Output is correct
36 Correct 127 ms 11236 KB Output is correct
37 Correct 370 ms 17756 KB Output is correct
38 Incorrect 157 ms 14820 KB Output isn't correct
39 Correct 150 ms 12608 KB Output is correct
40 Incorrect 157 ms 14692 KB Output isn't correct
41 Correct 135 ms 18276 KB Output is correct
42 Correct 135 ms 18276 KB Output is correct
43 Correct 131 ms 15640 KB Output is correct
44 Correct 128 ms 11236 KB Output is correct
45 Correct 291 ms 12844 KB Output is correct
46 Correct 165 ms 17124 KB Output is correct
47 Incorrect 155 ms 15076 KB Output isn't correct
48 Incorrect 161 ms 19044 KB Output isn't correct
49 Correct 118 ms 12132 KB Output is correct
50 Correct 127 ms 15456 KB Output is correct
51 Correct 133 ms 13332 KB Output is correct
52 Correct 131 ms 12644 KB Output is correct
53 Correct 311 ms 14516 KB Output is correct
54 Correct 158 ms 16296 KB Output is correct