Submission #1693724
Source Code Expand
#include<bits/stdc++.h> #define N 100005 using namespace std; typedef long long ll; int n, A[N], ans=1; vector<int> G[N]; ll dfs(int x, int px){ vector<ll> v; for(int i=0;i<G[x].size();i++) if(G[x][i]!=px) v.push_back(dfs(G[x][i], x)); if(v.empty()) return A[x]; ll res=0; for(int i=0;i<v.size();i++) res+=v[i]; sort(v.begin(),v.end()); ll q=res-A[x], sum=0; if(v[v.size()-1]*2<=res) sum=res/2; else sum=(res-v[v.size()-1]); //if(x==1) cout<<q<<' '<<sum<<' '<<v[1]<<' '<<res<<endl; if(q<0) ans=0; if(q>sum) ans=0; else res-=q*2; if(px==-1&&A[x]!=res) ans=0; return res; } int main(){ cin>>n; for(int i=0;i<n;i++) scanf("%d", &A[i]); int a, b; for(int i=0;i<n-1;i++){ scanf("%d %d", &a, &b); G[a-1].push_back(b-1); G[b-1].push_back(a-1); } int root; for(int i=0;i<n;i++) if(G[i].size()==1){ root=i; break; } dfs(root, -1); if(ans) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cleaning |
User | Gacho_0716 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1104 Byte |
Status | AC |
Exec Time | 67 ms |
Memory | 17024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:44:42: 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("%d", &A[i]); ^ ./Main.cpp:49:27: 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 | 700 / 700 | ||||
Status |
|
|
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 | 59 ms | 6272 KB |
in10.txt | AC | 58 ms | 6272 KB |
in11.txt | AC | 65 ms | 17024 KB |
in12.txt | AC | 67 ms | 17024 KB |
in13.txt | AC | 66 ms | 17024 KB |
in14.txt | AC | 62 ms | 17024 KB |
in15.txt | AC | 3 ms | 2560 KB |
in16.txt | AC | 3 ms | 2560 KB |
in17.txt | AC | 3 ms | 2560 KB |
in18.txt | AC | 3 ms | 2560 KB |
in19.txt | AC | 59 ms | 6272 KB |
in2.txt | AC | 58 ms | 6272 KB |
in20.txt | AC | 61 ms | 6272 KB |
in21.txt | AC | 57 ms | 6272 KB |
in22.txt | AC | 59 ms | 6272 KB |
in23.txt | AC | 61 ms | 6272 KB |
in24.txt | AC | 57 ms | 6272 KB |
in25.txt | AC | 3 ms | 2560 KB |
in26.txt | AC | 60 ms | 6272 KB |
in27.txt | AC | 67 ms | 6272 KB |
in28.txt | AC | 3 ms | 2560 KB |
in29.txt | AC | 65 ms | 6272 KB |
in3.txt | AC | 60 ms | 6272 KB |
in30.txt | AC | 3 ms | 2560 KB |
in31.txt | AC | 59 ms | 6272 KB |
in32.txt | AC | 59 ms | 6272 KB |
in33.txt | AC | 59 ms | 6272 KB |
in34.txt | AC | 64 ms | 6272 KB |
in35.txt | AC | 59 ms | 6272 KB |
in36.txt | AC | 60 ms | 6272 KB |
in37.txt | AC | 3 ms | 2688 KB |
in38.txt | AC | 59 ms | 6272 KB |
in39.txt | AC | 59 ms | 6272 KB |
in4.txt | AC | 65 ms | 6272 KB |
in40.txt | AC | 60 ms | 6272 KB |
in41.txt | AC | 61 ms | 6272 KB |
in42.txt | AC | 64 ms | 6272 KB |
in43.txt | AC | 59 ms | 6272 KB |
in44.txt | AC | 61 ms | 6272 KB |
in45.txt | AC | 58 ms | 6272 KB |
in5.txt | AC | 61 ms | 6272 KB |
in6.txt | AC | 58 ms | 6272 KB |
in7.txt | AC | 52 ms | 5888 KB |
in8.txt | AC | 14 ms | 3456 KB |
in9.txt | AC | 61 ms | 6272 KB |
sample1.txt | AC | 3 ms | 2560 KB |
sample2.txt | AC | 3 ms | 2560 KB |
sample3.txt | AC | 3 ms | 2560 KB |