oj.uz

Submission #816086

# Submission time Handle Problem Language Result Execution time Memory
816086 2023-08-09T04:09:42 Z QwertyPi Pipes (BOI13_pipes) C++14
96.1111 / 100
 545 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(*G[x].begin());
        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] ? *--G[x].end() : *G[x].begin());
            x = E[paths.back()].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 4 ms 5076 KB Output is correct
4 Correct 83 ms 20336 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 5032 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 81 ms 17280 KB Output is correct
14 Correct 84 ms 19508 KB Output is correct
15 Correct 106 ms 20420 KB Output is correct
16 Correct 83 ms 18128 KB Output is correct
17 Correct 106 ms 20328 KB Output is correct
18 Correct 107 ms 20404 KB Output is correct
19 Correct 126 ms 19596 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 134 ms 20388 KB Output is correct
23 Correct 88 ms 17292 KB Output is correct
24 Correct 111 ms 20404 KB Output is correct
25 Correct 57 ms 17916 KB Output is correct

Subtask #2
66.1111111111 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 5204 KB Output is correct
3 Correct 70 ms 18784 KB Output is correct
4 Correct 63 ms 19312 KB Output is correct
5 Correct 71 ms 19564 KB Output is correct
6 Runtime error 545 ms 131072 KB Execution killed with signal 11
7 Correct 3 ms 5032 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4952 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5120 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 4 ms 5204 KB Output is correct
21 Correct 4 ms 5332 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 93 ms 18904 KB Output is correct
24 Correct 117 ms 21852 KB Output is correct
25 Correct 71 ms 18784 KB Output is correct
26 Correct 87 ms 19356 KB Output is correct
27 Correct 70 ms 19048 KB Output is correct
28 Correct 89 ms 20192 KB Output is correct
29 Runtime error 361 ms 108340 KB Execution killed with signal 11
30 Correct 84 ms 21120 KB Output is correct
31 Correct 76 ms 22712 KB Output is correct
32 Correct 104 ms 20636 KB Output is correct
33 Correct 75 ms 19536 KB Output is correct
34 Correct 60 ms 19276 KB Output is correct
35 Correct 80 ms 19240 KB Output is correct
36 Correct 75 ms 19788 KB Output is correct
37 Runtime error 494 ms 131072 KB Execution killed with signal 11
38 Correct 116 ms 21500 KB Output is correct
39 Correct 100 ms 20400 KB Output is correct
40 Correct 93 ms 21760 KB Output is correct
41 Correct 70 ms 19192 KB Output is correct
42 Correct 54 ms 19028 KB Output is correct
43 Correct 63 ms 19064 KB Output is correct
44 Correct 60 ms 19472 KB Output is correct
45 Correct 346 ms 57416 KB Output is correct
46 Correct 88 ms 21284 KB Output is correct
47 Correct 87 ms 21736 KB Output is correct
48 Correct 97 ms 22664 KB Output is correct
49 Correct 84 ms 19132 KB Output is correct
50 Correct 79 ms 19468 KB Output is correct
51 Correct 78 ms 19460 KB Output is correct
52 Correct 62 ms 19032 KB Output is correct
53 Correct 353 ms 58612 KB Output is correct
54 Correct 102 ms 21240 KB Output is correct