oj.uz

Submission #228490

# Submission time Handle Problem Language Result Execution time Memory
228490 2020-05-01T08:44:41 Z Fischer Pipes (BOI13_pipes) C++14
44.0741 / 100
 265 ms 33644 KB 
/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author Miguel Mini
 */

#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define trav(v, x) for (auto v : x)
#define re(x, y, z) for (int x=y; x<z; ++x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define set_to(x, v) fill(all(x), v)
#define eb emplace_back
#define lso(x) ((x)&-(x))
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = INT_MAX;
vector<ii> g[maxn];

class pipes {
public:

    void solveOne(istream& in, ostream& out) {
        int n, m;
        in >> n >> m;
        if (m > n) {
            out << 0 << endl;
            return;
        }
        vector<ll> c(n);
        vi deg(n);
        trav(&v, c) in >> v;
        vector<ii> edges;
        re(i, 0, m) {
            int a, b;
            in >> a >> b;
            a -= 1; b -= 1;
            edges.eb(a, b);
            g[a].eb(b, i); deg[a] += 1;
            g[b].eb(a, i); deg[b] += 1;
        }
        vi res(m);
        vector<bool> vis(m);
        queue<int> Q;
        re(i, 0, n) {
            if (sz(g[i]) == 1) {
                Q.push(i);
            }
        }
        while (!Q.empty()) {
            int q = Q.front(); Q.pop();
            for (auto v : g[q]) {
                int id = v.second;
                if (vis[id]) continue;
                vis[id] = 1;
                m -= 1;
                res[id] = 2 * c[q];
                int u = v.first;
                c[u] += c[q];
                deg[u] -= 1;
                if (deg[u] == 1) {
                    Q.push(u);
                }
            }
        }
        if (m == 0) {
            trav(v, res) out << v << endl;
        } else if (m&1) {
            int x = 0;
            while (deg[x] == 0) x += 1;
            ll sum = 0;
            vector<int> t;
            function<int(int, vi&, ll)> dfs = [&](int v, vi& t, ll sum)->int {
                if (deg[v] != 2) return -inf;
                trav(node, g[v]) {
                    if (!vis[node.second]) {
                        vis[node.second] = 1;
                        t.emplace_back(node.second);
                        if (node.first == x) return 1;
                        return dfs(node.first, t, c[v] - sum) + 1;
                    }
                }
                return -inf;
            };
            if (dfs(x, t, sum) == m) {
                res[t[0]] = sum;
                re(i, 1, sz(t)) {
                    x ^= edges[t[i]].first ^ edges[t[i]].second;
                    res[t[i]] = 2 * c[x] - sum;
                    sum = res[t[i]];
                }
                trav(v, res) out << v << endl;
            } else out << 0 << endl;
        } else {
            out << 0 << endl;
        }
    }

    void solve(istream& in, ostream& out) {
        int testNumber = 1;
        //in >> testNumber;
        re(tc, 1, testNumber+1) {
            //out << "Case #" << tc << ": ";
            solveOne(in, out);
        }
    }
};


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	pipes solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2688 KB Output isn't correct
2 Incorrect 6 ms 2688 KB Output isn't correct
3 Incorrect 8 ms 2816 KB Output isn't correct
4 Incorrect 258 ms 11096 KB Output isn't correct
5 Incorrect 6 ms 2688 KB Output isn't correct
6 Incorrect 6 ms 2560 KB Output isn't correct
7 Incorrect 6 ms 2688 KB Output isn't correct
8 Incorrect 6 ms 2688 KB Output isn't correct
9 Incorrect 9 ms 2816 KB Output isn't correct
10 Incorrect 8 ms 2816 KB Output isn't correct
11 Incorrect 9 ms 2816 KB Output isn't correct
12 Incorrect 9 ms 2816 KB Output isn't correct
13 Incorrect 207 ms 9324 KB Output isn't correct
14 Incorrect 250 ms 10604 KB Output isn't correct
15 Incorrect 265 ms 11244 KB Output isn't correct
16 Incorrect 211 ms 9836 KB Output isn't correct
17 Incorrect 263 ms 11116 KB Output isn't correct
18 Incorrect 263 ms 11116 KB Output isn't correct
19 Incorrect 263 ms 10476 KB Output isn't correct
20 Incorrect 6 ms 2688 KB Output isn't correct
21 Incorrect 8 ms 2816 KB Output isn't correct
22 Incorrect 259 ms 11244 KB Output isn't correct
23 Incorrect 201 ms 9324 KB Output isn't correct
24 Incorrect 255 ms 11220 KB Output isn't correct
25 Incorrect 213 ms 9708 KB Output isn't correct

Subtask #2
44.0740740741 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2688 KB Output isn't correct
2 Incorrect 8 ms 2816 KB Output isn't correct
3 Correct 66 ms 9964 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Incorrect 6 ms 2688 KB Output isn't correct
8 Incorrect 6 ms 2688 KB Output isn't correct
9 Correct 6 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 6 ms 2688 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 7 ms 2688 KB Output is correct
14 Incorrect 6 ms 2688 KB Output isn't correct
15 Incorrect 8 ms 2816 KB Output isn't correct
16 Incorrect 9 ms 2816 KB Output isn't correct
17 Correct 6 ms 2816 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Incorrect 6 ms 2688 KB Output isn't correct
23 Runtime error 66 ms 25196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Runtime error 89 ms 28012 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Correct 62 ms 9836 KB Output is correct
26 Correct 6 ms 2688 KB Output is correct
27 Correct 6 ms 2688 KB Output is correct
28 Correct 6 ms 2688 KB Output is correct
29 Correct 6 ms 2688 KB Output is correct
30 Incorrect 63 ms 9708 KB Output isn't correct
31 Runtime error 86 ms 33644 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Runtime error 75 ms 22124 KB Execution killed with signal 11 (could be triggered by violating memory limits)
33 Correct 65 ms 10228 KB Output is correct
34 Correct 6 ms 2688 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2688 KB Output is correct
37 Correct 6 ms 2688 KB Output is correct
38 Runtime error 91 ms 26536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Incorrect 68 ms 10488 KB Output isn't correct
40 Incorrect 62 ms 10220 KB Output isn't correct
41 Correct 58 ms 9836 KB Output is correct
42 Correct 6 ms 2688 KB Output is correct
43 Correct 6 ms 2688 KB Output is correct
44 Correct 6 ms 2688 KB Output is correct
45 Correct 6 ms 2688 KB Output is correct
46 Runtime error 79 ms 25324 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Incorrect 63 ms 10220 KB Output isn't correct
48 Runtime error 92 ms 33132 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Correct 60 ms 10092 KB Output is correct
50 Correct 6 ms 2720 KB Output is correct
51 Correct 6 ms 2688 KB Output is correct
52 Correct 6 ms 2688 KB Output is correct
53 Correct 6 ms 2688 KB Output is correct
54 Incorrect 72 ms 9964 KB Output isn't correct