oj.uz

답안 #1053777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053777 2024-08-11T17:27:59 Z codexistent Pipes (BOI13_pipes) C++14
74.0741 / 100
 543 ms 99928 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() - 2;
        //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 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 10712 KB Output is correct
4 Correct 196 ms 30424 KB Output is correct
5 Correct 1 ms 10584 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 2 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 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 149 ms 26808 KB Output is correct
14 Correct 186 ms 29388 KB Output is correct
15 Correct 203 ms 30624 KB Output is correct
16 Correct 159 ms 27848 KB Output is correct
17 Correct 194 ms 30420 KB Output is correct
18 Correct 206 ms 30400 KB Output is correct
19 Correct 194 ms 29780 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 2 ms 10876 KB Output is correct
22 Correct 194 ms 30580 KB Output is correct
23 Correct 146 ms 26836 KB Output is correct
24 Correct 194 ms 30400 KB Output is correct
25 Correct 166 ms 27604 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 10584 KB Output isn't correct
2 Incorrect 1 ms 10844 KB Output isn't correct
3 Correct 91 ms 28848 KB Output is correct
4 Correct 89 ms 29492 KB Output is correct
5 Correct 99 ms 29900 KB Output is correct
6 Correct 495 ms 99924 KB Output is correct
7 Incorrect 2 ms 10588 KB Output isn't correct
8 Incorrect 1 ms 10588 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 10588 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 1 ms 10844 KB Output isn't correct
16 Incorrect 1 ms 10844 KB Output isn't correct
17 Correct 2 ms 10844 KB Output is correct
18 Correct 1 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 2 ms 10844 KB Output isn't correct
23 Incorrect 78 ms 26496 KB Output isn't correct
24 Incorrect 88 ms 29652 KB Output isn't correct
25 Correct 90 ms 28876 KB Output is correct
26 Correct 81 ms 29544 KB Output is correct
27 Correct 73 ms 29268 KB Output is correct
28 Correct 104 ms 30416 KB Output is correct
29 Correct 446 ms 84816 KB Output is correct
30 Incorrect 90 ms 29012 KB Output isn't correct
31 Incorrect 83 ms 29320 KB Output isn't correct
32 Incorrect 102 ms 30144 KB Output isn't correct
33 Correct 90 ms 29648 KB Output is correct
34 Correct 81 ms 29524 KB Output is correct
35 Correct 80 ms 29520 KB Output is correct
36 Correct 106 ms 29912 KB Output is correct
37 Correct 543 ms 99928 KB Output is correct
38 Incorrect 98 ms 29520 KB Output isn't correct
39 Incorrect 113 ms 30240 KB Output isn't correct
40 Incorrect 92 ms 29872 KB Output isn't correct
41 Correct 74 ms 29324 KB Output is correct
42 Correct 70 ms 29264 KB Output is correct
43 Correct 69 ms 29168 KB Output is correct
44 Correct 99 ms 29884 KB Output is correct
45 Correct 504 ms 88656 KB Output is correct
46 Incorrect 146 ms 29196 KB Output isn't correct
47 Incorrect 95 ms 29844 KB Output isn't correct
48 Incorrect 107 ms 29520 KB Output isn't correct
49 Correct 107 ms 29388 KB Output is correct
50 Correct 96 ms 29644 KB Output is correct
51 Correct 136 ms 29652 KB Output is correct
52 Correct 86 ms 29356 KB Output is correct
53 Correct 532 ms 90452 KB Output is correct
54 Incorrect 140 ms 29396 KB Output isn't correct