Submission #1837001
Source Code Expand
#include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> using namespace std; #define F(i, n) for(int i = 0; i < n; ++i) #define FOR(i,a,b) for (int i = (a); i < (b); i++) #define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--) #define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL) INF; const int MAX = 200*1000+47; VI G[MAX]; int A[MAX]; bool ok = true; LL DFS(int v, int p) { LL val = A[v]; bool leaf = SZ(G[v]) == 1; if (!leaf)val *= 2; LL x = val; FOR(i, 0, SZ(G[v])) { int to = G[v][i]; if (to == p)continue; LL res = DFS(to, v); if (!leaf && res * 2 > val)ok = false; x -= res; } return x; } int main() { int n; scanf("%d", &n); FOR(i, 0, n)scanf("%d", A + i); FOR(i, 0, n-1) { int a, b; scanf("%d%d", &a, &b); --a, --b; G[a].PB(b); G[b].PB(a); } if (DFS(0, -1) == 0 && ok) { printf("YES\n"); } else { printf("NO\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cleaning |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1685 Byte |
Status | WA |
Exec Time | 56 ms |
Memory | 15104 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:68:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:69:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] FOR(i, 0, n)scanf("%d", A + i); ^ ./Main.cpp:74:30: 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 |
|
|
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 | 49 ms | 8576 KB |
in10.txt | AC | 47 ms | 8576 KB |
in11.txt | AC | 51 ms | 13952 KB |
in12.txt | AC | 51 ms | 13824 KB |
in13.txt | AC | 47 ms | 15104 KB |
in14.txt | AC | 46 ms | 14208 KB |
in15.txt | AC | 3 ms | 4992 KB |
in16.txt | AC | 3 ms | 4992 KB |
in17.txt | AC | 3 ms | 4992 KB |
in18.txt | AC | 3 ms | 4992 KB |
in19.txt | AC | 47 ms | 8576 KB |
in2.txt | AC | 47 ms | 8576 KB |
in20.txt | AC | 50 ms | 8576 KB |
in21.txt | AC | 48 ms | 8576 KB |
in22.txt | AC | 47 ms | 8576 KB |
in23.txt | AC | 47 ms | 8576 KB |
in24.txt | AC | 52 ms | 8576 KB |
in25.txt | WA | 3 ms | 4992 KB |
in26.txt | AC | 50 ms | 8576 KB |
in27.txt | AC | 49 ms | 8576 KB |
in28.txt | AC | 3 ms | 4992 KB |
in29.txt | AC | 45 ms | 8576 KB |
in3.txt | AC | 47 ms | 8576 KB |
in30.txt | WA | 3 ms | 4992 KB |
in31.txt | WA | 47 ms | 8576 KB |
in32.txt | WA | 47 ms | 8576 KB |
in33.txt | AC | 47 ms | 8576 KB |
in34.txt | AC | 47 ms | 8576 KB |
in35.txt | AC | 48 ms | 8576 KB |
in36.txt | AC | 47 ms | 8576 KB |
in37.txt | WA | 3 ms | 4992 KB |
in38.txt | WA | 47 ms | 8576 KB |
in39.txt | WA | 47 ms | 8576 KB |
in4.txt | AC | 49 ms | 8576 KB |
in40.txt | WA | 48 ms | 8576 KB |
in41.txt | WA | 48 ms | 8576 KB |
in42.txt | AC | 47 ms | 8576 KB |
in43.txt | AC | 47 ms | 8576 KB |
in44.txt | AC | 48 ms | 8576 KB |
in45.txt | AC | 47 ms | 8576 KB |
in5.txt | AC | 47 ms | 8576 KB |
in6.txt | AC | 56 ms | 8576 KB |
in7.txt | AC | 42 ms | 8192 KB |
in8.txt | AC | 13 ms | 5760 KB |
in9.txt | AC | 47 ms | 8576 KB |
sample1.txt | AC | 3 ms | 4992 KB |
sample2.txt | AC | 3 ms | 4992 KB |
sample3.txt | AC | 3 ms | 4992 KB |