oj.uz

답안 #1051036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051036 2024-08-09T18:41:06 Z ortsac Pipes (BOI13_pipes) C++17
57.2222 / 100
 89 ms 39412 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;
    }
    // first case is for tree
    // second case is if you can't add 2x to it
    if ((bEdge == -1) || ((change[1] - dp[1]) % 2LL)) {
        cout << "0\n";
        return 0;
    }
    //cout << "0\n";
}

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 1 ms 5724 KB Output is correct
4 Correct 30 ms 16896 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 28 ms 13816 KB Output is correct
14 Correct 29 ms 14856 KB Output is correct
15 Correct 33 ms 15300 KB Output is correct
16 Correct 28 ms 14084 KB Output is correct
17 Correct 34 ms 16836 KB Output is correct
18 Correct 33 ms 17096 KB Output is correct
19 Correct 44 ms 20808 KB Output is correct
20 Correct 1 ms 5464 KB Output is correct
21 Correct 1 ms 5724 KB Output is correct
22 Correct 31 ms 16920 KB Output is correct
23 Correct 24 ms 13764 KB Output is correct
24 Correct 31 ms 15296 KB Output is correct
25 Correct 28 ms 15812 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 25 ms 14540 KB Output is correct
4 Incorrect 40 ms 22452 KB Output isn't correct
5 Correct 21 ms 11968 KB Output is correct
6 Correct 88 ms 39412 KB Output is correct
7 Incorrect 1 ms 5464 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 Incorrect 1 ms 5468 KB Output isn't correct
11 Incorrect 1 ms 5468 KB Output isn't correct
12 Correct 1 ms 5464 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 Incorrect 1 ms 5724 KB Output isn't correct
20 Correct 1 ms 5724 KB Output is correct
21 Correct 2 ms 5724 KB Output is correct
22 Incorrect 1 ms 5724 KB Output isn't correct
23 Incorrect 29 ms 17612 KB Output isn't correct
24 Incorrect 37 ms 19148 KB Output isn't correct
25 Correct 27 ms 14572 KB Output is correct
26 Incorrect 32 ms 20164 KB Output isn't correct
27 Incorrect 39 ms 20420 KB Output isn't correct
28 Correct 30 ms 12748 KB Output is correct
29 Correct 73 ms 33156 KB Output is correct
30 Incorrect 38 ms 23232 KB Output isn't correct
31 Incorrect 36 ms 23488 KB Output isn't correct
32 Incorrect 32 ms 16152 KB Output isn't correct
33 Correct 27 ms 15808 KB Output is correct
34 Incorrect 32 ms 19396 KB Output isn't correct
35 Incorrect 35 ms 22464 KB Output isn't correct
36 Correct 25 ms 12492 KB Output is correct
37 Correct 89 ms 39244 KB Output is correct
38 Incorrect 34 ms 20672 KB Output isn't correct
39 Incorrect 29 ms 15560 KB Output isn't correct
40 Incorrect 31 ms 20424 KB Output isn't correct
41 Correct 30 ms 17860 KB Output is correct
42 Incorrect 33 ms 21344 KB Output isn't correct
43 Incorrect 38 ms 22976 KB Output isn't correct
44 Correct 21 ms 12180 KB Output is correct
45 Correct 68 ms 36944 KB Output is correct
46 Incorrect 35 ms 22208 KB Output isn't correct
47 Incorrect 31 ms 18884 KB Output isn't correct
48 Incorrect 36 ms 21452 KB Output isn't correct
49 Correct 23 ms 12756 KB Output is correct
50 Incorrect 33 ms 19404 KB Output isn't correct
51 Incorrect 33 ms 17356 KB Output isn't correct
52 Correct 22 ms 12236 KB Output is correct
53 Correct 79 ms 36432 KB Output is correct
54 Incorrect 33 ms 20160 KB Output isn't correct