Submission #925328

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
925328	2024-02-11T12:35:09 Z	Whisper	Deblo (COCI18_deblo)	C++17	90 / 90	122 ms	16352 KB

deblo

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode;
int a[MAX];
vector<int> adj[MAX];

int del[MAX], sz[MAX];
void reSubsize(int u, int p){
    sz[u] = 1;
    for (auto&v : adj[u]) if(v ^ p){
        if (!del[v]){
            reSubsize(v, u);
            sz[u] += sz[v];
        }
    }
}
int getCentroid(int u, int p, int siz){
    for (auto&v : adj[u]) if(v ^ p){
        if (!del[v] && 2 * sz[v] > siz) return getCentroid(v, u, siz);
    }
    return u;
}
int cnt[22][2];
int res = 0;
void dfs(int u, int p, int XOR, bool ok){
    if(ok){
        res += XOR;
        REP(i, 22) cnt[i][BIT(XOR, i)]++;
    }
    else{
        REP(i, 22) res += 1ll * MASK(i) * cnt[i][BIT(XOR, i) ^ 1];
    }
    for (auto&v : adj[u]) if(v ^ p){
        if (!del[v]) dfs(v, u, XOR ^ a[v], ok);
    }
}
void decompose(int root){
    reSubsize(root, -1);
    int siz = sz[root];
    root = getCentroid(root, -1, siz);
    del[root] = 1;
    res += a[root];
    for (auto&v : adj[root]){
        if (del[v]) continue;
        dfs(v, root, a[v], 0);
        dfs(v, root, a[v] ^ a[root], 1);
    }
    REP(i, 22) cnt[i][0] = cnt[i][1] = 0;
    for (auto&v : adj[root]) if (!del[v]){
        decompose(v);
    }
}
void Whisper(){
    cin >> numNode;
    for (int i = 1; i <= numNode; ++i) cin >> a[i];
    for (int i = 1; i < numNode; ++i){
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    decompose(1);
    cout << res;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1

90.0 / 90.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	2 ms	4444 KB	Output is correct
5	Correct	2 ms	4444 KB	Output is correct
6	Correct	107 ms	16212 KB	Output is correct
7	Correct	113 ms	16352 KB	Output is correct
8	Correct	122 ms	11592 KB	Output is correct
9	Correct	116 ms	11088 KB	Output is correct
10	Correct	113 ms	10580 KB	Output is correct