oj.uz

답안 #228965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228965 2020-05-03T07:49:30 Z kartel Deblo (COCI18_deblo) C++14
90 / 90
 106 ms 34680 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, i, x, y, a[N];
ll ans;
int f[N][25][2] {0};
vector <int> g[N];

void dfs(int v, int pr)
{
    for (int bt = 0; bt <= 23; bt++)
        {
//            cerr << v << " " << bt << " " << ((a[v] >> bt) & 1) << el;
            f[v][bt][((a[v] >> bt) & 1)]++;
        }


    for (auto u : g[v])
    {
        if (u == pr) continue;

        dfs(u, v);

//        cerr << v << " " << u << endl;

        for (int bt = 0; bt <= 23; bt++)
        {
            ans += (1ll << bt) * f[v][bt][0] * f[u][bt][1];
            ans += (1ll << bt) * f[v][bt][1] * f[u][bt][0];

            int nbt = ((a[v] >> bt) & 1);

            f[v][bt][0] += f[u][bt][nbt];
            f[v][bt][1] += f[u][bt][1 - nbt];
        }
    }
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i], ans += a[i];

    for (i = 1; i < n; i++)
    {
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }

//    cout << el;

    dfs(1, -1);

    cout << ans << el;
}

Subtask #1
90.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2944 KB Output is correct
5 Correct 6 ms 2944 KB Output is correct
6 Correct 77 ms 33660 KB Output is correct
7 Correct 75 ms 34680 KB Output is correct
8 Correct 78 ms 27256 KB Output is correct
9 Correct 81 ms 26488 KB Output is correct
10 Correct 106 ms 25848 KB Output is correct