Submission #1696312


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> pii;

int N;
ll A[100010];
ll U[100010];
int par[100010];
vector<pii> mem;
vector<int> G[100010];
bool visit[100010] = {0},F = false;
int root;

void DFS(int v,int p,int d)
{
    if(visit[v])return;
    visit[v] = true;
    par[v] = p;
    mem.push_back(make_pair(d,v));
    for(int i = 0; i < G[v].size(); i++)if(G[v][i] != p)DFS(G[v][i],v,d + 1);
    return;
}

int main()
{
    scanf("%d",&N);
    for(int i = 0; i < N; i++)scanf("%lld",A + i + 1);

    for(int i = 0; i < N - 1; i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        G[a].push_back(b);
        G[b].push_back(a);
    }
    if(N == 2)
    {
        if(A[1] == A[2])printf("YES\n");
        else printf("NO\n");
        return 0;
    }
    for(int i = 1; i <= N; i++)
    {
        if(G[i].size() > 1)
        {
            root = i;
            DFS(i,-1,0);
            break;
        }
    }
    sort(mem.begin(),mem.end());
    reverse(mem.begin(),mem.end());
    for(int i = 0; i < N; i++)
    {
        int v = mem[i].second;
        if(G[v].size() == 1)
        {
            U[v] = A[v];
            continue;
        }
        ll sum = 0,MAX = 0,MIN = 100000000000;
        for(int i = 0; i < G[v].size(); i++)
        {
            if(par[v] == G[v][i])continue;
            sum += U[G[v][i]];
            MAX = max(MAX,U[G[v][i]]);
            //if(U[G[v][i]] == -1 || A[v] < U[G[v][i]])F = true;
        }
        if(A[v] * 2 < sum || A[v] < A[v] * 2 - sum)U[v] = -1;
        else U[v] = A[v] * 2 - sum;
    }
    if(U[root] == 0 || F)printf("YES\n");
    else printf("NO\n");
    return 0;
}

Submission Info

Submission Time
Task C - Cleaning
User unit
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1748 Byte
Status WA
Exec Time 65 ms
Memory 17392 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
                   ^
./Main.cpp:29:54: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < N; i++)scanf("%lld",A + i + 1);
                                                      ^
./Main.cpp:34:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 46
WA × 5
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 60 ms 10100 KB
in10.txt AC 61 ms 10100 KB
in11.txt AC 62 ms 16116 KB
in12.txt AC 61 ms 15984 KB
in13.txt AC 56 ms 17392 KB
in14.txt AC 59 ms 16368 KB
in15.txt AC 3 ms 4224 KB
in16.txt AC 3 ms 4224 KB
in17.txt AC 3 ms 4224 KB
in18.txt AC 3 ms 4224 KB
in19.txt WA 60 ms 10100 KB
in2.txt AC 60 ms 10100 KB
in20.txt WA 61 ms 10100 KB
in21.txt WA 61 ms 10100 KB
in22.txt WA 62 ms 10100 KB
in23.txt AC 60 ms 10100 KB
in24.txt AC 61 ms 10100 KB
in25.txt AC 3 ms 4224 KB
in26.txt AC 64 ms 10100 KB
in27.txt AC 64 ms 10100 KB
in28.txt AC 3 ms 4224 KB
in29.txt AC 59 ms 10100 KB
in3.txt AC 61 ms 10100 KB
in30.txt AC 3 ms 4224 KB
in31.txt AC 65 ms 10100 KB
in32.txt AC 61 ms 10100 KB
in33.txt AC 62 ms 10100 KB
in34.txt AC 61 ms 10100 KB
in35.txt AC 61 ms 10100 KB
in36.txt AC 61 ms 10100 KB
in37.txt AC 4 ms 4352 KB
in38.txt AC 60 ms 10100 KB
in39.txt AC 61 ms 10100 KB
in4.txt AC 61 ms 10100 KB
in40.txt AC 60 ms 10100 KB
in41.txt AC 61 ms 10100 KB
in42.txt AC 62 ms 10100 KB
in43.txt AC 60 ms 10100 KB
in44.txt WA 60 ms 10100 KB
in45.txt AC 61 ms 10100 KB
in5.txt AC 60 ms 10100 KB
in6.txt AC 61 ms 10100 KB
in7.txt AC 57 ms 9588 KB
in8.txt AC 16 ms 5628 KB
in9.txt AC 61 ms 10100 KB
sample1.txt AC 3 ms 4224 KB
sample2.txt AC 3 ms 4224 KB
sample3.txt AC 3 ms 4224 KB