Submission #1304801
Source Code Expand
#include <iostream> #include <vector> using namespace std; const int NMAX = 100000 + 5; typedef long long int lint; vector <int> graph[NMAX]; int S[NMAX]; lint l[NMAX]; lint r[NMAX]; bool fail; void dfs(int node, int father) { l[node] = r[node] = 2 * S[node]; int sons = 0; for (auto it: graph[node]) if (it != father) { dfs(it, node); l[node] -= r[it]; r[node] -= l[it]; ++ sons; } if (!sons) { l[node] = r[node] -= S[node]; return ; } if (l[node] < 0) l[node] = 0; if (l[node] > r[node]) fail = true; } int main() { ios_base :: sync_with_stdio(false); int N; cin >> N; for (int i = 1; i <= N; ++ i) cin >> S[i]; for (int i = 1; i < N; ++ i) { int a, b; cin >> a >> b; graph[a].push_back(b); graph[b].push_back(a); } if (N == 2) fail = (S[1] != S[2]); else { int one; for (one = 1; graph[one].size() < 2; ++ one); dfs(one, 0); if (l[one] > 0) fail = true; } cout << (!fail ? "YES" : "NO") << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cleaning |
User | Andrei1998 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1249 Byte |
Status | WA |
Exec Time | 47 ms |
Memory | 14336 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 43 ms | 7808 KB |
in10.txt | AC | 43 ms | 7808 KB |
in11.txt | AC | 47 ms | 13184 KB |
in12.txt | AC | 47 ms | 13056 KB |
in13.txt | AC | 45 ms | 14336 KB |
in14.txt | AC | 43 ms | 13440 KB |
in15.txt | AC | 2 ms | 2560 KB |
in16.txt | AC | 2 ms | 2560 KB |
in17.txt | AC | 2 ms | 2560 KB |
in18.txt | AC | 2 ms | 2560 KB |
in19.txt | WA | 44 ms | 7808 KB |
in2.txt | AC | 44 ms | 7808 KB |
in20.txt | WA | 44 ms | 7808 KB |
in21.txt | WA | 44 ms | 7808 KB |
in22.txt | WA | 43 ms | 7808 KB |
in23.txt | WA | 43 ms | 7808 KB |
in24.txt | AC | 43 ms | 7808 KB |
in25.txt | AC | 2 ms | 2560 KB |
in26.txt | AC | 45 ms | 7808 KB |
in27.txt | AC | 46 ms | 7808 KB |
in28.txt | AC | 2 ms | 2560 KB |
in29.txt | AC | 41 ms | 7808 KB |
in3.txt | AC | 44 ms | 7808 KB |
in30.txt | WA | 2 ms | 2560 KB |
in31.txt | WA | 47 ms | 7808 KB |
in32.txt | WA | 43 ms | 7808 KB |
in33.txt | AC | 44 ms | 7808 KB |
in34.txt | AC | 44 ms | 7808 KB |
in35.txt | AC | 43 ms | 7808 KB |
in36.txt | AC | 45 ms | 7808 KB |
in37.txt | AC | 2 ms | 2688 KB |
in38.txt | AC | 44 ms | 7808 KB |
in39.txt | AC | 44 ms | 7808 KB |
in4.txt | AC | 43 ms | 7808 KB |
in40.txt | AC | 45 ms | 7808 KB |
in41.txt | AC | 44 ms | 7808 KB |
in42.txt | AC | 43 ms | 7808 KB |
in43.txt | AC | 43 ms | 7808 KB |
in44.txt | WA | 44 ms | 7808 KB |
in45.txt | AC | 44 ms | 7808 KB |
in5.txt | AC | 44 ms | 7808 KB |
in6.txt | AC | 44 ms | 7808 KB |
in7.txt | AC | 39 ms | 7296 KB |
in8.txt | AC | 12 ms | 3840 KB |
in9.txt | AC | 44 ms | 7808 KB |
sample1.txt | AC | 2 ms | 2560 KB |
sample2.txt | AC | 2 ms | 2560 KB |
sample3.txt | AC | 2 ms | 2560 KB |