제출 #255082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255082		leaked	Deblo (COCI18_deblo)	C++14	0 / 90	452 ms	13760 KiB

deblo

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=100000+1;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,N),mt19937(time(0)));
void bad(){
    cout<<"NE";
    exit(0);
}
const int block=317;
const int lg=22;
vector<int>g[N];
int dp[N];
int n,v,u;
int a[N];
bool used[N];
void recalc(int v,int p){
    dp[v]=1;
    for(auto &z : g[v]){
        if(used[z] || z==p) continue;
        recalc(z,v);
        dp[v]+=dp[z];
    }
}
int get_cen(int v,int p,int sz){
    for(auto &z : g[v]){
        if(used[z] || z==p) continue;
        if(dp[z]>sz/2) return get_cen(z,v,sz);
    }
    return v;
}
vector<int>cnt(lg+1,0);
vector<int>o,c;
int lol=0;
void add(int val){
    for(int i=0;i<lg;i++) if(val&pw(i)) cnt[i]++;
}
void dfs(int v,int p,int xr){
    xr^=a[v];
    o.p_b(xr);
    for(auto &z : g[v]){
         if(used[z] || z==p) continue;
         dfs(z,v,xr);
    }
}
ll s=0;
void do_it(int v,int p){
    recalc(v,v);
    c.clear();
    int cen=get_cen(v,v,dp[v]);
    used[cen]=1;v=cen;
    fill(all(cnt),0);lol=1;
    for(auto &z : g[cen]){
        o.clear();
        if(used[z]) continue;
        dfs(z,cen,a[cen]);
        for(auto &g : o){
            for(int i=0;i<lg;i++){
                if(pw(i) & g)s+=(lol-cnt[i])*1ll*pw(i);
                else s+=(cnt[i])*1ll*pw(i);
            }
            s+=g;
        }
//        debug()<<imie(o);
        lol+=sz(o);
        for(auto &g : o) add(g);
    }
    for(auto &z : g[cen]){
        if(used[z] ) continue;
        do_it(z,cen);
    }
}
signed main()
{
    fast_io;
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=1;i<n;i++) {
            cin>>v>>u;--v;--u;
            g[v].p_b(u),g[u].p_b(v);
    }
    do_it(0,0);
    cout<<s;
    return 0;
}
/*


*/

• Subtask 1: 0 / 90