oj.uz

Submission #319023

# Submission time Handle Problem Language Result Execution time Memory
319023 2020-11-03T18:20:16 Z rqi Pipes (BOI13_pipes) C++14
74.0741 / 100
 389 ms 17892 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];
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];
	}
	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;
		}
		x[i] = c[1]/2;
	}


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

}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 3 ms 2796 KB Output is correct
4 Correct 136 ms 10596 KB Output is correct
5 Correct 2 ms 2688 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 3 ms 2796 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 106 ms 9340 KB Output is correct
14 Correct 131 ms 10340 KB Output is correct
15 Correct 137 ms 10724 KB Output is correct
16 Correct 115 ms 9700 KB Output is correct
17 Correct 139 ms 10848 KB Output is correct
18 Correct 140 ms 10724 KB Output is correct
19 Correct 141 ms 14820 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 3 ms 2796 KB Output is correct
22 Correct 139 ms 10728 KB Output is correct
23 Correct 108 ms 9188 KB Output is correct
24 Correct 139 ms 10724 KB Output is correct
25 Correct 110 ms 9572 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2668 KB Output isn't correct
2 Incorrect 3 ms 2796 KB Output isn't correct
3 Correct 123 ms 12516 KB Output is correct
4 Correct 131 ms 13236 KB Output is correct
5 Correct 124 ms 10212 KB Output is correct
6 Correct 370 ms 16356 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Incorrect 2 ms 2668 KB Output isn't correct
9 Correct 3 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Incorrect 2 ms 2668 KB Output isn't correct
15 Incorrect 3 ms 2796 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 2796 KB Output is correct
21 Correct 4 ms 2796 KB Output is correct
22 Incorrect 3 ms 2796 KB Output isn't correct
23 Incorrect 113 ms 12132 KB Output isn't correct
24 Incorrect 145 ms 14308 KB Output isn't correct
25 Correct 122 ms 12516 KB Output is correct
26 Correct 136 ms 15588 KB Output is correct
27 Correct 132 ms 16228 KB Output is correct
28 Correct 137 ms 10472 KB Output is correct
29 Correct 359 ms 15204 KB Output is correct
30 Incorrect 154 ms 17892 KB Output isn't correct
31 Incorrect 148 ms 17112 KB Output isn't correct
32 Incorrect 141 ms 12004 KB Output isn't correct
33 Correct 133 ms 13796 KB Output is correct
34 Correct 136 ms 15204 KB Output is correct
35 Correct 131 ms 13284 KB Output is correct
36 Correct 128 ms 10208 KB Output is correct
37 Correct 389 ms 16484 KB Output is correct
38 Incorrect 156 ms 13672 KB Output isn't correct
39 Incorrect 140 ms 11620 KB Output isn't correct
40 Incorrect 144 ms 13668 KB Output isn't correct
41 Correct 132 ms 17472 KB Output is correct
42 Correct 131 ms 17252 KB Output is correct
43 Correct 129 ms 14564 KB Output is correct
44 Correct 119 ms 10340 KB Output is correct
45 Correct 297 ms 12132 KB Output is correct
46 Incorrect 144 ms 15972 KB Output isn't correct
47 Incorrect 156 ms 13924 KB Output isn't correct
48 Incorrect 148 ms 17892 KB Output isn't correct
49 Correct 120 ms 11240 KB Output is correct
50 Correct 130 ms 14436 KB Output is correct
51 Correct 129 ms 12260 KB Output is correct
52 Correct 126 ms 11396 KB Output is correct
53 Correct 311 ms 13668 KB Output is correct
54 Incorrect 141 ms 15456 KB Output isn't correct