oj.uz

Submission #816032

# Submission time Handle Problem Language Result Execution time Memory
816032 2023-08-09T04:02:28 Z QwertyPi Pipes (BOI13_pipes) C++14
70.1852 / 100
 589 ms 131072 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int MAXN = 1e5 + 11;
const int MAXM = 5e5 + 11;

struct edge{
    int u, v, w;
    int exc(int x){
        return u + v - x;
    }
};
vector<edge> E;
set<int> G[MAXN];
int a[MAXN], b[MAXN], c[MAXN];

int32_t main(){
    cin.tie(0); cout.tie(0)->sync_with_stdio(false);
    int n, m; cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i];
    int s = accumulate(a + 1, a + n + 1, 0LL);
    if(s % 2 == 1){
        cout << 0 << endl;
        return 0;
    }
    for(int i = 0; i < m; i++){
        int u, v; cin >> u >> v;
        E.push_back({u, v, 0});
        G[u].insert(i);
        G[v].insert(i);
    }

    vector<int> d1;
    for(int i = 1; i <= n; i++){
        if(G[i].size() == 1) d1.push_back(i);
    }

    while(!d1.empty()){
        int v = d1.back(); d1.pop_back();
        if(G[v].empty()) continue;
        for(auto e : G[v]){
            int u = E[e].u + E[e].v - v;
            G[u].erase(e);
            if(G[u].size() == 1) d1.push_back(u);
        }
        for(auto e : G[v]){
            c[e] = (a[v] - b[v]) * 2;
            b[E[e].u] += c[e] / 2;
            b[E[e].v] += c[e] / 2;
        }
        G[v].clear();
    }

    int node = 0, x = -1;
    for(int i = 1; i <= n; i++){
        assert(G[i].size() != 1);
        if(G[i].size() == 2){
            node++; x = i;
        }else if(G[i].size() > 2){
            cout << 0 << endl;
            return 0;
        }
    }

    if(node > 0 && node % 2 == 0){
        cout << 0 << endl;
        return 0;
    }

    if(node >= 3){
        vector<int> V, paths;
        V.push_back(x); paths.push_back(E[*G[x].begin()].u);
        x = E[*G[x].begin()].u;
        for(int i = 1; i < node; i++){
            V.push_back(x); paths.push_back(E[*G[x].begin()].exc(x) == V[i - 1] ? E[*--G[x].end()].exc(x) : E[*G[x].begin()].exc(x));
        }
        vector<int> tmp; tmp.push_back(0); for(int i = 1; i < node; i++) tmp.push_back((a[V[i]] - b[V[i]]) * 2 - tmp.back());
        int d = ((a[V[0]] - b[V[0]]) * 2 - tmp[0] - tmp[node - 1]) / 2;
        tmp.clear(); tmp.push_back(d); for(int i = 1; i < node; i++) tmp.push_back((a[V[i]] - b[V[i]]) * 2 - tmp.back());
        for(int i = 0; i < node; i++) c[paths[i]] = tmp[i];
    }

    for(int i = 0; i < m; i++){
        cout << c[i] << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 79 ms 21884 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 5020 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5204 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 71 ms 18628 KB Output is correct
14 Correct 83 ms 21004 KB Output is correct
15 Correct 137 ms 21984 KB Output is correct
16 Correct 94 ms 19472 KB Output is correct
17 Correct 108 ms 21876 KB Output is correct
18 Correct 104 ms 22004 KB Output is correct
19 Correct 128 ms 21160 KB Output is correct
20 Correct 3 ms 5024 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 117 ms 21972 KB Output is correct
23 Correct 90 ms 18528 KB Output is correct
24 Correct 120 ms 21976 KB Output is correct
25 Correct 79 ms 19208 KB Output is correct

Subtask #2
40.1851851852 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4948 KB Output isn't correct
2 Incorrect 2 ms 5204 KB Output isn't correct
3 Correct 75 ms 20272 KB Output is correct
4 Correct 81 ms 20804 KB Output is correct
5 Correct 112 ms 21064 KB Output is correct
6 Runtime error 577 ms 131072 KB Execution killed with signal 11
7 Incorrect 2 ms 4948 KB Output isn't correct
8 Incorrect 3 ms 4948 KB Output isn't correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 5028 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 4 ms 4968 KB Output is correct
14 Incorrect 3 ms 5020 KB Output isn't correct
15 Incorrect 3 ms 5164 KB Output isn't correct
16 Incorrect 3 ms 5204 KB Output isn't correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 4 ms 5076 KB Output is correct
20 Correct 4 ms 5204 KB Output is correct
21 Correct 5 ms 5332 KB Output is correct
22 Incorrect 3 ms 5168 KB Output isn't correct
23 Incorrect 62 ms 20148 KB Output isn't correct
24 Incorrect 105 ms 23300 KB Output isn't correct
25 Correct 82 ms 20268 KB Output is correct
26 Correct 92 ms 20864 KB Output is correct
27 Correct 72 ms 20604 KB Output is correct
28 Correct 82 ms 21796 KB Output is correct
29 Runtime error 374 ms 113484 KB Execution killed with signal 11
30 Incorrect 105 ms 22516 KB Output isn't correct
31 Incorrect 84 ms 24316 KB Output isn't correct
32 Incorrect 117 ms 22148 KB Output isn't correct
33 Correct 104 ms 21036 KB Output is correct
34 Correct 50 ms 20848 KB Output is correct
35 Correct 72 ms 20904 KB Output is correct
36 Correct 77 ms 21264 KB Output is correct
37 Runtime error 589 ms 131072 KB Execution killed with signal 11
38 Incorrect 84 ms 22996 KB Output isn't correct
39 Incorrect 109 ms 21820 KB Output isn't correct
40 Incorrect 69 ms 23204 KB Output isn't correct
41 Correct 84 ms 20704 KB Output is correct
42 Correct 63 ms 20708 KB Output is correct
43 Correct 55 ms 20624 KB Output is correct
44 Correct 100 ms 21084 KB Output is correct
45 Correct 389 ms 62692 KB Output is correct
46 Incorrect 113 ms 22736 KB Output isn't correct
47 Incorrect 98 ms 23224 KB Output isn't correct
48 Incorrect 83 ms 24264 KB Output isn't correct
49 Correct 86 ms 20556 KB Output is correct
50 Correct 96 ms 20976 KB Output is correct
51 Correct 86 ms 21116 KB Output is correct
52 Correct 77 ms 20628 KB Output is correct
53 Correct 460 ms 64020 KB Output is correct
54 Incorrect 78 ms 22672 KB Output isn't correct