oj.uz

Submission #285732

# Submission time Handle Problem Language Result Execution time Memory
285732 2020-08-29T14:07:09 Z kostia244 Pipes (BOI13_pipes) C++17
70 / 100
 257 ms 39916 KB 
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define all(v) (v).begin(),(v).end()
using ll = long long;
using namespace std;
const int maxn = 1<<19;
int n, m;
vector<array<ll, 2>> g[maxn];
ll val[maxn];
ll vis[maxn], C[maxn], h[maxn], L = -1, R, ID, bb;
ll s = 0;
void dfs(int v, int p) {
	ll cur = C[v];
	vis[v] = 1;
	if(h[v]&1) s -= C[v];
	else s += C[v];
	for(auto &[i, id] : g[v]) if(i != p) {
		if(!vis[i]) {
			h[i] = h[v]+1;
			dfs(i, v);
		} else if(h[i] < h[v]) {
			if(L != -1 || (h[i]&1) != (h[v]&1)) {cout << "0\n", exit(0);}
			L = i, R = v, ID = id, bb = h[v]&1;
		}
	}
}
ll recover(int v, int p) {
	ll cur = C[v];
	for(auto [i, id] : g[v]) if(i != p && id != ID) {
		ll t = recover(i, v);
		val[id] = t;
		cur += t;
	}
	return -cur;
}
signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i++) cin >> C[i];
	for(int f, t, i = 0; i < m; i++) {
		cin >> f >> t;
		g[f].push_back({t, i});
		g[t].push_back({f, i});
	}
	dfs(1, 1);
	if(L != -1) {
		//cout << ID << ":\n";
		if(bb) s *= -1;
		C[L] -= s/2;
		C[R] -= s/2;
		val[ID] = (-s)/2;
	}
	recover(1, 1);
	for(int i = 0; i < m; i++) cout << -2ll*val[i] << "\n"; cout << endl;
}
//?VK
//??V
//K?

Compilation message

pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:13:5: warning: unused variable 'cur' [-Wunused-variable]
   13 |  ll cur = C[v];
      |     ^~~
pipes.cpp: In function 'int main()':
pipes.cpp:54:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   54 |  for(int i = 0; i < m; i++) cout << -2ll*val[i] << "\n"; cout << endl;
      |  ^~~
pipes.cpp:54:58: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   54 |  for(int i = 0; i < m; i++) cout << -2ll*val[i] << "\n"; cout << endl;
      |                                                          ^~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 12672 KB Output isn't correct
2 Incorrect 9 ms 12672 KB Output isn't correct
3 Incorrect 10 ms 12800 KB Output isn't correct
4 Incorrect 81 ms 20472 KB Output isn't correct
5 Incorrect 10 ms 12672 KB Output isn't correct
6 Incorrect 9 ms 12672 KB Output isn't correct
7 Incorrect 9 ms 12672 KB Output isn't correct
8 Incorrect 9 ms 12672 KB Output isn't correct
9 Incorrect 10 ms 12800 KB Output isn't correct
10 Incorrect 10 ms 12800 KB Output isn't correct
11 Incorrect 10 ms 12800 KB Output isn't correct
12 Incorrect 10 ms 12800 KB Output isn't correct
13 Incorrect 64 ms 19064 KB Output isn't correct
14 Incorrect 76 ms 20088 KB Output isn't correct
15 Incorrect 81 ms 20600 KB Output isn't correct
16 Incorrect 78 ms 20312 KB Output isn't correct
17 Incorrect 86 ms 20472 KB Output isn't correct
18 Incorrect 96 ms 21752 KB Output isn't correct
19 Incorrect 99 ms 24568 KB Output isn't correct
20 Incorrect 9 ms 12672 KB Output isn't correct
21 Incorrect 10 ms 12800 KB Output isn't correct
22 Incorrect 81 ms 20600 KB Output isn't correct
23 Incorrect 66 ms 19192 KB Output isn't correct
24 Incorrect 81 ms 20600 KB Output isn't correct
25 Incorrect 79 ms 20088 KB Output isn't correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12672 KB Output is correct
2 Correct 10 ms 12800 KB Output is correct
3 Correct 72 ms 21960 KB Output is correct
4 Correct 82 ms 23928 KB Output is correct
5 Correct 59 ms 20220 KB Output is correct
6 Correct 257 ms 39916 KB Output is correct
7 Correct 9 ms 12672 KB Output is correct
8 Correct 9 ms 12672 KB Output is correct
9 Correct 9 ms 12672 KB Output is correct
10 Correct 9 ms 12672 KB Output is correct
11 Correct 10 ms 12672 KB Output is correct
12 Correct 9 ms 12672 KB Output is correct
13 Correct 9 ms 12672 KB Output is correct
14 Correct 9 ms 12672 KB Output is correct
15 Correct 12 ms 12800 KB Output is correct
16 Correct 10 ms 12800 KB Output is correct
17 Correct 10 ms 12800 KB Output is correct
18 Correct 11 ms 12800 KB Output is correct
19 Correct 10 ms 12800 KB Output is correct
20 Correct 11 ms 12800 KB Output is correct
21 Correct 12 ms 12928 KB Output is correct
22 Correct 11 ms 12800 KB Output is correct
23 Correct 92 ms 23288 KB Output is correct
24 Correct 111 ms 24952 KB Output is correct
25 Correct 80 ms 22012 KB Output is correct
26 Correct 85 ms 23544 KB Output is correct
27 Correct 92 ms 23676 KB Output is correct
28 Correct 69 ms 19580 KB Output is correct
29 Correct 209 ms 34424 KB Output is correct
30 Correct 112 ms 26868 KB Output is correct
31 Correct 115 ms 27132 KB Output is correct
32 Correct 98 ms 22648 KB Output is correct
33 Correct 84 ms 23032 KB Output is correct
34 Correct 79 ms 23032 KB Output is correct
35 Correct 83 ms 23956 KB Output is correct
36 Correct 61 ms 20472 KB Output is correct
37 Correct 250 ms 39804 KB Output is correct
38 Correct 108 ms 26320 KB Output is correct
39 Correct 101 ms 22132 KB Output is correct
40 Correct 103 ms 24700 KB Output is correct
41 Correct 81 ms 24440 KB Output is correct
42 Correct 84 ms 23288 KB Output is correct
43 Correct 86 ms 24184 KB Output is correct
44 Correct 64 ms 20216 KB Output is correct
45 Correct 199 ms 36720 KB Output is correct
46 Correct 111 ms 27632 KB Output is correct
47 Correct 104 ms 24824 KB Output is correct
48 Correct 110 ms 26876 KB Output is correct
49 Correct 68 ms 20476 KB Output is correct
50 Correct 83 ms 23032 KB Output is correct
51 Correct 75 ms 21904 KB Output is correct
52 Correct 69 ms 20984 KB Output is correct
53 Correct 219 ms 36088 KB Output is correct
54 Correct 119 ms 25848 KB Output is correct