Submission #1370468


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pll> P;

const ll INF = 1ll<<30;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int N;
int a[112345];
vector<int> g[112345];
vector<pll> buf[112345];

int main() {
	cin >> N;
	REP(i, N) scanf("%d", a + i);
	REP(i, N - 1) {
		int a, b;
		scanf("%d %d", &a, &b);
		a--; b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	
	
	queue<pii> que; // 現在の頂点, どの頂点からきたか
	REP(i, N) if (g[i].size() == 1) {
		que.push(pii(i, -1));
		buf[i].push_back(pll(a[i], -1));
	}
	
	bool ans = true;
	
	while (!que.empty()) {
		pii now = que.front(); que.pop();
		
		int u = now.fi, bef = now.se;
		ll sum = 0, cnt = 0;
		REP(i, buf[u].size()) {
			sum += buf[u][i].fi;
			if (buf[u][i].se != -1) cnt++;
		}
		
		if (cnt + 1 == g[u].size()) {
			ll to = 2 * a[u] - sum;
			if (to < 0) ans = false;
			
			set<int> ss;
			REP(i, buf[u].size()) ss.insert(buf[u][i].se);
			REP(i, g[u].size()) {
				int v = g[u][i];
				if (v == bef || ss.find(v) != ss.end()) continue;
				
				que.push(pii(v, u));
				buf[v].push_back(pll(to, u));
			}
		}
		else if (cnt == g[u].size()) {
			if (sum != 2 * a[u]) ans = false;
		}
	}
	
	puts(ans ? "YES" : "NO");
	
	return 0;
}

Submission Info

Submission Time
Task C - Cleaning
User tkmst201
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1750 Byte
Status WA
Exec Time 81 ms
Memory 13696 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, N) scanf("%d", a + i);
                              ^
./Main.cpp:33:25: 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
AC × 3
AC × 38
WA × 13
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 WA 76 ms 13696 KB
in10.txt WA 75 ms 13696 KB
in11.txt AC 57 ms 12160 KB
in12.txt AC 58 ms 12160 KB
in13.txt AC 54 ms 12160 KB
in14.txt AC 54 ms 12160 KB
in15.txt AC 3 ms 5504 KB
in16.txt AC 3 ms 5504 KB
in17.txt AC 3 ms 5504 KB
in18.txt AC 3 ms 5504 KB
in19.txt AC 76 ms 13696 KB
in2.txt WA 75 ms 13696 KB
in20.txt AC 76 ms 13696 KB
in21.txt AC 77 ms 13696 KB
in22.txt AC 76 ms 13696 KB
in23.txt AC 72 ms 13696 KB
in24.txt AC 75 ms 13696 KB
in25.txt AC 3 ms 5504 KB
in26.txt AC 77 ms 13696 KB
in27.txt AC 76 ms 13696 KB
in28.txt AC 3 ms 5504 KB
in29.txt AC 73 ms 13696 KB
in3.txt WA 76 ms 13696 KB
in30.txt WA 3 ms 5504 KB
in31.txt AC 79 ms 13696 KB
in32.txt AC 75 ms 13696 KB
in33.txt WA 75 ms 13696 KB
in34.txt WA 75 ms 13696 KB
in35.txt AC 75 ms 13696 KB
in36.txt AC 75 ms 13696 KB
in37.txt AC 4 ms 5632 KB
in38.txt AC 76 ms 13696 KB
in39.txt AC 80 ms 13696 KB
in4.txt WA 75 ms 13696 KB
in40.txt AC 75 ms 13696 KB
in41.txt AC 75 ms 13696 KB
in42.txt AC 75 ms 13696 KB
in43.txt AC 75 ms 13696 KB
in44.txt AC 75 ms 13696 KB
in45.txt AC 75 ms 13696 KB
in5.txt WA 78 ms 13696 KB
in6.txt WA 75 ms 13696 KB
in7.txt WA 69 ms 12800 KB
in8.txt WA 19 ms 7424 KB
in9.txt WA 81 ms 13696 KB
sample1.txt AC 3 ms 5504 KB
sample2.txt AC 3 ms 5504 KB
sample3.txt AC 3 ms 5504 KB