oj.uz

답안 #1053779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053779 2024-08-11T17:30:23 Z codexistent Pipes (BOI13_pipes) C++14
74.0741 / 100
 561 ms 100132 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 100005
#define MAXM 500005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)
#define f first
#define s second

ll n, m, w[MAXN], d[MAXM];
set<ll> adj[MAXN];
pair<ll, pair<ll, ll>> e[MAXM];
bool v[MAXM];
map<pair<ll, ll>, ll> eid;

int main(){
    cin >> n >> m;
    FOR(i, 1, n) cin >> w[i];
    FOR(i, 1, m){
        e[i].f = 0;
        cin >> e[i].s.f >> e[i].s.s;
        adj[e[i].s.f].insert(e[i].s.s), adj[e[i].s.s].insert(e[i].s.f);

        eid.insert({{min(e[i].s.f, e[i].s.s), max(e[i].s.f, e[i].s.s)}, i});
    }

    priority_queue<pair<ll, ll>> pq;
    FOR(i, 1, m) {
        v[i] = false;
        e[i].f = adj[e[i].s.f].size() + adj[e[i].s.s].size();
        //cout << "FOR EDGE " << i << " WE HAVE " << e[i].f << " CT " << endl;
        for(auto j : adj[e[i].s.f]){
            if(adj[j].size() == 2 && adj[e[i].s.s].find(j) != adj[e[i].s.s].end()){
                e[i].f -= 2;
            }
        }

        if(adj[e[i].s.f].size() == 1 || adj[e[i].s.s].size() == 1){
            pq.push({1, i});
        }else if(e[i].f == 0){
            pq.push({0, i});
        }
    }
    while(pq.size()){
        //cout << pq.top().f << " ~ " << pq.top().s << " ==> " << e[pq.top().s].f << endl;
        auto pqi = pq.top(); pq.pop();
        if(v[pqi.s]) continue;
        v[pqi.s] = true;

        if(pqi.f == 0){
            ll s = 0;
            for(ll i2 : adj[e[pqi.s].s.f]) s += w[i2];
            for(ll i2 : adj[e[pqi.s].s.s]) s += w[i2];

            d[pqi.s] = w[e[pqi.s].s.f] + w[e[pqi.s].s.s] - s;
        }else if(adj[e[pqi.s].s.f].size() == 1){
            d[pqi.s] = w[e[pqi.s].s.f] * 2;
        }else{
            d[pqi.s] = w[e[pqi.s].s.s] * 2;
        }

        adj[e[pqi.s].s.f].erase(e[pqi.s].s.s);
        adj[e[pqi.s].s.s].erase(e[pqi.s].s.f);
        w[e[pqi.s].s.f] -= d[pqi.s] / 2;
        w[e[pqi.s].s.s] -= d[pqi.s] / 2;

        if(adj[e[pqi.s].s.f].size() == 2){
            ll a = *(adj[e[pqi.s].s.f].begin());
            ll b = *(++adj[e[pqi.s].s.f].begin());

            if(eid.find({min(a, b), max(a, b)}) != eid.end()){
                e[eid[{min(a, b), max(a, b)}]].f -= 2;

                if(!v[eid[{min(a, b), max(a, b)}]] && e[eid[{min(a, b), max(a, b)}]].f == 0){
                    pq.push({0, eid[{min(a, b), max(a, b)}]});
                }
            }
        }else if(adj[e[pqi.s].s.f].size() == 1){
            ll a = *(adj[e[pqi.s].s.f].begin());
            if(!v[eid[{min(a, e[pqi.s].s.f), max(a, e[pqi.s].s.f)}]]){
                pq.push({1, eid[{min(a, e[pqi.s].s.f), max(a, e[pqi.s].s.f)}]});
            }
        }

        if(adj[e[pqi.s].s.s].size() == 2){
            ll a = *(adj[e[pqi.s].s.s].begin());
            ll b = *(++adj[e[pqi.s].s.s].begin());

            if(eid.find({min(a, b), max(a, b)}) != eid.end()){
                e[eid[{min(a, b), max(a, b)}]].f -= 2;

                if(!v[eid[{min(a, b), max(a, b)}]] && e[eid[{min(a, b), max(a, b)}]].f == 0){
                    pq.push({0, eid[{min(a, b), max(a, b)}]});
                }
            }
        }else if(adj[e[pqi.s].s.s].size() == 1){
            ll a = *(adj[e[pqi.s].s.s].begin());
            if(!v[eid[{min(a, e[pqi.s].s.s), max(a, e[pqi.s].s.s)}]]){
                pq.push({1, eid[{min(a, e[pqi.s].s.s), max(a, e[pqi.s].s.s)}]});
            }
        }
    }

    FOR(i, 1, m) if(!v[i]){
        cout << 0 << endl;
        return 0;
    } 

    FOR(i, 1, m) cout << d[i] << endl;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 210 ms 30380 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10684 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 3 ms 10844 KB Output is correct
12 Correct 3 ms 10844 KB Output is correct
13 Correct 152 ms 26808 KB Output is correct
14 Correct 199 ms 29560 KB Output is correct
15 Correct 243 ms 30452 KB Output is correct
16 Correct 166 ms 27864 KB Output is correct
17 Correct 206 ms 30412 KB Output is correct
18 Correct 189 ms 30408 KB Output is correct
19 Correct 195 ms 29776 KB Output is correct
20 Correct 1 ms 10840 KB Output is correct
21 Correct 2 ms 10844 KB Output is correct
22 Correct 194 ms 30392 KB Output is correct
23 Correct 151 ms 27088 KB Output is correct
24 Correct 189 ms 30404 KB Output is correct
25 Correct 168 ms 27604 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 10584 KB Output isn't correct
2 Incorrect 2 ms 10844 KB Output isn't correct
3 Correct 97 ms 28880 KB Output is correct
4 Correct 80 ms 29520 KB Output is correct
5 Correct 98 ms 29748 KB Output is correct
6 Correct 561 ms 100132 KB Output is correct
7 Incorrect 1 ms 10584 KB Output isn't correct
8 Incorrect 1 ms 10584 KB Output isn't correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10612 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Incorrect 1 ms 10588 KB Output isn't correct
15 Incorrect 2 ms 10844 KB Output isn't correct
16 Incorrect 2 ms 10844 KB Output isn't correct
17 Correct 2 ms 10844 KB Output is correct
18 Correct 2 ms 10844 KB Output is correct
19 Correct 2 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 2 ms 11100 KB Output is correct
22 Incorrect 1 ms 10844 KB Output isn't correct
23 Incorrect 71 ms 26516 KB Output isn't correct
24 Incorrect 94 ms 29796 KB Output isn't correct
25 Correct 94 ms 28840 KB Output is correct
26 Correct 79 ms 29520 KB Output is correct
27 Correct 71 ms 29264 KB Output is correct
28 Correct 113 ms 30612 KB Output is correct
29 Correct 403 ms 84468 KB Output is correct
30 Incorrect 91 ms 29012 KB Output isn't correct
31 Incorrect 75 ms 29272 KB Output isn't correct
32 Incorrect 110 ms 30156 KB Output isn't correct
33 Correct 87 ms 29864 KB Output is correct
34 Correct 79 ms 29484 KB Output is correct
35 Correct 92 ms 29508 KB Output is correct
36 Correct 95 ms 29956 KB Output is correct
37 Correct 500 ms 99972 KB Output is correct
38 Incorrect 130 ms 29520 KB Output isn't correct
39 Incorrect 104 ms 30124 KB Output isn't correct
40 Incorrect 111 ms 29808 KB Output isn't correct
41 Correct 72 ms 29268 KB Output is correct
42 Correct 95 ms 29268 KB Output is correct
43 Correct 73 ms 29276 KB Output is correct
44 Correct 97 ms 29900 KB Output is correct
45 Correct 456 ms 88656 KB Output is correct
46 Incorrect 95 ms 29264 KB Output isn't correct
47 Incorrect 98 ms 29644 KB Output isn't correct
48 Incorrect 75 ms 29524 KB Output isn't correct
49 Correct 103 ms 29352 KB Output is correct
50 Correct 84 ms 29648 KB Output is correct
51 Correct 103 ms 29700 KB Output is correct
52 Correct 91 ms 29240 KB Output is correct
53 Correct 447 ms 90192 KB Output is correct
54 Incorrect 108 ms 29392 KB Output isn't correct