oj.uz

Submission #83601

# Submission time Handle Problem Language Result Execution time Memory
83601 2018-11-09T13:11:10 Z Bodo171 Pipes (BOI13_pipes) C++14
66.2963 / 100
 103 ms 19876 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],ans[nmax],vreau[nmax],am[nmax];
int n,nr,m,i,j,sz,x,y,act,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]);
    }
}
void dfs(int x)
{
    wh[x]=nr;rep[++nr]=x;
    for(int i=0;i<v[x].size();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)
            {
                for(j=wh[v[x][i].first];j<=nr;j++)
                {
                    cyc[++sz]={rep[j],mu[j]};
                }
            }
        }
    }
}
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;
        dfs(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];
    }
    ans[cyc[sz].second]=act-vreau[cyc[1].first];
    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(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:14: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:26:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 4 ms 2684 KB Output is correct
3 Correct 5 ms 2860 KB Output is correct
4 Correct 88 ms 8504 KB Output is correct
5 Correct 4 ms 8504 KB Output is correct
6 Correct 4 ms 8504 KB Output is correct
7 Correct 4 ms 8504 KB Output is correct
8 Correct 4 ms 8504 KB Output is correct
9 Correct 4 ms 8504 KB Output is correct
10 Correct 4 ms 8504 KB Output is correct
11 Correct 5 ms 8504 KB Output is correct
12 Correct 5 ms 8504 KB Output is correct
13 Correct 73 ms 8504 KB Output is correct
14 Correct 77 ms 8504 KB Output is correct
15 Correct 80 ms 8680 KB Output is correct
16 Correct 66 ms 8680 KB Output is correct
17 Correct 85 ms 8680 KB Output is correct
18 Correct 83 ms 8680 KB Output is correct
19 Correct 103 ms 10496 KB Output is correct
20 Correct 4 ms 10496 KB Output is correct
21 Correct 5 ms 10496 KB Output is correct
22 Correct 80 ms 10496 KB Output is correct
23 Correct 71 ms 10496 KB Output is correct
24 Correct 98 ms 10496 KB Output is correct
25 Correct 70 ms 10496 KB Output is correct

Subtask #2
36.2962962963 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 10496 KB Output isn't correct
2 Runtime error 11 ms 10496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 76 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Correct 4 ms 17196 KB Output is correct
5 Correct 4 ms 17196 KB Output is correct
6 Correct 4 ms 17196 KB Output is correct
7 Incorrect 4 ms 17196 KB Output isn't correct
8 Runtime error 11 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Correct 6 ms 17196 KB Output is correct
10 Correct 5 ms 17196 KB Output is correct
11 Correct 4 ms 17196 KB Output is correct
12 Correct 4 ms 17196 KB Output is correct
13 Correct 4 ms 17196 KB Output is correct
14 Runtime error 11 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 10 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 12 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 10 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Correct 4 ms 17196 KB Output is correct
19 Correct 4 ms 17196 KB Output is correct
20 Correct 5 ms 17196 KB Output is correct
21 Correct 4 ms 17196 KB Output is correct
22 Runtime error 15 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Runtime error 55 ms 17196 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Runtime error 86 ms 18400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 72 ms 18400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Correct 4 ms 18400 KB Output is correct
27 Correct 4 ms 18400 KB Output is correct
28 Correct 4 ms 18400 KB Output is correct
29 Correct 4 ms 18400 KB Output is correct
30 Runtime error 71 ms 18400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Runtime error 77 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Runtime error 79 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
33 Runtime error 71 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Correct 4 ms 18800 KB Output is correct
35 Correct 4 ms 18800 KB Output is correct
36 Correct 4 ms 18800 KB Output is correct
37 Correct 4 ms 18800 KB Output is correct
38 Runtime error 81 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Runtime error 70 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Runtime error 71 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Runtime error 79 ms 18800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
42 Correct 4 ms 18800 KB Output is correct
43 Correct 4 ms 18800 KB Output is correct
44 Correct 5 ms 18800 KB Output is correct
45 Correct 4 ms 18800 KB Output is correct
46 Runtime error 86 ms 19876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Runtime error 67 ms 19876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Runtime error 79 ms 19876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Runtime error 69 ms 19876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Correct 4 ms 19876 KB Output is correct
51 Correct 4 ms 19876 KB Output is correct
52 Correct 4 ms 19876 KB Output is correct
53 Correct 4 ms 19876 KB Output is correct
54 Runtime error 78 ms 19876 KB Execution killed with signal 11 (could be triggered by violating memory limits)