oj.uz

Submission #1051047

# Submission time Handle Problem Language Result Execution time Memory
1051047 2024-08-09T18:52:41 Z ortsac Pipes (BOI13_pipes) C++17
74.0741 / 100
 95 ms 39436 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) {
        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;
    }
    // first case is for tree
    // second case is if you can't add 2x to it
    if ((bEdge == -1)) {
        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 5464 KB Output is correct
3 Correct 1 ms 5724 KB Output is correct
4 Correct 30 ms 16976 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 1 ms 5724 KB Output is correct
11 Correct 1 ms 5724 KB Output is correct
12 Correct 1 ms 5816 KB Output is correct
13 Correct 24 ms 13868 KB Output is correct
14 Correct 29 ms 14856 KB Output is correct
15 Correct 33 ms 15300 KB Output is correct
16 Correct 35 ms 14272 KB Output is correct
17 Correct 34 ms 16844 KB Output is correct
18 Correct 31 ms 17056 KB Output is correct
19 Correct 36 ms 20876 KB Output is correct
20 Correct 1 ms 5468 KB Output is correct
21 Correct 1 ms 5724 KB Output is correct
22 Correct 31 ms 16868 KB Output is correct
23 Correct 28 ms 13816 KB Output is correct
24 Correct 32 ms 15268 KB Output is correct
25 Correct 25 ms 15820 KB Output is correct

Subtask #2
44.0740740741 / 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 25 ms 14736 KB Output is correct
4 Correct 22 ms 12232 KB Output is correct
5 Correct 21 ms 11976 KB Output is correct
6 Correct 85 ms 39344 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 5492 KB Output is correct
11 Correct 1 ms 5468 KB Output is 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 5556 KB Output isn't correct
17 Correct 1 ms 5724 KB Output is correct
18 Correct 1 ms 5724 KB Output is 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 5724 KB Output isn't correct
23 Incorrect 28 ms 17772 KB Output isn't correct
24 Incorrect 35 ms 19132 KB Output isn't correct
25 Correct 29 ms 14792 KB Output is correct
26 Correct 22 ms 12228 KB Output is correct
27 Correct 30 ms 12236 KB Output is correct
28 Correct 25 ms 12748 KB Output is correct
29 Correct 80 ms 33424 KB Output is correct
30 Incorrect 38 ms 23236 KB Output isn't correct
31 Incorrect 37 ms 23500 KB Output isn't correct
32 Incorrect 30 ms 16060 KB Output isn't correct
33 Correct 27 ms 15820 KB Output is correct
34 Correct 22 ms 12292 KB Output is correct
35 Correct 22 ms 12236 KB Output is correct
36 Correct 22 ms 12488 KB Output is correct
37 Correct 95 ms 39436 KB Output is correct
38 Incorrect 34 ms 20684 KB Output isn't correct
39 Incorrect 28 ms 15564 KB Output isn't correct
40 Incorrect 30 ms 20320 KB Output isn't correct
41 Correct 30 ms 17600 KB Output is correct
42 Correct 26 ms 12236 KB Output is correct
43 Correct 24 ms 12236 KB Output is correct
44 Correct 21 ms 12088 KB Output is correct
45 Correct 69 ms 37040 KB Output is correct
46 Incorrect 37 ms 22208 KB Output isn't correct
47 Incorrect 32 ms 18888 KB Output isn't correct
48 Incorrect 39 ms 21380 KB Output isn't correct
49 Correct 25 ms 12748 KB Output is correct
50 Correct 22 ms 12228 KB Output is correct
51 Correct 22 ms 12236 KB Output is correct
52 Correct 22 ms 12152 KB Output is correct
53 Correct 76 ms 36276 KB Output is correct
54 Incorrect 33 ms 20132 KB Output isn't correct