oj.uz

답안 #885159

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885159 2023-12-09T05:29:44 Z 12345678 Pipes (BOI13_pipes) C++17
80.5556 / 100
 1000 ms 37412 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;
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)/2;
            //cout<<"here "<<l<<' '<<r<<' '<<md<<'\n';
            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]) r=md;
            else l=md+1;
        }
        //cout<<"here"<<' '<<l<<'\n';
        //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:54: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]
   54 |             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 5 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21084 KB Output is correct
4 Correct 46 ms 25156 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 4 ms 21084 KB Output is correct
7 Correct 4 ms 21172 KB Output is correct
8 Correct 6 ms 21084 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 4 ms 21084 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 4 ms 21080 KB Output is correct
13 Correct 33 ms 24412 KB Output is correct
14 Correct 39 ms 24920 KB Output is correct
15 Correct 40 ms 25424 KB Output is correct
16 Correct 35 ms 24668 KB Output is correct
17 Correct 42 ms 25172 KB Output is correct
18 Correct 40 ms 25172 KB Output is correct
19 Correct 49 ms 30732 KB Output is correct
20 Correct 4 ms 21084 KB Output is correct
21 Correct 4 ms 21084 KB Output is correct
22 Correct 56 ms 25172 KB Output is correct
23 Correct 34 ms 24288 KB Output is correct
24 Correct 42 ms 25172 KB Output is correct
25 Correct 36 ms 24504 KB Output is correct

Subtask #2
50.5555555556 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21080 KB Output is correct
2 Incorrect 4 ms 21336 KB Output isn't correct
3 Correct 47 ms 28940 KB Output is correct
4 Correct 29 ms 18268 KB Output is correct
5 Correct 29 ms 18260 KB Output is correct
6 Correct 114 ms 28752 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Incorrect 4 ms 21084 KB Output isn't correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Execution timed out 1068 ms 21084 KB Time limit exceeded
15 Incorrect 5 ms 21336 KB Output isn't correct
16 Incorrect 4 ms 21084 KB Output isn't 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 Execution timed out 1063 ms 21084 KB Time limit exceeded
23 Incorrect 54 ms 31564 KB Output isn't correct
24 Incorrect 60 ms 32752 KB Output isn't correct
25 Correct 36 ms 28888 KB Output is correct
26 Correct 28 ms 18268 KB Output is correct
27 Correct 29 ms 18004 KB Output is correct
28 Correct 31 ms 18524 KB Output is correct
29 Correct 95 ms 26216 KB Output is correct
30 Incorrect 63 ms 36440 KB Output isn't correct
31 Incorrect 60 ms 37060 KB Output isn't correct
32 Correct 46 ms 27852 KB Output is correct
33 Correct 42 ms 30264 KB Output is correct
34 Correct 29 ms 18004 KB Output is correct
35 Correct 29 ms 18032 KB Output is correct
36 Correct 29 ms 18512 KB Output is correct
37 Correct 135 ms 28620 KB Output is correct
38 Incorrect 57 ms 34760 KB Output isn't correct
39 Incorrect 72 ms 26964 KB Output isn't correct
40 Correct 51 ms 31948 KB Output is correct
41 Correct 44 ms 34772 KB Output is correct
42 Correct 28 ms 18012 KB Output is correct
43 Correct 30 ms 18008 KB Output is correct
44 Correct 28 ms 18256 KB Output is correct
45 Correct 85 ms 27216 KB Output is correct
46 Incorrect 59 ms 37412 KB Output isn't correct
47 Correct 53 ms 32208 KB Output is correct
48 Execution timed out 1016 ms 36036 KB Time limit exceeded
49 Correct 35 ms 24912 KB Output is correct
50 Correct 29 ms 18260 KB Output is correct
51 Correct 38 ms 18256 KB Output is correct
52 Correct 28 ms 18004 KB Output is correct
53 Correct 105 ms 26924 KB Output is correct
54 Incorrect 66 ms 33980 KB Output isn't correct