oj.uz

Submission #285384

# Submission time Handle Problem Language Result Execution time Memory
285384 2020-08-28T20:51:44 Z ScarletS Pipes (BOI13_pipes) C++17
74.0741 / 100
 215 ms 17144 KB 
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
#define pii pair<int,int>
#define f first
#define s second
using namespace std;

const int MAXN=1e5+10;
int n,m,o;
vector<pii> edges[MAXN];
int scores[MAXN], cur[MAXN], ans[5*MAXN], counter[MAXN];
bool done[MAXN];

void dfsTree(int c, int p, int x)
{
    for (pii i : edges[c])
        if (i.f!=p)
        {
            dfsTree(i.f,c,i.s);
            cur[c]+=ans[i.s];
        }
    if (c!=1)
    {
        ans[x]=scores[c]-cur[c];
        cur[c]+=ans[x];
    }
}

void treeCase()
{
    dfsTree(1,0,0);
    if (scores[1]!=cur[1])
    {
        cout<<0;
        return;
    }
    for (int i=0;i<m;++i)
        cout<<ans[i]*2<<"\n";
} 

vector<int> circle;
vector<int> vals;

void dfs(int c, int p)
{
    circle.push_back(c);
    done[c]=1;
    for (pii i : edges[c])
        if (i.f!=p)
        {
            if (i.f==o)
            {
                vals.push_back(i.s);
                return;
            }
            if (!done[i.f])
            {
                vals.push_back(i.s);
                dfs(i.f,c);
            }
        }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int u,v,x=0;
    cin>>n>>m;
    for (int i=1;i<=n;++i)
        cin>>scores[i];
    for (int i=0;i<m;++i)
    {
        cin>>u>>v;
        edges[u].push_back({v,i});
        edges[v].push_back({u,i});
    }
    if (m==n-1)
    {
        treeCase();
        return 0;
    }
    if (m>n)
    {
        cout<<0;
        return 0;
    }
    stack<int> st;
    for (int i=1;i<=n;++i)
    {
        counter[i]=sz(edges[i]);
        if (counter[i]==1)
            st.push(i);
    }
    while (sz(st))
    {
        ++x;
        v=st.top();st.pop();
        done[v]=1;
        for (pii i : edges[v])
            if (!done[i.f])
            {
                u=i.s;
                ans[u]=scores[v]-cur[v];
                cur[v]+=ans[u];
                cur[i.f]+=ans[u];
                --counter[i.f];
                if (counter[i.f]==1)
                    st.push(i.f);
            }
    }
    if ((n-x+1)&1)
    {
        cout<<0;
        return 0;
    }
    for (int i=1;i<=n;++i)
        if (!done[i])
        {
            o=i;
            dfs(o,0);
            break;
        }
    ll tot=0;
    for (int i=0;i<n-x;++i)
    {
        if (i&1)
            tot-=(scores[i]-cur[i]);
        else
            tot+=(scores[i]-cur[i]);
    }
    if (tot&1)
    {
        cout<<0;
        return 0;
    }
    ans[vals.back()]=(tot>>1);
    ans[vals[0]]=scores[circle[0]]-cur[circle[0]]-ans[vals.back()];
    for (int i=1;i+1<n-x;++i)
        ans[vals[i]]=scores[circle[i]]-cur[circle[i]]-ans[vals[i-1]];
    if (scores[circle[0]]!=ans[vals[0]]+ans[vals.back()])
    {
        cout<<0;
        return 0;
    }
    for (int i=1;i<n;++i)
    {
        if (scores[circle[i]]!=ans[vals[i]]+ans[vals[i-1]])
        {
            cout<<0;
            return 0;
        }
    }
    for (int i=0;i<m;++i)
        cout<<ans[i]*2<<"\n";
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 66 ms 8060 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2720 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 3 ms 2816 KB Output is correct
12 Correct 2 ms 2816 KB Output is correct
13 Correct 54 ms 7032 KB Output is correct
14 Correct 65 ms 7928 KB Output is correct
15 Correct 76 ms 8132 KB Output is correct
16 Correct 54 ms 7288 KB Output is correct
17 Correct 68 ms 8056 KB Output is correct
18 Correct 73 ms 8056 KB Output is correct
19 Correct 82 ms 11384 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 3 ms 2816 KB Output is correct
22 Correct 75 ms 8060 KB Output is correct
23 Correct 55 ms 6904 KB Output is correct
24 Correct 85 ms 8056 KB Output is correct
25 Correct 59 ms 7160 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Incorrect 2 ms 2816 KB Output isn't correct
3 Correct 56 ms 7672 KB Output is correct
4 Correct 52 ms 6392 KB Output is correct
5 Correct 47 ms 6520 KB Output is correct
6 Correct 207 ms 16888 KB Output is correct
7 Incorrect 2 ms 2688 KB Output isn't correct
8 Incorrect 2 ms 2688 KB Output isn't correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Incorrect 2 ms 2816 KB Output isn't correct
16 Incorrect 2 ms 2816 KB Output isn't correct
17 Correct 2 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 4 ms 2816 KB Output is correct
22 Incorrect 2 ms 2816 KB Output isn't correct
23 Incorrect 54 ms 10704 KB Output isn't correct
24 Incorrect 65 ms 11728 KB Output isn't correct
25 Correct 54 ms 7672 KB Output is correct
26 Correct 51 ms 6392 KB Output is correct
27 Correct 51 ms 6264 KB Output is correct
28 Correct 51 ms 6652 KB Output is correct
29 Correct 171 ms 14328 KB Output is correct
30 Incorrect 64 ms 10696 KB Output isn't correct
31 Incorrect 67 ms 13932 KB Output isn't correct
32 Incorrect 59 ms 9336 KB Output isn't correct
33 Correct 55 ms 7800 KB Output is correct
34 Correct 50 ms 6264 KB Output is correct
35 Correct 52 ms 6392 KB Output is correct
36 Correct 50 ms 6648 KB Output is correct
37 Correct 215 ms 17144 KB Output is correct
38 Incorrect 65 ms 11252 KB Output isn't correct
39 Incorrect 59 ms 8824 KB Output isn't correct
40 Incorrect 77 ms 11452 KB Output isn't correct
41 Correct 49 ms 7544 KB Output is correct
42 Correct 45 ms 6264 KB Output is correct
43 Correct 47 ms 6264 KB Output is correct
44 Correct 46 ms 6624 KB Output is correct
45 Correct 160 ms 15096 KB Output is correct
46 Incorrect 62 ms 10612 KB Output isn't correct
47 Incorrect 76 ms 11604 KB Output isn't correct
48 Incorrect 68 ms 13600 KB Output isn't correct
49 Correct 54 ms 7928 KB Output is correct
50 Correct 47 ms 6392 KB Output is correct
51 Correct 48 ms 6520 KB Output is correct
52 Correct 59 ms 6392 KB Output is correct
53 Correct 205 ms 14968 KB Output is correct
54 Incorrect 67 ms 10320 KB Output isn't correct