oj.uz

답안 #1050995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050995 2024-08-09T17:48:13 Z ortsac Pipes (BOI13_pipes) C++17
57.2222 / 100
 88 ms 39304 KB 
#include <bits/stdc++.h>
 
using namespace std;

#define int long long
#define pii pair<long long, long long>
#define fr first
#define se second

const int MAXN = 1e5 + 10;
const int MAXM = 5e5 + 10;
vector<pii> adj[MAXN];
int bEdge = -1;
vector<pii> edges;
int h[MAXN];
int change[MAXN];
bool vis[MAXN];
int dad[MAXN];
int dp[MAXN];
int peso[MAXM];

void dfs(int node) {
    vis[node] = 1;
    for (auto [u, z] : adj[node]) {
        if (u == dad[node]) continue;
        if (vis[u]) bEdge = z;
        else {
            dad[u] = node;
            h[u] = h[node] + 1;
            dfs(u);
        }
    }
}

void calc(int node) {
    vis[node] = 1;
    for (auto [u, z] : adj[node]) {
        if (vis[u]) continue;
        calc(u);
        dp[node] += (change[u] - dp[u]);
        peso[z] += (change[u] - dp[u]);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> change[i];
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        edges.push_back({a, b});
        adj[a].push_back({b, i});
        adj[b].push_back({a, i});
    }
    if (m > (n + 1)) {
        cout << "0\n";
        return 0;
    }
    dfs(1);
    if (bEdge != -1) {
        auto u = edges[bEdge];
        int a = u.fr, b = u.se;
        if (h[a] > h[b]) swap(a, b);
        // a is higher than b
        int oa = a, ob = b;
        while (h[b] > h[a]) {
            b = dad[b];
        }
        while (a != b) {
            a = dad[a];
            b = dad[b];
        }
        int lca = a;
        a = oa;
        b = ob;
        int tam = h[a] + h[b] - 2*h[lca] + 1;
        if ((tam % 2LL) == 0) {
            cout << "0\n";
            return 0;
        }
    }
    memset(vis, 0, sizeof vis);
    calc(1);
    if (dp[1] == change[1]) {
        for (int i = 0; i < m; i++) cout << 2*peso[i] << "\n";
        return 0;
    }
    if (bEdge == -1) {
        cout << "0\n";
        return 0;
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 33 ms 16888 KB Output is correct
5 Correct 1 ms 5464 KB Output is correct
6 Correct 1 ms 5468 KB Output is correct
7 Correct 1 ms 5468 KB Output is correct
8 Correct 1 ms 5468 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 2 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 1 ms 5720 KB Output is correct
13 Correct 28 ms 13816 KB Output is correct
14 Correct 28 ms 14788 KB Output is correct
15 Correct 33 ms 15300 KB Output is correct
16 Correct 30 ms 14272 KB Output is correct
17 Correct 51 ms 16832 KB Output is correct
18 Correct 36 ms 16972 KB Output is correct
19 Correct 43 ms 20936 KB Output is correct
20 Correct 1 ms 5468 KB Output is correct
21 Correct 1 ms 5724 KB Output is correct
22 Correct 30 ms 16892 KB Output is correct
23 Correct 26 ms 13772 KB Output is correct
24 Correct 31 ms 15232 KB Output is correct
25 Correct 26 ms 15820 KB Output is correct

Subtask #2
27.2222222222 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 5468 KB Output isn't correct
2 Incorrect 1 ms 5724 KB Output isn't correct
3 Correct 26 ms 14640 KB Output is correct
4 Incorrect 53 ms 22388 KB Output isn't correct
5 Correct 21 ms 11980 KB Output is correct
6 Correct 88 ms 39300 KB Output is correct
7 Incorrect 1 ms 5468 KB Output isn't correct
8 Incorrect 1 ms 5652 KB Output isn't correct
9 Correct 1 ms 5468 KB Output is correct
10 Incorrect 1 ms 5468 KB Output isn't correct
11 Incorrect 1 ms 5468 KB Output isn't correct
12 Correct 1 ms 5468 KB Output is correct
13 Correct 1 ms 5468 KB Output is correct
14 Incorrect 1 ms 5468 KB Output isn't correct
15 Incorrect 1 ms 5724 KB Output isn't correct
16 Incorrect 1 ms 5720 KB Output isn't correct
17 Correct 1 ms 5724 KB Output is correct
18 Incorrect 1 ms 5724 KB Output isn't correct
19 Incorrect 1 ms 5724 KB Output isn't correct
20 Correct 2 ms 5724 KB Output is correct
21 Correct 1 ms 5724 KB Output is correct
22 Incorrect 1 ms 5724 KB Output isn't correct
23 Incorrect 29 ms 17780 KB Output isn't correct
24 Incorrect 31 ms 19148 KB Output isn't correct
25 Correct 25 ms 14540 KB Output is correct
26 Incorrect 31 ms 20172 KB Output isn't correct
27 Incorrect 34 ms 20668 KB Output isn't correct
28 Correct 40 ms 12740 KB Output is correct
29 Correct 72 ms 33836 KB Output is correct
30 Incorrect 53 ms 23244 KB Output isn't correct
31 Incorrect 40 ms 23296 KB Output isn't correct
32 Incorrect 29 ms 16072 KB Output isn't correct
33 Correct 34 ms 15632 KB Output is correct
34 Incorrect 56 ms 19392 KB Output isn't correct
35 Incorrect 32 ms 22460 KB Output isn't correct
36 Correct 21 ms 12420 KB Output is correct
37 Correct 87 ms 39304 KB Output is correct
38 Incorrect 32 ms 20672 KB Output isn't correct
39 Incorrect 27 ms 15624 KB Output isn't correct
40 Incorrect 32 ms 20416 KB Output isn't correct
41 Correct 29 ms 17860 KB Output is correct
42 Incorrect 33 ms 21444 KB Output isn't correct
43 Incorrect 43 ms 22980 KB Output isn't correct
44 Correct 21 ms 11972 KB Output is correct
45 Correct 71 ms 37216 KB Output is correct
46 Incorrect 40 ms 22224 KB Output isn't correct
47 Incorrect 30 ms 18876 KB Output isn't correct
48 Incorrect 34 ms 21448 KB Output isn't correct
49 Correct 24 ms 12704 KB Output is correct
50 Incorrect 31 ms 19252 KB Output isn't correct
51 Incorrect 30 ms 17340 KB Output isn't correct
52 Correct 23 ms 12236 KB Output is correct
53 Correct 73 ms 35352 KB Output is correct
54 Incorrect 41 ms 19984 KB Output isn't correct