oj.uz

답안 #228543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228543 2020-05-01T11:33:28 Z Fischer Pipes (BOI13_pipes) C++14
88.3333 / 100
 299 ms 19056 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];
                c[q] = 0;
                deg[u] -= 1;
                if (deg[u] == 1) {
                    Q.push(u);
                }
            }
        }
        if (m == 0 and accumulate(all(c), 0ll) == 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;
                sum = c[v] - sum;
                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, sum) + 1;
                    }
                }
                return -inf;
            };
            dfs(x, t, sum);
            res[t[0]] = 2 * c[x] - sum;
            sum = res[t[0]];
            re(i, 1, sz(t)) {
                x ^= edges[t[i-1]].first ^ edges[t[i-1]].second;
                res[t[i]] = 2 * c[x] - sum;
                sum = res[t[i]];
            }
            trav(v, res) out << v << 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
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 7 ms 2736 KB Output is correct
3 Correct 9 ms 2816 KB Output is correct
4 Correct 279 ms 10716 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 6 ms 2688 KB Output is correct
9 Correct 9 ms 2816 KB Output is correct
10 Correct 9 ms 2816 KB Output is correct
11 Correct 10 ms 2816 KB Output is correct
12 Correct 8 ms 2816 KB Output is correct
13 Correct 230 ms 9268 KB Output is correct
14 Correct 270 ms 10324 KB Output is correct
15 Correct 282 ms 10708 KB Output is correct
16 Correct 247 ms 9684 KB Output is correct
17 Correct 278 ms 10724 KB Output is correct
18 Correct 294 ms 10732 KB Output is correct
19 Correct 299 ms 10028 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 10 ms 2816 KB Output is correct
22 Correct 275 ms 10744 KB Output is correct
23 Correct 227 ms 9300 KB Output is correct
24 Correct 299 ms 10740 KB Output is correct
25 Correct 229 ms 9672 KB Output is correct

Subtask #2
58.3333333333 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 5376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Correct 8 ms 2816 KB Output is correct
3 Correct 64 ms 9580 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 Runtime error 9 ms 5376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Correct 6 ms 2688 KB Output is correct
9 Correct 6 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 6 ms 2816 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 7 ms 2688 KB Output is correct
14 Runtime error 9 ms 5376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Correct 8 ms 2816 KB Output is correct
16 Correct 10 ms 2816 KB Output is correct
17 Correct 6 ms 2688 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 Runtime error 10 ms 5504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Correct 220 ms 12780 KB Output is correct
24 Correct 280 ms 13932 KB Output is correct
25 Correct 72 ms 9580 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 Runtime error 71 ms 17516 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Correct 277 ms 16364 KB Output is correct
32 Correct 263 ms 11756 KB Output is correct
33 Correct 68 ms 9836 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 Correct 259 ms 13296 KB Output is correct
39 Runtime error 85 ms 19056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Runtime error 74 ms 18540 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Correct 65 ms 9580 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 Correct 278 ms 12780 KB Output is correct
47 Runtime error 72 ms 18540 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Correct 265 ms 16108 KB Output is correct
49 Correct 69 ms 9836 KB Output is correct
50 Correct 6 ms 2688 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 Runtime error 77 ms 17900 KB Execution killed with signal 11 (could be triggered by violating memory limits)