답안 #285709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285709 2020-08-29T13:36:58 Z kostia244 Pipes (BOI13_pipes) C++17
44.0741 / 100
226 ms 33528 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<int, 2>> g[maxn];
ll val[maxn];
int vis[maxn], C[maxn], h[maxn], back = -1, bb;
ll s = 0;
ll dfs(int v, int p) {
	ll cur = C[v];
	vis[v] = 1;
	if(h[v]&1) s -= v;
	else s += v;
	for(auto &[i, id] : g[v]) if(i != p) {
		if(!vis[i]) {
			h[i] = h[v]+1;
			ll t = dfs(i, v);
			cur += t;
			val[id] = t;
		} else if(h[i] < h[v]) {
			if(back != -1 || (h[i]&1) != (h[v]&1)) {cout << "0\n", exit(0);}
			back = id, bb = h[v]&1;
		}
	}
	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(back != -1) val[back] = bb?s:-s;
	for(int i = 0; i < m; i++) cout << 2ll*val[i] << "\n"; cout << endl;
}
//?VK
//??V
//K?

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:41:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   41 |  for(int i = 0; i < m; i++) cout << 2ll*val[i] << "\n"; cout << endl;
      |  ^~~
pipes.cpp:41:57: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   41 |  for(int i = 0; i < m; i++) cout << 2ll*val[i] << "\n"; cout << endl;
      |                                                         ^~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 12672 KB Output isn't correct
2 Incorrect 9 ms 12800 KB Output isn't correct
3 Incorrect 9 ms 12800 KB Output isn't correct
4 Incorrect 82 ms 20324 KB Output isn't correct
5 Incorrect 9 ms 12672 KB Output isn't correct
6 Incorrect 9 ms 12672 KB Output isn't correct
7 Incorrect 8 ms 12672 KB Output isn't correct
8 Incorrect 9 ms 12672 KB Output isn't correct
9 Incorrect 9 ms 12800 KB Output isn't correct
10 Incorrect 9 ms 12800 KB Output isn't correct
11 Incorrect 9 ms 12800 KB Output isn't correct
12 Incorrect 9 ms 12800 KB Output isn't correct
13 Incorrect 59 ms 18772 KB Output isn't correct
14 Incorrect 74 ms 19960 KB Output isn't correct
15 Incorrect 79 ms 20472 KB Output isn't correct
16 Incorrect 65 ms 19192 KB Output isn't correct
17 Incorrect 74 ms 20344 KB Output isn't correct
18 Incorrect 79 ms 20344 KB Output isn't correct
19 Incorrect 97 ms 22944 KB Output isn't correct
20 Incorrect 8 ms 12672 KB Output isn't correct
21 Incorrect 9 ms 12800 KB Output isn't correct
22 Incorrect 77 ms 20344 KB Output isn't correct
23 Incorrect 61 ms 18808 KB Output isn't correct
24 Incorrect 81 ms 20472 KB Output isn't correct
25 Incorrect 65 ms 19064 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 12672 KB Output isn't correct
2 Incorrect 10 ms 12800 KB Output isn't correct
3 Correct 70 ms 22008 KB Output is correct
4 Correct 96 ms 24312 KB Output is correct
5 Correct 62 ms 19576 KB Output is correct
6 Correct 214 ms 33528 KB Output is correct
7 Incorrect 9 ms 12672 KB Output isn't correct
8 Incorrect 9 ms 12672 KB Output isn't correct
9 Correct 8 ms 12672 KB Output is correct
10 Correct 8 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 Incorrect 9 ms 12672 KB Output isn't correct
15 Incorrect 9 ms 12800 KB Output isn't correct
16 Incorrect 9 ms 12800 KB Output isn't correct
17 Correct 9 ms 12800 KB Output is correct
18 Correct 9 ms 12800 KB Output is correct
19 Correct 9 ms 12800 KB Output is correct
20 Correct 9 ms 12800 KB Output is correct
21 Correct 9 ms 12800 KB Output is correct
22 Incorrect 9 ms 12800 KB Output isn't correct
23 Incorrect 67 ms 21880 KB Output isn't correct
24 Incorrect 81 ms 23416 KB Output isn't correct
25 Correct 67 ms 22008 KB Output is correct
26 Correct 75 ms 23672 KB Output is correct
27 Correct 84 ms 23952 KB Output is correct
28 Correct 58 ms 18808 KB Output is correct
29 Correct 176 ms 29528 KB Output is correct
30 Incorrect 86 ms 25208 KB Output isn't correct
31 Incorrect 87 ms 25336 KB Output isn't correct
32 Incorrect 78 ms 21360 KB Output isn't correct
33 Correct 80 ms 23032 KB Output is correct
34 Correct 92 ms 23032 KB Output is correct
35 Correct 80 ms 24184 KB Output is correct
36 Correct 61 ms 19704 KB Output is correct
37 Correct 226 ms 33528 KB Output is correct
38 Incorrect 86 ms 24568 KB Output isn't correct
39 Incorrect 80 ms 20984 KB Output isn't correct
40 Incorrect 87 ms 23156 KB Output isn't correct
41 Correct 77 ms 24828 KB Output is correct
42 Correct 75 ms 23288 KB Output is correct
43 Correct 76 ms 24440 KB Output is correct
44 Correct 57 ms 19580 KB Output is correct
45 Correct 166 ms 30456 KB Output is correct
46 Incorrect 95 ms 25848 KB Output isn't correct
47 Incorrect 83 ms 23160 KB Output isn't correct
48 Incorrect 86 ms 25208 KB Output isn't correct
49 Correct 61 ms 20344 KB Output is correct
50 Correct 75 ms 23032 KB Output is correct
51 Correct 73 ms 21624 KB Output is correct
52 Correct 65 ms 20472 KB Output is correct
53 Correct 181 ms 30584 KB Output is correct
54 Incorrect 88 ms 24056 KB Output isn't correct