oj.uz

답안 #285379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285379 2020-08-28T20:35:02 Z ScarletS Pipes (BOI13_pipes) C++17
74.0741 / 100
 231 ms 16888 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;
vector<pii> edges[MAXN];
int scores[MAXN], cur[MAXN], ans[5*MAXN], counter[MAXN];
bool done[MAXN];
//set<pii> vals[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";
} 

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;
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 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 75 ms 7996 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 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 2816 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 2 ms 2816 KB Output is correct
13 Correct 51 ms 6904 KB Output is correct
14 Correct 78 ms 7800 KB Output is correct
15 Correct 69 ms 8056 KB Output is correct
16 Correct 56 ms 7288 KB Output is correct
17 Correct 69 ms 8024 KB Output is correct
18 Correct 65 ms 8056 KB Output is correct
19 Correct 77 ms 11384 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 2 ms 2816 KB Output is correct
22 Correct 70 ms 8056 KB Output is correct
23 Correct 52 ms 7032 KB Output is correct
24 Correct 68 ms 8056 KB Output is correct
25 Correct 53 ms 7160 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Incorrect 2 ms 2816 KB Output isn't correct
3 Correct 52 ms 7672 KB Output is correct
4 Correct 54 ms 6396 KB Output is correct
5 Correct 45 ms 6520 KB Output is correct
6 Correct 211 ms 16860 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 3 ms 2688 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 3 ms 2816 KB Output is correct
22 Incorrect 2 ms 2688 KB Output isn't correct
23 Incorrect 42 ms 6776 KB Output isn't correct
24 Incorrect 56 ms 7800 KB Output isn't correct
25 Correct 52 ms 7672 KB Output is correct
26 Correct 47 ms 6392 KB Output is correct
27 Correct 47 ms 6264 KB Output is correct
28 Correct 49 ms 6648 KB Output is correct
29 Correct 180 ms 14328 KB Output is correct
30 Incorrect 60 ms 7416 KB Output isn't correct
31 Incorrect 52 ms 7544 KB Output isn't correct
32 Incorrect 75 ms 8184 KB Output isn't correct
33 Correct 61 ms 7928 KB Output is correct
34 Correct 54 ms 6392 KB Output is correct
35 Correct 49 ms 6392 KB Output is correct
36 Correct 50 ms 6648 KB Output is correct
37 Correct 231 ms 16888 KB Output is correct
38 Incorrect 74 ms 7672 KB Output isn't correct
39 Incorrect 67 ms 8200 KB Output isn't correct
40 Incorrect 59 ms 7928 KB Output isn't correct
41 Correct 66 ms 7544 KB Output is correct
42 Correct 49 ms 6264 KB Output is correct
43 Correct 53 ms 6264 KB Output is correct
44 Correct 51 ms 6520 KB Output is correct
45 Correct 159 ms 15096 KB Output is correct
46 Incorrect 56 ms 7416 KB Output isn't correct
47 Incorrect 55 ms 7884 KB Output isn't correct
48 Incorrect 52 ms 7676 KB Output isn't correct
49 Correct 54 ms 7912 KB Output is correct
50 Correct 49 ms 6392 KB Output is correct
51 Correct 44 ms 6520 KB Output is correct
52 Correct 45 ms 6268 KB Output is correct
53 Correct 170 ms 15008 KB Output is correct
54 Incorrect 53 ms 7672 KB Output isn't correct