oj.uz

Submission #1051022

# Submission time Handle Problem Language Result Execution time Memory
1051022 2024-08-09T18:30:39 Z ortsac Pipes (BOI13_pipes) C++17
67.5926 / 100
 99 ms 39296 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);
    int lca = 0;
    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];
        }
        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) || (lca == 1) || ((change[1] - dp[1]) % 2LL)) {
        cout << "0\n";
        return 0;
    }
    //cout << "0\n";
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5464 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5720 KB Output is correct
4 Correct 30 ms 17052 KB Output is correct
5 Correct 1 ms 5468 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 1 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 1 ms 5724 KB Output is correct
13 Correct 27 ms 13912 KB Output is correct
14 Correct 31 ms 14816 KB Output is correct
15 Correct 36 ms 15300 KB Output is correct
16 Correct 26 ms 14272 KB Output is correct
17 Correct 30 ms 17000 KB Output is correct
18 Correct 33 ms 17016 KB Output is correct
19 Correct 42 ms 20924 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 16876 KB Output is correct
23 Correct 25 ms 13872 KB Output is correct
24 Correct 34 ms 15296 KB Output is correct
25 Correct 26 ms 15812 KB Output is correct

Subtask #2
37.5925925926 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5464 KB Output isn't correct
2 Incorrect 1 ms 5724 KB Output isn't correct
3 Correct 30 ms 14696 KB Output is correct
4 Correct 41 ms 22460 KB Output is correct
5 Correct 23 ms 11980 KB Output is correct
6 Correct 89 ms 39248 KB Output is correct
7 Incorrect 1 ms 5468 KB Output isn't correct
8 Incorrect 1 ms 5468 KB Output isn't correct
9 Correct 1 ms 5468 KB Output is correct
10 Correct 1 ms 5468 KB Output is 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 5724 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 Correct 1 ms 5724 KB Output is correct
20 Correct 1 ms 5724 KB Output is correct
21 Correct 1 ms 5724 KB Output is correct
22 Incorrect 1 ms 5644 KB Output isn't correct
23 Incorrect 29 ms 17592 KB Output isn't correct
24 Incorrect 31 ms 18892 KB Output isn't correct
25 Correct 26 ms 14588 KB Output is correct
26 Incorrect 32 ms 20164 KB Output isn't correct
27 Correct 33 ms 20684 KB Output is correct
28 Correct 23 ms 12708 KB Output is correct
29 Correct 76 ms 32516 KB Output is correct
30 Incorrect 35 ms 23264 KB Output isn't correct
31 Incorrect 35 ms 23488 KB Output isn't correct
32 Incorrect 32 ms 16076 KB Output isn't correct
33 Correct 27 ms 15808 KB Output is correct
34 Incorrect 33 ms 19396 KB Output isn't correct
35 Correct 35 ms 22976 KB Output is correct
36 Correct 22 ms 12280 KB Output is correct
37 Correct 99 ms 39296 KB Output is correct
38 Incorrect 34 ms 20680 KB Output isn't correct
39 Incorrect 34 ms 15560 KB Output isn't correct
40 Incorrect 36 ms 20416 KB Output isn't correct
41 Correct 29 ms 17820 KB Output is correct
42 Correct 39 ms 21416 KB Output is correct
43 Correct 37 ms 22984 KB Output is correct
44 Correct 21 ms 11980 KB Output is correct
45 Correct 71 ms 36272 KB Output is correct
46 Incorrect 34 ms 22220 KB Output isn't correct
47 Incorrect 36 ms 18792 KB Output isn't correct
48 Incorrect 43 ms 21344 KB Output isn't correct
49 Correct 29 ms 12792 KB Output is correct
50 Correct 36 ms 19396 KB Output is correct
51 Incorrect 33 ms 17356 KB Output isn't correct
52 Correct 39 ms 12228 KB Output is correct
53 Correct 82 ms 35356 KB Output is correct
54 Incorrect 54 ms 19940 KB Output isn't correct