Submission #1672670

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)                                                                             
#define seg_size 524288
int hoge[200] = {};
vector<int> wow[200];
tuple<long long,long long, long long> finding(long long now, long long back) {
	long long ok = hoge[now];
	long long already = 0;
	long long tek = 0;
	for (int i = 0;i < wow[now].size();++i) {
		if (wow[now][i] != back) {
			tuple<long long, long long, long long> hoge = finding(wow[now][i], now);
			if (get<0>(hoge) == true) {
				ok = true;
				already += get<1>(hoge);
				already += get<2>(hoge) * 2;
			}
		}
	}
	return make_tuple(ok, already, tek + 1);
}
int main() {
	int n, x;
	cin >> n >> x;
	REP(i, n) {
		cin >> hoge[i+1];
	}
	REP(i, n - 1) {
		int a, b;
		cin >> a >> b;
		wow[a].push_back(b);
		wow[b].push_back(a);
	}
	cout << get<1>(finding(x, -1)) << endl;
	return 0;
}

Submission Info

Judge Result