oj.uz

답안 #83630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
83630 2018-11-09T13:53:43 Z Bodo171 Pipes (BOI13_pipes) C++14
100 / 100
 112 ms 13884 KB 
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int nmax=100005;
vector< pair<int,int> > v[nmax];
pair<int,int> cyc[nmax];
int rep[nmax],wh[nmax],mu[nmax],viz[nmax];
long long am[nmax],ans[nmax],vreau[nmax];
long long act;
int n,nr,m,i,j,sz,x,y,a,b;
void solve(int x)
{
    int nod=0;
    viz[x]=1;
    for(int i=0;i<v[x].size();i++)
        if(!viz[v[x][i].first])
    {
        nod=v[x][i].first;
        solve(nod);
        ans[v[x][i].second]=vreau[nod]-am[nod];
        am[x]+=(vreau[nod]-am[nod]);
    }
}
int it=0;
bool gasit;
void dfs(int x)
{
    rep[++nr]=x;wh[x]=nr;
    for(int i=0;i<v[x].size()&&(!gasit);i++)
    {
        mu[nr]=v[x][i].second;
        if(!wh[v[x][i].first])
        {
            dfs(v[x][i].first);
        }
        else
        {
            if(wh[v[x][i].first]<nr-1)
            {
                gasit=1;
                for(j=wh[v[x][i].first];j<=nr;j++)
                {
                    cyc[++sz]={rep[j],mu[j]};
                }
            }
        }
    }
    nr--;
}
void gaseste_ciclu()
{
    dfs(1);
    for(i=1;i<=sz;i++)
        viz[cyc[i].first]=1;
    if(!(sz%2))
    {
        cout<<"0";
        return;
    }
    for(i=1;i<=sz;i++)
    {
        x=cyc[i].first;
        solve(x);
        vreau[x]-=am[x];
    }
    for(i=1;i<=sz;i++)
    {
        x=cyc[i].first;
        if((i&1)) act+=vreau[x];
        else act-=vreau[x];
    }
    if(act%2)
    {
        cout<<"0";
        return;
    }
    ans[cyc[sz].second]=act/2;
    cyc[0]=cyc[sz];
    for(i=1;i<sz;i++)
    {
        ans[cyc[i].second]=vreau[cyc[i].first]-ans[cyc[i-1].second];
    }
    for(i=1;i<=m;i++)
        cout<<2*ans[i]<<'\n';
}
int main()
{
    //freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>m;
    if(m>n)
    {
        cout<<"0";
        return 0;
    }
    for(i=1;i<=n;i++)
    {
        cin>>vreau[i];
    }
    for(i=1;i<=m;i++)
    {
        cin>>a>>b;
        v[a].push_back({b,i});
        v[b].push_back({a,i});
    }
    if(m==n-1)
    {
        solve(1);
        if(1LL*vreau[1]-am[1])
        {
            cout<<"0";
            return 0;
        }
        for(i=1;i<=m;i++)
            cout<<2*ans[i]<<'\n';
    }
    else
    {
        gaseste_ciclu();
    }
    return 0;
}

Compilation message

pipes.cpp: In function 'void solve(int)':
pipes.cpp:16:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
pipes.cpp: In function 'void dfs(int)':
pipes.cpp:30:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size()&&(!gasit);i++)
                 ~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2812 KB Output is correct
3 Correct 5 ms 2880 KB Output is correct
4 Correct 79 ms 9672 KB Output is correct
5 Correct 4 ms 9672 KB Output is correct
6 Correct 4 ms 9672 KB Output is correct
7 Correct 4 ms 9672 KB Output is correct
8 Correct 4 ms 9672 KB Output is correct
9 Correct 4 ms 9672 KB Output is correct
10 Correct 5 ms 9672 KB Output is correct
11 Correct 4 ms 9672 KB Output is correct
12 Correct 5 ms 9672 KB Output is correct
13 Correct 58 ms 9672 KB Output is correct
14 Correct 75 ms 9672 KB Output is correct
15 Correct 80 ms 9872 KB Output is correct
16 Correct 72 ms 9872 KB Output is correct
17 Correct 81 ms 9872 KB Output is correct
18 Correct 77 ms 10000 KB Output is correct
19 Correct 94 ms 11672 KB Output is correct
20 Correct 4 ms 11672 KB Output is correct
21 Correct 4 ms 11672 KB Output is correct
22 Correct 77 ms 11672 KB Output is correct
23 Correct 63 ms 11672 KB Output is correct
24 Correct 76 ms 11672 KB Output is correct
25 Correct 66 ms 11672 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11672 KB Output is correct
2 Correct 6 ms 11672 KB Output is correct
3 Correct 70 ms 11672 KB Output is correct
4 Correct 4 ms 11672 KB Output is correct
5 Correct 4 ms 11672 KB Output is correct
6 Correct 4 ms 11672 KB Output is correct
7 Correct 4 ms 11672 KB Output is correct
8 Correct 5 ms 11672 KB Output is correct
9 Correct 4 ms 11672 KB Output is correct
10 Correct 5 ms 11672 KB Output is correct
11 Correct 4 ms 11672 KB Output is correct
12 Correct 4 ms 11672 KB Output is correct
13 Correct 4 ms 11672 KB Output is correct
14 Correct 4 ms 11672 KB Output is correct
15 Correct 5 ms 11672 KB Output is correct
16 Correct 5 ms 11672 KB Output is correct
17 Correct 4 ms 11672 KB Output is correct
18 Correct 4 ms 11672 KB Output is correct
19 Correct 4 ms 11672 KB Output is correct
20 Correct 4 ms 11672 KB Output is correct
21 Correct 4 ms 11672 KB Output is correct
22 Correct 5 ms 11672 KB Output is correct
23 Correct 71 ms 11672 KB Output is correct
24 Correct 91 ms 12476 KB Output is correct
25 Correct 70 ms 12476 KB Output is correct
26 Correct 4 ms 12476 KB Output is correct
27 Correct 4 ms 12476 KB Output is correct
28 Correct 4 ms 12476 KB Output is correct
29 Correct 5 ms 12476 KB Output is correct
30 Correct 93 ms 13336 KB Output is correct
31 Correct 84 ms 13884 KB Output is correct
32 Correct 93 ms 13884 KB Output is correct
33 Correct 73 ms 13884 KB Output is correct
34 Correct 4 ms 13884 KB Output is correct
35 Correct 4 ms 13884 KB Output is correct
36 Correct 4 ms 13884 KB Output is correct
37 Correct 4 ms 13884 KB Output is correct
38 Correct 88 ms 13884 KB Output is correct
39 Correct 84 ms 13884 KB Output is correct
40 Correct 81 ms 13884 KB Output is correct
41 Correct 67 ms 13884 KB Output is correct
42 Correct 4 ms 13884 KB Output is correct
43 Correct 5 ms 13884 KB Output is correct
44 Correct 4 ms 13884 KB Output is correct
45 Correct 4 ms 13884 KB Output is correct
46 Correct 105 ms 13884 KB Output is correct
47 Correct 86 ms 13884 KB Output is correct
48 Correct 78 ms 13884 KB Output is correct
49 Correct 57 ms 13884 KB Output is correct
50 Correct 4 ms 13884 KB Output is correct
51 Correct 4 ms 13884 KB Output is correct
52 Correct 4 ms 13884 KB Output is correct
53 Correct 4 ms 13884 KB Output is correct
54 Correct 112 ms 13884 KB Output is correct