제출 #318759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
318759		shrek12357	Deblo (COCI18_deblo)	C++14	90 / 90	190 ms	55140 KiB

deblo

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0); 

const int MAXN = 1e5 + 5;
vector<ll> vals(MAXN);
vector<ll> adjList[MAXN];
ll n;
ll dp[MAXN][25][2];
ll ans[25];

void dfs(int src, int par) {
	for (int i = 0; i < 25; i++) {
		if ((vals[src] >> i) & 1) {
			ans[i]++;
			dp[src][i][1] = 1;
		}
		else {
			dp[src][i][0] = 1;
		}
	}
	for (auto i : adjList[src]) {
		if (i == par) {
			continue;
		}
		dfs(i, src);
		for (int j = 0; j < 25; j++) {
			ans[j] += dp[src][j][1] * dp[i][j][0];
			ans[j] += dp[src][j][0] * dp[i][j][1];
			if ((vals[src] >> j) & 1) {
				dp[src][j][1] += dp[i][j][0];
				dp[src][j][0] += dp[i][j][1];
			}
			else {
				dp[src][j][1] += dp[i][j][1];
				dp[src][j][0] += dp[i][j][0];
			}
		}
	}
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		ll temp;
		cin >> temp;
		vals[i] = temp;
	}
	for (int i = 0; i < n - 1; i++) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		adjList[a].push_back(b);
		adjList[b].push_back(a);
	}
	dfs(0, 0);
	ll ret = 0;
	for (int i = 0; i < 25; i++)
		ret += (ll)ans[i] * (1 << i);
	cout << ret << endl;
}

• Subtask 1: 90 / 90