oj.uz

답안 #885156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885156 2023-12-09T05:22:23 Z 12345678 Pipes (BOI13_pipes) C++17
89.6296 / 100
 107 ms 38424 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+1)/2;
            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-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:53: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]
   53 |             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 4 ms 21084 KB Output is correct
3 Correct 4 ms 21152 KB Output is correct
4 Correct 42 ms 26112 KB Output is correct
5 Correct 4 ms 21080 KB Output is correct
6 Correct 5 ms 21100 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 5 ms 21084 KB Output is correct
9 Correct 5 ms 21152 KB Output is correct
10 Correct 5 ms 21084 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 5 ms 21092 KB Output is correct
13 Correct 32 ms 25172 KB Output is correct
14 Correct 38 ms 26024 KB Output is correct
15 Correct 40 ms 26196 KB Output is correct
16 Correct 35 ms 25680 KB Output is correct
17 Correct 41 ms 26332 KB Output is correct
18 Correct 40 ms 26160 KB Output is correct
19 Correct 54 ms 31832 KB Output is correct
20 Correct 5 ms 21080 KB Output is correct
21 Correct 4 ms 21084 KB Output is correct
22 Correct 39 ms 26264 KB Output is correct
23 Correct 34 ms 25172 KB Output is correct
24 Correct 41 ms 26188 KB Output is correct
25 Correct 38 ms 25528 KB Output is correct

Subtask #2
59.6296296296 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 21080 KB Output isn't correct
2 Correct 4 ms 21340 KB Output is correct
3 Correct 39 ms 29916 KB Output is correct
4 Correct 29 ms 19120 KB Output is correct
5 Correct 29 ms 19488 KB Output is correct
6 Correct 107 ms 32084 KB Output is correct
7 Incorrect 4 ms 21080 KB Output isn't correct
8 Incorrect 4 ms 21180 KB Output isn't correct
9 Correct 4 ms 19032 KB Output is correct
10 Correct 3 ms 14836 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 Correct 6 ms 21084 KB Output is correct
15 Correct 5 ms 21548 KB Output is correct
16 Correct 4 ms 21084 KB Output is correct
17 Correct 4 ms 19032 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 4 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 46 ms 32348 KB Output is correct
24 Correct 54 ms 33388 KB Output is correct
25 Correct 39 ms 29908 KB Output is correct
26 Correct 31 ms 19284 KB Output is correct
27 Correct 38 ms 19284 KB Output is correct
28 Correct 30 ms 19548 KB Output is correct
29 Correct 92 ms 28860 KB Output is correct
30 Incorrect 58 ms 37320 KB Output isn't correct
31 Incorrect 62 ms 37992 KB Output isn't correct
32 Incorrect 47 ms 28876 KB Output isn't correct
33 Correct 43 ms 31212 KB Output is correct
34 Correct 30 ms 19092 KB Output is correct
35 Correct 29 ms 19284 KB Output is correct
36 Correct 33 ms 19368 KB Output is correct
37 Correct 107 ms 32160 KB Output is correct
38 Incorrect 73 ms 35944 KB Output isn't correct
39 Correct 47 ms 28016 KB Output is correct
40 Incorrect 53 ms 32976 KB Output isn't correct
41 Correct 47 ms 35796 KB Output is correct
42 Correct 31 ms 19068 KB Output is correct
43 Correct 30 ms 19028 KB Output is correct
44 Correct 30 ms 19416 KB Output is correct
45 Correct 86 ms 30120 KB Output is correct
46 Correct 61 ms 38424 KB Output is correct
47 Correct 60 ms 33332 KB Output is correct
48 Correct 59 ms 37576 KB Output is correct
49 Correct 35 ms 25940 KB Output is correct
50 Correct 29 ms 19284 KB Output is correct
51 Correct 31 ms 19440 KB Output is correct
52 Correct 29 ms 19028 KB Output is correct
53 Correct 102 ms 30320 KB Output is correct
54 Correct 67 ms 34992 KB Output is correct