oj.uz

답안 #885163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885163 2023-12-09T05:35:07 Z 12345678 Pipes (BOI13_pipes) C++17
100 / 100
 103 ms 37564 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=5e5+5;
int n, m, h[nx], u, v, sz, res[nx], vs[nx], cy[nx], pa[nx], pidx[nx], cnt, lst;
vector<pair<int, int>> d[nx], c;

void dfs(int u, int p, int idx)
{
    vs[u]=1; pa[u]=p; pidx[u]=idx;
    for (auto [v, id]:d[u]) 
    {
        if (v==p||cy[v]) continue;
        if (!vs[v]) dfs(v, u, id);
        else
        {
            int tmp=u;
            while (tmp!=v) cy[tmp]=1, c.push_back({tmp, pidx[tmp]}), tmp=pa[tmp], cnt++;
            cy[v]=1; cnt++; c.push_back({v, id});
        }
    }
    if (idx==-1||m==n) return;
    res[idx]=2*h[u];
    h[p]-=h[u];
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>h[i];
    for (int i=1; i<=m; i++) cin>>u>>v, d[u].push_back({v, i}), d[v].push_back({u, i});
    if (m>n) {cout<<0; return 0;}
    dfs(1, 1, -1);
    if (cnt%2==0&&cnt!=0) {cout<<0; return 0;}
    if (m<n) for (int i=1; i<n; i++) cout<<res[i]<<'\n';
    else
    {
        m=n-1;
        for (int i=1; i<=n; i++) vs[i]=0;
        for (auto [x, y]:c) dfs(x, x, -1);
        int l=-1e9, r=1e9;
        while (l<=r)
        {
            vector<int> t(c.size());
            int md=(l+r+1)/2;
            //cout<<"here "<<l<<' '<<r<<' '<<md<<'\n';
            lst=md;
            t[0]+=md;
            t[c.size()-1]+=md;
            res[c[c.size()-1].second]=2*md;
            for (int i=1; i<c.size(); i++) t[i]+=(h[c[i-1].first]-t[i-1]), res[c[i-1].second]=2*(h[c[i-1].first]-t[i-1]);
            if (t[c.size()-1]==h[c[c.size()-1].first]) break;
            if (t[c.size()-1]>=h[c[c.size()-1].first]) r=md-1;
            else l=md;
        }
        //for (int i=1; i<=n; i++) if (cy[i]) cout<<i<<' '<<h[i]<<'\n';
        for (int i=1; i<=m+1; i++) cout<<res[i]<<'\n';
    }
}

/*
4 4
2 0 2 2
1 2
1 3
2 3
3 4
*/

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:55:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |             for (int i=1; i<c.size(); i++) t[i]+=(h[c[i-1].first]-t[i-1]), res[c[i-1].second]=2*(h[c[i-1].first]-t[i-1]);
      |                           ~^~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21080 KB Output is correct
2 Correct 5 ms 21080 KB Output is correct
3 Correct 4 ms 21152 KB Output is correct
4 Correct 41 ms 25172 KB Output is correct
5 Correct 4 ms 21080 KB Output is correct
6 Correct 4 ms 21084 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 6 ms 21284 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 5 ms 21084 KB Output is correct
13 Correct 34 ms 24428 KB Output is correct
14 Correct 37 ms 24924 KB Output is correct
15 Correct 45 ms 25172 KB Output is correct
16 Correct 34 ms 24656 KB Output is correct
17 Correct 39 ms 25172 KB Output is correct
18 Correct 41 ms 25168 KB Output is correct
19 Correct 46 ms 30680 KB Output is correct
20 Correct 4 ms 21080 KB Output is correct
21 Correct 6 ms 21084 KB Output is correct
22 Correct 47 ms 25084 KB Output is correct
23 Correct 36 ms 24412 KB Output is correct
24 Correct 43 ms 25172 KB Output is correct
25 Correct 35 ms 24444 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21088 KB Output is correct
2 Correct 4 ms 21340 KB Output is correct
3 Correct 39 ms 28912 KB Output is correct
4 Correct 30 ms 18272 KB Output is correct
5 Correct 29 ms 18264 KB Output is correct
6 Correct 103 ms 28724 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 3 ms 19036 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 4 ms 21084 KB Output is correct
15 Correct 4 ms 21340 KB Output is correct
16 Correct 4 ms 21092 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 4 ms 21084 KB Output is correct
23 Correct 54 ms 31496 KB Output is correct
24 Correct 54 ms 32464 KB Output is correct
25 Correct 48 ms 28880 KB Output is correct
26 Correct 29 ms 18268 KB Output is correct
27 Correct 28 ms 18004 KB Output is correct
28 Correct 30 ms 18512 KB Output is correct
29 Correct 86 ms 26196 KB Output is correct
30 Correct 65 ms 36300 KB Output is correct
31 Correct 58 ms 37060 KB Output is correct
32 Correct 47 ms 27856 KB Output is correct
33 Correct 40 ms 30668 KB Output is correct
34 Correct 28 ms 18004 KB Output is correct
35 Correct 29 ms 18268 KB Output is correct
36 Correct 28 ms 18524 KB Output is correct
37 Correct 102 ms 28828 KB Output is correct
38 Correct 62 ms 35020 KB Output is correct
39 Correct 45 ms 27216 KB Output is correct
40 Correct 54 ms 31820 KB Output is correct
41 Correct 47 ms 34772 KB Output is correct
42 Correct 29 ms 18092 KB Output is correct
43 Correct 40 ms 18004 KB Output is correct
44 Correct 29 ms 18264 KB Output is correct
45 Correct 85 ms 27348 KB Output is correct
46 Correct 60 ms 37564 KB Output is correct
47 Correct 53 ms 32008 KB Output is correct
48 Correct 59 ms 36668 KB Output is correct
49 Correct 35 ms 24920 KB Output is correct
50 Correct 29 ms 18268 KB Output is correct
51 Correct 32 ms 18428 KB Output is correct
52 Correct 29 ms 18012 KB Output is correct
53 Correct 99 ms 26960 KB Output is correct
54 Correct 75 ms 33908 KB Output is correct