oj.uz

답안 #677797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677797 2023-01-04T11:29:59 Z dooompy Pipes (BOI13_pipes) C++17
74.0741 / 100
 70 ms 9848 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

ll v[100005];
int deg[100005];

vector<pair<int, int>> adj[100005];
ll calc[500005];

bool seen[100005];

bool seen2[100005];
vector<int> ord;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("test.txt", "r", stdin);
//    freopen("", "w", stdout);
    int n, m; cin >> n >> m;

    if (m > n) {
        cout << 0 << endl;
        return 0;
    }

    for (int i = 1; i <= n; i++) cin >> v[i];
    for (int i = 1; i <= m; i++) {
        int a, b; cin >> a >> b;
        adj[a].push_back({b, i});
        adj[b].push_back({a, i});
        deg[a]++; deg[b]++;
    }

    queue<int> q;

    for (int i = 1; i <= n; i++) {
        if (deg[i] == 1) {
            q.push(i);
        }
    }

    while (!q.empty()) {
        // deg 1
        auto cur = q.front(); q.pop();
        seen[cur] = true;
        deg[cur] = 0;

        for (auto to : adj[cur]) {
            if (seen[to.first]) continue;
            ll weight = v[cur];

            v[to.first] -= weight;
            calc[to.second] = weight;

            if (--deg[to.first] == 1) {
                q.push(to.first);
            }
        }
    }

    if (m == n - 1) {
        for (int i = 1; i <= m; i++) {
            cout << calc[i] * 2 << "\n";
        }
        return 0;
    }

    vector<int> left;

    for (int i = 1; i <= n; i++) {
        if (deg[i] == 2) left.push_back(i);
    }

    if (left.size() % 2 == 0) {
        cout << 0 << endl;
        return 0;
    }

    if (left.empty()) {
        // wtf
        cout << 0 << endl;
        return 0;
    }

    int start = left.front();
    ord.push_back(start);
    seen2[start] = true;
    int cur = start;
    while (true) {
        bool pushed = false;
        for (auto nxt : adj[cur]) {
            if (!seen2[nxt.first] && deg[nxt.first] == 2) {
                cur = nxt.first;
                pushed = true;
                seen2[nxt.first] = true;
                ord.push_back(nxt.first);
                break;
            }
        }
        if (!pushed) break;

    }

//    for (auto x : ord) cout << x << " ";

    ll prev = 0;

    for (int i = 0; i < ord.size() - 1; i++) {
        // assum back ->0 is X

        ll now = v[ord[i]] - prev;

        prev = now;
    }

    ll x = (v[ord[0]] - prev) / 2;

//    cout << x << endl;

    ll orig = x;

    for (int i = 0; i < ord.size() - 1; i++) {
        for (auto nxt : adj[ord[i]]) {
            if (nxt.first == ord[i + 1]) {
                calc[nxt.second] = v[ord[i]] - x;
                x = calc[nxt.second];
                break;
            }
        }
    }

    for (auto nxt : adj[ord[0]]) {
        if (nxt.first == ord.back()) {
            calc[nxt.second] = orig;
            break;
        }
    }

    for (int i = 1; i <= m; i++) {
        cout << calc[i] * 2 << "\n";
    }
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:137:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |     for (int i = 0; i < ord.size() - 1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~
pipes.cpp:151:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |     for (int i = 0; i < ord.size() - 1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 55 ms 9584 KB Output is correct
5 Correct 2 ms 2692 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2696 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2700 KB Output is correct
13 Correct 40 ms 8196 KB Output is correct
14 Correct 49 ms 9228 KB Output is correct
15 Correct 53 ms 9676 KB Output is correct
16 Correct 42 ms 8576 KB Output is correct
17 Correct 52 ms 9612 KB Output is correct
18 Correct 57 ms 9632 KB Output is correct
19 Correct 54 ms 8892 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 51 ms 9544 KB Output is correct
23 Correct 39 ms 8268 KB Output is correct
24 Correct 51 ms 9636 KB Output is correct
25 Correct 50 ms 8532 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Incorrect 2 ms 2772 KB Output isn't correct
3 Correct 46 ms 8852 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Incorrect 2 ms 2644 KB Output isn't correct
8 Incorrect 2 ms 2644 KB Output isn't correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2692 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Incorrect 2 ms 2644 KB Output isn't correct
15 Incorrect 2 ms 2772 KB Output isn't correct
16 Incorrect 2 ms 2700 KB Output isn't correct
17 Correct 2 ms 2692 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2692 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Incorrect 2 ms 2772 KB Output isn't correct
23 Incorrect 45 ms 8640 KB Output isn't correct
24 Incorrect 70 ms 9768 KB Output isn't correct
25 Correct 60 ms 8788 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 2 ms 2704 KB Output is correct
28 Correct 1 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Incorrect 57 ms 9348 KB Output isn't correct
31 Incorrect 59 ms 9736 KB Output isn't correct
32 Incorrect 55 ms 9636 KB Output isn't correct
33 Correct 40 ms 9060 KB Output is correct
34 Correct 2 ms 2700 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Incorrect 57 ms 9484 KB Output isn't correct
39 Incorrect 54 ms 9640 KB Output isn't correct
40 Incorrect 60 ms 9816 KB Output isn't correct
41 Correct 39 ms 9008 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2704 KB Output is correct
44 Correct 1 ms 2644 KB Output is correct
45 Correct 2 ms 2696 KB Output is correct
46 Incorrect 61 ms 9264 KB Output isn't correct
47 Incorrect 56 ms 9848 KB Output isn't correct
48 Incorrect 59 ms 9812 KB Output isn't correct
49 Correct 41 ms 8744 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 2 ms 2700 KB Output is correct
52 Correct 2 ms 2644 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Incorrect 60 ms 9448 KB Output isn't correct