Submission #1093582
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef pair<ll,ll> pll; typedef vector<bool> vb; const ll oo = 0x3f3f3f3f3f3f3f3f; const double eps = 1e-9; #define sz(c) ll((c).size()) #define all(c) begin(c), end(c) #define FOR(i,a,b) for (ll i = (a); i < (b); i++) #define FORD(i,a,b) for (ll i = (b)-1; i >= (a); i--) #define mp make_pair #define mt make_tuple #define pb push_back #define eb emplace_back #define xx first #define yy second #define has(c,i) ((c).find(i) != end(c)) #define DBGDO(X) ({ if(1) cerr << "DBGDO: " << (#X) << " = " << (X) << endl; }) ll n; ll a[100100]; vl adj[100100]; bool ok = true; ll dfs(ll i, ll p = -1) { if (sz(adj[i]) == 1) { if (p != -1) return a[i]; assert(false); } else { ll sum = 0; for (ll j: adj[i]) if (j != p) { ll cur = dfs(j,i); if (cur > a[i]) ok = false; sum += cur; } ll res = 2*a[i]-sum; if (res > a[i]) ok = false; if (res < 0) ok = false; return res; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; FOR(i,0,n) cin >> a[i]; FOR(i,1,n) { ll u, v; cin >> u >> v; u--, v--; adj[u].pb(v), adj[v].pb(u); } if (n == 2) { ok = a[0] == a[1]; } else { FOR(i,0,n) if (sz(adj[i]) > 1) { ll res = dfs(i); if (res) ok = false; break; } } cout << (ok ? "YES" : "NO") << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Cleaning |
User | pwild |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1459 Byte |
Status | AC |
Exec Time | 59 ms |
Memory | 10496 KB |
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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 49 ms | 7168 KB |
in10.txt | AC | 50 ms | 7168 KB |
in11.txt | AC | 52 ms | 9728 KB |
in12.txt | AC | 59 ms | 9728 KB |
in13.txt | AC | 52 ms | 10496 KB |
in14.txt | AC | 51 ms | 9984 KB |
in15.txt | AC | 5 ms | 2560 KB |
in16.txt | AC | 5 ms | 2560 KB |
in17.txt | AC | 5 ms | 2560 KB |
in18.txt | AC | 5 ms | 2560 KB |
in19.txt | AC | 50 ms | 7168 KB |
in2.txt | AC | 50 ms | 7168 KB |
in20.txt | AC | 51 ms | 7168 KB |
in21.txt | AC | 50 ms | 7168 KB |
in22.txt | AC | 50 ms | 7168 KB |
in23.txt | AC | 49 ms | 7168 KB |
in24.txt | AC | 50 ms | 7168 KB |
in25.txt | AC | 5 ms | 2560 KB |
in26.txt | AC | 53 ms | 7168 KB |
in27.txt | AC | 52 ms | 7168 KB |
in28.txt | AC | 5 ms | 2560 KB |
in29.txt | AC | 47 ms | 7168 KB |
in3.txt | AC | 49 ms | 7168 KB |
in30.txt | AC | 5 ms | 2560 KB |
in31.txt | AC | 53 ms | 7168 KB |
in32.txt | AC | 55 ms | 7168 KB |
in33.txt | AC | 53 ms | 7168 KB |
in34.txt | AC | 49 ms | 7168 KB |
in35.txt | AC | 49 ms | 7168 KB |
in36.txt | AC | 52 ms | 7168 KB |
in37.txt | AC | 5 ms | 2688 KB |
in38.txt | AC | 50 ms | 7168 KB |
in39.txt | AC | 49 ms | 7168 KB |
in4.txt | AC | 49 ms | 7168 KB |
in40.txt | AC | 50 ms | 7168 KB |
in41.txt | AC | 49 ms | 7168 KB |
in42.txt | AC | 50 ms | 7168 KB |
in43.txt | AC | 48 ms | 7168 KB |
in44.txt | AC | 51 ms | 7168 KB |
in45.txt | AC | 49 ms | 7168 KB |
in5.txt | AC | 49 ms | 7168 KB |
in6.txt | AC | 51 ms | 7168 KB |
in7.txt | AC | 45 ms | 6656 KB |
in8.txt | AC | 15 ms | 3712 KB |
in9.txt | AC | 49 ms | 7168 KB |
sample1.txt | AC | 5 ms | 2560 KB |
sample2.txt | AC | 5 ms | 2560 KB |
sample3.txt | AC | 5 ms | 2560 KB |