Submission #1373048
Source Code Expand
#include <bits/stdc++.h> #define pii pair<int, int> #define f first #define s second #define pb push_back #define mp make_pair #define ll long long #define ull unsigned long long #define ld long double #define sz(v) int(v.size()) #define all(v) v.begin(), v.end() #define y1 what using namespace std; const int N = (int) 1e5 + 10; const int M = (int) 101; const ll big = (1LL << 51); const ll LINF = (ll) 1e18; const int INF = (int) 1e9 + 7; const int INF1 = (int) 1e9 + 3; const double EPS = (double) 1e-6; const double PI = 3.14159265359; int n; int root; int a[N]; vector<int> v[N]; ll calc(int x, int p = -1) { ll mx = 0, leaf = 1; ll sum = 0; for (auto it : v[x]) { if (it == p) continue; ll rem = calc(it, x); sum += rem; mx = max(mx, rem); leaf = 0; } if (leaf) return a[x]; ll z = sum - a[x]; ll max_matching; if (mx >= sum / 2) { max_matching = sum - mx; } else { max_matching = sum / 2; } if (max_matching >= z) { return a[x] - z; } else { cout << "NO"; exit(0); } } int main() { #define fn "balls" #ifdef witch freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #else // freopen(fn".in", "r", stdin); // freopen(fn".out", "w", stdout); #endif srand(time(0)); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1, x, y; i < n; i++) { cin >> x >> y; v[x].pb(y); v[y].pb(x); } root = 1; for (int i = 1; i <= n; i++) { if (sz(v[i]) > 1) { root = i; } } cout << (calc(root) == 0 ? "YES" : "NO"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cleaning |
User | Nurlykhan |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1761 Byte |
Status | WA |
Exec Time | 143 ms |
Memory | 13184 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 | 125 ms | 6272 KB |
in10.txt | AC | 125 ms | 6272 KB |
in11.txt | AC | 137 ms | 12032 KB |
in12.txt | AC | 143 ms | 11392 KB |
in13.txt | AC | 109 ms | 12416 KB |
in14.txt | AC | 107 ms | 13184 KB |
in15.txt | AC | 2 ms | 2560 KB |
in16.txt | AC | 2 ms | 2560 KB |
in17.txt | WA | 2 ms | 2560 KB |
in18.txt | AC | 2 ms | 2560 KB |
in19.txt | AC | 121 ms | 6272 KB |
in2.txt | AC | 126 ms | 6272 KB |
in20.txt | AC | 125 ms | 6272 KB |
in21.txt | AC | 127 ms | 6272 KB |
in22.txt | AC | 123 ms | 6272 KB |
in23.txt | WA | 126 ms | 6272 KB |
in24.txt | AC | 123 ms | 6272 KB |
in25.txt | AC | 2 ms | 2560 KB |
in26.txt | AC | 139 ms | 6272 KB |
in27.txt | AC | 136 ms | 6272 KB |
in28.txt | AC | 2 ms | 2560 KB |
in29.txt | AC | 104 ms | 6272 KB |
in3.txt | AC | 123 ms | 6272 KB |
in30.txt | AC | 2 ms | 2560 KB |
in31.txt | WA | 125 ms | 6272 KB |
in32.txt | WA | 123 ms | 6272 KB |
in33.txt | AC | 124 ms | 6272 KB |
in34.txt | AC | 123 ms | 6272 KB |
in35.txt | AC | 123 ms | 6272 KB |
in36.txt | AC | 128 ms | 6272 KB |
in37.txt | AC | 3 ms | 2688 KB |
in38.txt | AC | 125 ms | 6272 KB |
in39.txt | AC | 125 ms | 6272 KB |
in4.txt | AC | 123 ms | 6272 KB |
in40.txt | AC | 125 ms | 6272 KB |
in41.txt | AC | 124 ms | 6272 KB |
in42.txt | AC | 127 ms | 6272 KB |
in43.txt | AC | 122 ms | 6272 KB |
in44.txt | WA | 125 ms | 6272 KB |
in45.txt | AC | 123 ms | 6272 KB |
in5.txt | AC | 125 ms | 6272 KB |
in6.txt | AC | 123 ms | 6272 KB |
in7.txt | AC | 112 ms | 5888 KB |
in8.txt | AC | 30 ms | 3456 KB |
in9.txt | AC | 125 ms | 6272 KB |
sample1.txt | AC | 2 ms | 2560 KB |
sample2.txt | AC | 2 ms | 2560 KB |
sample3.txt | AC | 2 ms | 2560 KB |