oj.uz

답안 #319026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319026 2020-11-03T18:28:37 Z rqi Pipes (BOI13_pipes) C++14
77.963 / 100
 376 ms 35044 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){ //Good
		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){
			assert(0==1);
			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 144 ms 11748 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 3 ms 2796 KB Output is correct
12 Correct 3 ms 2816 KB Output is correct
13 Correct 111 ms 9828 KB Output is correct
14 Correct 131 ms 11116 KB Output is correct
15 Correct 146 ms 11620 KB Output is correct
16 Correct 114 ms 10340 KB Output is correct
17 Correct 136 ms 11492 KB Output is correct
18 Correct 136 ms 11492 KB Output is correct
19 Correct 144 ms 15588 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 3 ms 2796 KB Output is correct
22 Correct 137 ms 11592 KB Output is correct
23 Correct 106 ms 9832 KB Output is correct
24 Correct 137 ms 11492 KB Output is correct
25 Correct 111 ms 10212 KB Output is correct

Subtask #2
47.962962963 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Incorrect 3 ms 2924 KB Output isn't correct
3 Runtime error 142 ms 26084 KB Execution killed with signal 6 (could be triggered by violating memory limits)
4 Correct 127 ms 13924 KB Output is correct
5 Correct 120 ms 10852 KB Output is correct
6 Correct 372 ms 17636 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Runtime error 6 ms 5356 KB Execution killed with signal 6 (could be triggered by violating memory limits)
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 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 Runtime error 7 ms 5644 KB Execution killed with signal 6 (could be triggered by violating memory limits)
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 127 ms 12644 KB Output is correct
24 Incorrect 162 ms 14668 KB Output isn't correct
25 Runtime error 137 ms 25572 KB Execution killed with signal 6 (could be triggered by violating memory limits)
26 Correct 128 ms 15844 KB Output is correct
27 Correct 128 ms 16484 KB Output is correct
28 Correct 136 ms 10724 KB Output is correct
29 Correct 327 ms 15616 KB Output is correct
30 Incorrect 159 ms 18148 KB Output isn't correct
31 Correct 164 ms 17512 KB Output is correct
32 Correct 152 ms 12260 KB Output is correct
33 Runtime error 143 ms 28132 KB Execution killed with signal 6 (could be triggered by violating memory limits)
34 Correct 133 ms 15460 KB Output is correct
35 Correct 132 ms 13540 KB Output is correct
36 Correct 127 ms 10596 KB Output is correct
37 Correct 376 ms 16868 KB Output is correct
38 Incorrect 155 ms 14052 KB Output isn't correct
39 Correct 147 ms 11876 KB Output is correct
40 Incorrect 161 ms 14052 KB Output isn't correct
41 Runtime error 156 ms 35044 KB Execution killed with signal 6 (could be triggered by violating memory limits)
42 Correct 130 ms 17512 KB Output is correct
43 Correct 129 ms 14820 KB Output is correct
44 Correct 124 ms 10576 KB Output is correct
45 Correct 292 ms 12388 KB Output is correct
46 Correct 165 ms 16352 KB Output is correct
47 Incorrect 167 ms 14308 KB Output isn't correct
48 Incorrect 159 ms 18276 KB Output isn't correct
49 Runtime error 135 ms 22628 KB Execution killed with signal 6 (could be triggered by violating memory limits)
50 Correct 130 ms 14692 KB Output is correct
51 Correct 130 ms 12388 KB Output is correct
52 Correct 130 ms 11748 KB Output is correct
53 Correct 321 ms 13796 KB Output is correct
54 Correct 155 ms 15716 KB Output is correct